./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.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_opt-floodmax.3.2.ufo.UNBOUNDED.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 1e059282fd5d86931dc4c64c61df508e5e1072350b4f411e7728a201bfba22a1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:58:01,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:58:01,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:58:01,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:58:01,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:58:01,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:58:01,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:58:01,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:58:01,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:58:01,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:58:01,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:58:01,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:58:01,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:58:01,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:58:01,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:58:01,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:58:01,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:58:01,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:58:01,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:58:01,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:58:01,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:58:01,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:58:01,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:58:01,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:58:01,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:58:01,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:58:01,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:58:01,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:58:01,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:58:01,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:58:01,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:58:01,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:58:01,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:58:01,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:58:01,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:58:01,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:58:01,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:58:01,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:58:01,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:58:01,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:58:01,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:58:01,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:58:01,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:58:01,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:58:01,326 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:58:01,326 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:58:01,326 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:58:01,327 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:58:01,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:58:01,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:58:01,327 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:58:01,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:58:01,328 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:58:01,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:58:01,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:58:01,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:58:01,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:58:01,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:58:01,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:58:01,329 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:58:01,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:58:01,329 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:58:01,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:58:01,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:58:01,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:58:01,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:58:01,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:58:01,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:58:01,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:58:01,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:58:01,330 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:58:01,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:58:01,331 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:58:01,331 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:58:01,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:58:01,331 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 -> 1e059282fd5d86931dc4c64c61df508e5e1072350b4f411e7728a201bfba22a1 [2022-02-20 18:58:01,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:58:01,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:58:01,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:58:01,512 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:58:01,512 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:58:01,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:58:01,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2862f74d/f71fa7ae89a4426fb46d37dbb276eab4/FLAG9240429bf [2022-02-20 18:58:01,987 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:58:01,987 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:58:01,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2862f74d/f71fa7ae89a4426fb46d37dbb276eab4/FLAG9240429bf [2022-02-20 18:58:02,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2862f74d/f71fa7ae89a4426fb46d37dbb276eab4 [2022-02-20 18:58:02,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:58:02,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:58:02,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:58:02,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:58:02,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:58:02,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f57d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02, skipping insertion in model container [2022-02-20 18:58:02,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:58:02,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:58:02,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10504,10517] [2022-02-20 18:58:02,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13076,13089] [2022-02-20 18:58:02,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:58:02,384 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:58:02,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10504,10517] [2022-02-20 18:58:02,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13076,13089] [2022-02-20 18:58:02,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:58:02,505 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:58:02,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02 WrapperNode [2022-02-20 18:58:02,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:58:02,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:58:02,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:58:02,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:58:02,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,586 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1059 [2022-02-20 18:58:02,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:58:02,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:58:02,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:58:02,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:58:02,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:58:02,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:58:02,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:58:02,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:58:02,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02" (1/1) ... [2022-02-20 18:58:02,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:58:02,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:58:02,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:58:02,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:58:02,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:58:02,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:58:02,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:58:02,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:58:02,863 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:58:02,865 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:58:03,522 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:58:03,528 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:58:03,529 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:58:03,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:58:03 BoogieIcfgContainer [2022-02-20 18:58:03,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:58:03,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:58:03,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:58:03,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:58:03,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:58:02" (1/3) ... [2022-02-20 18:58:03,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d616b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:58:03, skipping insertion in model container [2022-02-20 18:58:03,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:58:02" (2/3) ... [2022-02-20 18:58:03,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d616b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:58:03, skipping insertion in model container [2022-02-20 18:58:03,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:58:03" (3/3) ... [2022-02-20 18:58:03,536 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:58:03,539 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:58:03,539 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 18:58:03,569 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:58:03,573 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:58:03,573 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 18:58:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 270 states, 267 states have (on average 1.7790262172284643) internal successors, (475), 269 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 18:58:03,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:03,598 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, 1] [2022-02-20 18:58:03,598 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:03,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:03,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1276327155, now seen corresponding path program 1 times [2022-02-20 18:58:03,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:03,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731100566] [2022-02-20 18:58:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:03,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:04,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {273#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {273#true} is VALID [2022-02-20 18:58:04,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {275#(= (+ (* (- 1) ~ep12~0) |ULTIMATE.start_main_~init__r121~0#1|) 0)} is VALID [2022-02-20 18:58:04,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#(= (+ (* (- 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; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#(<= (+ (* (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); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(<= (+ (* (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); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#(<= (+ (* (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); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#(<= (+ (* (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); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {276#(<= (+ (* (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); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id2~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id3~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 != ~id3~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 >= 0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 >= 0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id3~0 >= 0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r1~0 % 256; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r2~0 % 256; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r3~0 % 256; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r122~0#1 % 256); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r132~0#1 % 256); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r212~0#1 % 256); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r232~0#1 % 256); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r312~0#1 % 256); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r322~0#1 % 256); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max1~0 == ~id1~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max2~0 == ~id2~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max3~0 == ~id3~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st1~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st2~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st3~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl1~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl2~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl3~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode1~0 % 256; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode2~0 % 256; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode3~0 % 256; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == ~newmax1~0 % 256); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == ~newmax2~0 % 256); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,076 INFO L290 TraceCheckUtils]: 43: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {276#(<= (+ (* (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;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~mode1~0 % 256); {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~r1~0 % 256 < 2; {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,078 INFO L290 TraceCheckUtils]: 47: Hoare triple {276#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~ep12~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {274#false} assume !!(0 == ~ep13~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {274#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {274#false} is VALID [2022-02-20 18:58:04,082 INFO L290 TraceCheckUtils]: 50: Hoare triple {274#false} assume !!(0 == ~mode2~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,082 INFO L290 TraceCheckUtils]: 51: Hoare triple {274#false} assume ~r2~0 % 256 < 2; {274#false} is VALID [2022-02-20 18:58:04,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {274#false} assume !!(0 == ~ep21~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,084 INFO L290 TraceCheckUtils]: 53: Hoare triple {274#false} assume !!(0 == ~ep23~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,084 INFO L290 TraceCheckUtils]: 54: Hoare triple {274#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {274#false} is VALID [2022-02-20 18:58:04,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {274#false} assume !!(0 == ~mode3~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {274#false} assume ~r3~0 % 256 < 2; {274#false} is VALID [2022-02-20 18:58:04,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {274#false} assume !!(0 == ~ep31~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {274#false} assume !!(0 == ~ep32~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {274#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; {274#false} is VALID [2022-02-20 18:58:04,087 INFO L290 TraceCheckUtils]: 60: Hoare triple {274#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {274#false} is VALID [2022-02-20 18:58:04,087 INFO L290 TraceCheckUtils]: 61: Hoare triple {274#false} assume ~st1~0 + ~nl1~0 <= 1; {274#false} is VALID [2022-02-20 18:58:04,087 INFO L290 TraceCheckUtils]: 62: Hoare triple {274#false} assume ~st2~0 + ~nl2~0 <= 1; {274#false} is VALID [2022-02-20 18:58:04,087 INFO L290 TraceCheckUtils]: 63: Hoare triple {274#false} assume ~st3~0 + ~nl3~0 <= 1; {274#false} is VALID [2022-02-20 18:58:04,088 INFO L290 TraceCheckUtils]: 64: Hoare triple {274#false} assume !(~r1~0 % 256 >= 2); {274#false} is VALID [2022-02-20 18:58:04,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {274#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {274#false} is VALID [2022-02-20 18:58:04,088 INFO L290 TraceCheckUtils]: 66: Hoare triple {274#false} assume ~r1~0 % 256 < 2; {274#false} is VALID [2022-02-20 18:58:04,088 INFO L290 TraceCheckUtils]: 67: Hoare triple {274#false} assume !(~r1~0 % 256 >= 2); {274#false} is VALID [2022-02-20 18:58:04,089 INFO L290 TraceCheckUtils]: 68: Hoare triple {274#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {274#false} is VALID [2022-02-20 18:58:04,089 INFO L290 TraceCheckUtils]: 69: Hoare triple {274#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {274#false} is VALID [2022-02-20 18:58:04,089 INFO L290 TraceCheckUtils]: 70: Hoare triple {274#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {274#false} is VALID [2022-02-20 18:58:04,089 INFO L290 TraceCheckUtils]: 71: Hoare triple {274#false} assume !(0 == ~mode1~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,089 INFO L290 TraceCheckUtils]: 72: Hoare triple {274#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {274#false} is VALID [2022-02-20 18:58:04,090 INFO L290 TraceCheckUtils]: 73: Hoare triple {274#false} assume !!(0 == ~ep21~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,090 INFO L290 TraceCheckUtils]: 74: Hoare triple {274#false} assume !!(0 == ~ep31~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,090 INFO L290 TraceCheckUtils]: 75: Hoare triple {274#false} ~newmax1~0 := main_~node1__newmax~1#1; {274#false} is VALID [2022-02-20 18:58:04,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {274#false} assume 1 == ~r1~0 % 256; {274#false} is VALID [2022-02-20 18:58:04,091 INFO L290 TraceCheckUtils]: 77: Hoare triple {274#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {274#false} is VALID [2022-02-20 18:58:04,093 INFO L290 TraceCheckUtils]: 78: Hoare triple {274#false} assume !(0 == ~mode2~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,093 INFO L290 TraceCheckUtils]: 79: Hoare triple {274#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {274#false} is VALID [2022-02-20 18:58:04,093 INFO L290 TraceCheckUtils]: 80: Hoare triple {274#false} assume !!(0 == ~ep12~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,094 INFO L290 TraceCheckUtils]: 81: Hoare triple {274#false} assume !!(0 == ~ep32~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,094 INFO L290 TraceCheckUtils]: 82: Hoare triple {274#false} ~newmax2~0 := main_~node2__newmax~1#1; {274#false} is VALID [2022-02-20 18:58:04,094 INFO L290 TraceCheckUtils]: 83: Hoare triple {274#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {274#false} is VALID [2022-02-20 18:58:04,094 INFO L290 TraceCheckUtils]: 84: Hoare triple {274#false} assume !(0 == ~mode3~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,094 INFO L290 TraceCheckUtils]: 85: Hoare triple {274#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {274#false} is VALID [2022-02-20 18:58:04,095 INFO L290 TraceCheckUtils]: 86: Hoare triple {274#false} assume !!(0 == ~ep13~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,098 INFO L290 TraceCheckUtils]: 87: Hoare triple {274#false} assume !!(0 == ~ep23~0 % 256); {274#false} is VALID [2022-02-20 18:58:04,098 INFO L290 TraceCheckUtils]: 88: Hoare triple {274#false} ~newmax3~0 := main_~node3__newmax~1#1; {274#false} is VALID [2022-02-20 18:58:04,098 INFO L290 TraceCheckUtils]: 89: Hoare triple {274#false} assume !(2 == ~r3~0 % 256);~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; {274#false} is VALID [2022-02-20 18:58:04,099 INFO L290 TraceCheckUtils]: 90: Hoare triple {274#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {274#false} is VALID [2022-02-20 18:58:04,099 INFO L290 TraceCheckUtils]: 91: Hoare triple {274#false} assume ~st1~0 + ~nl1~0 <= 1; {274#false} is VALID [2022-02-20 18:58:04,099 INFO L290 TraceCheckUtils]: 92: Hoare triple {274#false} assume ~st2~0 + ~nl2~0 <= 1; {274#false} is VALID [2022-02-20 18:58:04,099 INFO L290 TraceCheckUtils]: 93: Hoare triple {274#false} assume ~st3~0 + ~nl3~0 <= 1; {274#false} is VALID [2022-02-20 18:58:04,099 INFO L290 TraceCheckUtils]: 94: Hoare triple {274#false} assume !(~r1~0 % 256 >= 2); {274#false} is VALID [2022-02-20 18:58:04,100 INFO L290 TraceCheckUtils]: 95: Hoare triple {274#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {274#false} is VALID [2022-02-20 18:58:04,100 INFO L290 TraceCheckUtils]: 96: Hoare triple {274#false} assume 0 == main_~assert__arg~1#1 % 256; {274#false} is VALID [2022-02-20 18:58:04,100 INFO L290 TraceCheckUtils]: 97: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-02-20 18:58:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:04,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:04,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731100566] [2022-02-20 18:58:04,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731100566] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:04,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:04,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:04,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002395908] [2022-02-20 18:58:04,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:04,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-02-20 18:58:04,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:04,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:04,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:04,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:04,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:04,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:04,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:04,224 INFO L87 Difference]: Start difference. First operand has 270 states, 267 states have (on average 1.7790262172284643) internal successors, (475), 269 states have internal predecessors, (475), 0 states have call successors, (0), 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 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:05,274 INFO L93 Difference]: Finished difference Result 782 states and 1378 transitions. [2022-02-20 18:58:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:05,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-02-20 18:58:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1378 transitions. [2022-02-20 18:58:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1378 transitions. [2022-02-20 18:58:05,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1378 transitions. [2022-02-20 18:58:06,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1378 edges. 1378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:06,303 INFO L225 Difference]: With dead ends: 782 [2022-02-20 18:58:06,304 INFO L226 Difference]: Without dead ends: 515 [2022-02-20 18:58:06,309 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:58:06,312 INFO L933 BasicCegarLoop]: 678 mSDtfsCounter, 1094 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:06,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1094 Valid, 1109 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-02-20 18:58:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 492. [2022-02-20 18:58:06,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:06,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 492 states, 490 states have (on average 1.4653061224489796) internal successors, (718), 491 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:06,426 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 492 states, 490 states have (on average 1.4653061224489796) internal successors, (718), 491 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:06,427 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 492 states, 490 states have (on average 1.4653061224489796) internal successors, (718), 491 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:06,443 INFO L93 Difference]: Finished difference Result 515 states and 745 transitions. [2022-02-20 18:58:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 745 transitions. [2022-02-20 18:58:06,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:06,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:06,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 492 states, 490 states have (on average 1.4653061224489796) internal successors, (718), 491 states have internal predecessors, (718), 0 states have call successors, (0), 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 515 states. [2022-02-20 18:58:06,455 INFO L87 Difference]: Start difference. First operand has 492 states, 490 states have (on average 1.4653061224489796) internal successors, (718), 491 states have internal predecessors, (718), 0 states have call successors, (0), 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 515 states. [2022-02-20 18:58:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:06,469 INFO L93 Difference]: Finished difference Result 515 states and 745 transitions. [2022-02-20 18:58:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 745 transitions. [2022-02-20 18:58:06,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:06,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:06,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:06,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 490 states have (on average 1.4653061224489796) internal successors, (718), 491 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 718 transitions. [2022-02-20 18:58:06,488 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 718 transitions. Word has length 98 [2022-02-20 18:58:06,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:06,489 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 718 transitions. [2022-02-20 18:58:06,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 718 transitions. [2022-02-20 18:58:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 18:58:06,492 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:06,493 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, 1, 1] [2022-02-20 18:58:06,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:58:06,493 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:06,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1180437433, now seen corresponding path program 1 times [2022-02-20 18:58:06,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:06,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088698640] [2022-02-20 18:58:06,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:06,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:06,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {2935#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {2935#true} is VALID [2022-02-20 18:58:06,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {2935#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {2935#true} is VALID [2022-02-20 18:58:06,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {2935#true} assume !!(0 == main_~init__r121~0#1 % 256); {2935#true} is VALID [2022-02-20 18:58:06,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {2935#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {2937#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:58:06,562 INFO L290 TraceCheckUtils]: 4: Hoare triple {2937#(= (+ (* (- 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); {2937#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:58:06,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {2937#(= (+ (* (- 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; {2936#false} is VALID [2022-02-20 18:58:06,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#false} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {2936#false} is VALID [2022-02-20 18:58:06,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {2936#false} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {2936#false} is VALID [2022-02-20 18:58:06,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {2936#false} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {2936#false} is VALID [2022-02-20 18:58:06,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {2936#false} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {2936#false} is VALID [2022-02-20 18:58:06,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {2936#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {2936#false} is VALID [2022-02-20 18:58:06,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {2936#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {2936#false} is VALID [2022-02-20 18:58:06,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {2936#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {2936#false} is VALID [2022-02-20 18:58:06,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {2936#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {2936#false} is VALID [2022-02-20 18:58:06,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {2936#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {2936#false} is VALID [2022-02-20 18:58:06,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {2936#false} assume ~id1~0 != ~id2~0; {2936#false} is VALID [2022-02-20 18:58:06,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {2936#false} assume ~id1~0 != ~id3~0; {2936#false} is VALID [2022-02-20 18:58:06,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {2936#false} assume ~id2~0 != ~id3~0; {2936#false} is VALID [2022-02-20 18:58:06,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {2936#false} assume ~id1~0 >= 0; {2936#false} is VALID [2022-02-20 18:58:06,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {2936#false} assume ~id2~0 >= 0; {2936#false} is VALID [2022-02-20 18:58:06,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {2936#false} assume ~id3~0 >= 0; {2936#false} is VALID [2022-02-20 18:58:06,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {2936#false} assume 0 == ~r1~0 % 256; {2936#false} is VALID [2022-02-20 18:58:06,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {2936#false} assume 0 == ~r2~0 % 256; {2936#false} is VALID [2022-02-20 18:58:06,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {2936#false} assume 0 == ~r3~0 % 256; {2936#false} is VALID [2022-02-20 18:58:06,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {2936#false} assume !(0 == main_~init__r122~0#1 % 256); {2936#false} is VALID [2022-02-20 18:58:06,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {2936#false} assume !(0 == main_~init__r132~0#1 % 256); {2936#false} is VALID [2022-02-20 18:58:06,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {2936#false} assume !(0 == main_~init__r212~0#1 % 256); {2936#false} is VALID [2022-02-20 18:58:06,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {2936#false} assume !(0 == main_~init__r232~0#1 % 256); {2936#false} is VALID [2022-02-20 18:58:06,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {2936#false} assume !(0 == main_~init__r312~0#1 % 256); {2936#false} is VALID [2022-02-20 18:58:06,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {2936#false} assume !(0 == main_~init__r322~0#1 % 256); {2936#false} is VALID [2022-02-20 18:58:06,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {2936#false} assume ~max1~0 == ~id1~0; {2936#false} is VALID [2022-02-20 18:58:06,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {2936#false} assume ~max2~0 == ~id2~0; {2936#false} is VALID [2022-02-20 18:58:06,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {2936#false} assume ~max3~0 == ~id3~0; {2936#false} is VALID [2022-02-20 18:58:06,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {2936#false} assume 0 == ~st1~0; {2936#false} is VALID [2022-02-20 18:58:06,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {2936#false} assume 0 == ~st2~0; {2936#false} is VALID [2022-02-20 18:58:06,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {2936#false} assume 0 == ~st3~0; {2936#false} is VALID [2022-02-20 18:58:06,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {2936#false} assume 0 == ~nl1~0; {2936#false} is VALID [2022-02-20 18:58:06,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {2936#false} assume 0 == ~nl2~0; {2936#false} is VALID [2022-02-20 18:58:06,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {2936#false} assume 0 == ~nl3~0; {2936#false} is VALID [2022-02-20 18:58:06,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {2936#false} assume 0 == ~mode1~0 % 256; {2936#false} is VALID [2022-02-20 18:58:06,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {2936#false} assume 0 == ~mode2~0 % 256; {2936#false} is VALID [2022-02-20 18:58:06,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {2936#false} assume 0 == ~mode3~0 % 256; {2936#false} is VALID [2022-02-20 18:58:06,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {2936#false} assume !(0 == ~newmax1~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,569 INFO L290 TraceCheckUtils]: 43: Hoare triple {2936#false} assume !(0 == ~newmax2~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,569 INFO L290 TraceCheckUtils]: 44: Hoare triple {2936#false} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {2936#false} is VALID [2022-02-20 18:58:06,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {2936#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;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {2936#false} is VALID [2022-02-20 18:58:06,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {2936#false} assume !!(0 == ~mode1~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {2936#false} assume ~r1~0 % 256 < 2; {2936#false} is VALID [2022-02-20 18:58:06,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {2936#false} assume !!(0 == ~ep12~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {2936#false} assume !!(0 == ~ep13~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,570 INFO L290 TraceCheckUtils]: 50: Hoare triple {2936#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {2936#false} is VALID [2022-02-20 18:58:06,570 INFO L290 TraceCheckUtils]: 51: Hoare triple {2936#false} assume !!(0 == ~mode2~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {2936#false} assume ~r2~0 % 256 < 2; {2936#false} is VALID [2022-02-20 18:58:06,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {2936#false} assume !!(0 == ~ep21~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {2936#false} assume !!(0 == ~ep23~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,571 INFO L290 TraceCheckUtils]: 55: Hoare triple {2936#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {2936#false} is VALID [2022-02-20 18:58:06,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {2936#false} assume !!(0 == ~mode3~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {2936#false} assume ~r3~0 % 256 < 2; {2936#false} is VALID [2022-02-20 18:58:06,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {2936#false} assume !!(0 == ~ep31~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {2936#false} assume !!(0 == ~ep32~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {2936#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; {2936#false} is VALID [2022-02-20 18:58:06,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {2936#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2936#false} is VALID [2022-02-20 18:58:06,572 INFO L290 TraceCheckUtils]: 62: Hoare triple {2936#false} assume ~st1~0 + ~nl1~0 <= 1; {2936#false} is VALID [2022-02-20 18:58:06,572 INFO L290 TraceCheckUtils]: 63: Hoare triple {2936#false} assume ~st2~0 + ~nl2~0 <= 1; {2936#false} is VALID [2022-02-20 18:58:06,572 INFO L290 TraceCheckUtils]: 64: Hoare triple {2936#false} assume ~st3~0 + ~nl3~0 <= 1; {2936#false} is VALID [2022-02-20 18:58:06,572 INFO L290 TraceCheckUtils]: 65: Hoare triple {2936#false} assume !(~r1~0 % 256 >= 2); {2936#false} is VALID [2022-02-20 18:58:06,572 INFO L290 TraceCheckUtils]: 66: Hoare triple {2936#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2936#false} is VALID [2022-02-20 18:58:06,572 INFO L290 TraceCheckUtils]: 67: Hoare triple {2936#false} assume ~r1~0 % 256 < 2; {2936#false} is VALID [2022-02-20 18:58:06,573 INFO L290 TraceCheckUtils]: 68: Hoare triple {2936#false} assume !(~r1~0 % 256 >= 2); {2936#false} is VALID [2022-02-20 18:58:06,573 INFO L290 TraceCheckUtils]: 69: Hoare triple {2936#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2936#false} is VALID [2022-02-20 18:58:06,573 INFO L290 TraceCheckUtils]: 70: Hoare triple {2936#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {2936#false} is VALID [2022-02-20 18:58:06,573 INFO L290 TraceCheckUtils]: 71: Hoare triple {2936#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {2936#false} is VALID [2022-02-20 18:58:06,573 INFO L290 TraceCheckUtils]: 72: Hoare triple {2936#false} assume !(0 == ~mode1~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,573 INFO L290 TraceCheckUtils]: 73: Hoare triple {2936#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {2936#false} is VALID [2022-02-20 18:58:06,574 INFO L290 TraceCheckUtils]: 74: Hoare triple {2936#false} assume !!(0 == ~ep21~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,574 INFO L290 TraceCheckUtils]: 75: Hoare triple {2936#false} assume !!(0 == ~ep31~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,574 INFO L290 TraceCheckUtils]: 76: Hoare triple {2936#false} ~newmax1~0 := main_~node1__newmax~1#1; {2936#false} is VALID [2022-02-20 18:58:06,574 INFO L290 TraceCheckUtils]: 77: Hoare triple {2936#false} assume 1 == ~r1~0 % 256; {2936#false} is VALID [2022-02-20 18:58:06,574 INFO L290 TraceCheckUtils]: 78: Hoare triple {2936#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {2936#false} is VALID [2022-02-20 18:58:06,574 INFO L290 TraceCheckUtils]: 79: Hoare triple {2936#false} assume !(0 == ~mode2~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,575 INFO L290 TraceCheckUtils]: 80: Hoare triple {2936#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {2936#false} is VALID [2022-02-20 18:58:06,575 INFO L290 TraceCheckUtils]: 81: Hoare triple {2936#false} assume !!(0 == ~ep12~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,575 INFO L290 TraceCheckUtils]: 82: Hoare triple {2936#false} assume !!(0 == ~ep32~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,575 INFO L290 TraceCheckUtils]: 83: Hoare triple {2936#false} ~newmax2~0 := main_~node2__newmax~1#1; {2936#false} is VALID [2022-02-20 18:58:06,575 INFO L290 TraceCheckUtils]: 84: Hoare triple {2936#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {2936#false} is VALID [2022-02-20 18:58:06,575 INFO L290 TraceCheckUtils]: 85: Hoare triple {2936#false} assume !(0 == ~mode3~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,576 INFO L290 TraceCheckUtils]: 86: Hoare triple {2936#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {2936#false} is VALID [2022-02-20 18:58:06,576 INFO L290 TraceCheckUtils]: 87: Hoare triple {2936#false} assume !!(0 == ~ep13~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,576 INFO L290 TraceCheckUtils]: 88: Hoare triple {2936#false} assume !!(0 == ~ep23~0 % 256); {2936#false} is VALID [2022-02-20 18:58:06,576 INFO L290 TraceCheckUtils]: 89: Hoare triple {2936#false} ~newmax3~0 := main_~node3__newmax~1#1; {2936#false} is VALID [2022-02-20 18:58:06,576 INFO L290 TraceCheckUtils]: 90: Hoare triple {2936#false} assume !(2 == ~r3~0 % 256);~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; {2936#false} is VALID [2022-02-20 18:58:06,576 INFO L290 TraceCheckUtils]: 91: Hoare triple {2936#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2936#false} is VALID [2022-02-20 18:58:06,577 INFO L290 TraceCheckUtils]: 92: Hoare triple {2936#false} assume ~st1~0 + ~nl1~0 <= 1; {2936#false} is VALID [2022-02-20 18:58:06,577 INFO L290 TraceCheckUtils]: 93: Hoare triple {2936#false} assume ~st2~0 + ~nl2~0 <= 1; {2936#false} is VALID [2022-02-20 18:58:06,577 INFO L290 TraceCheckUtils]: 94: Hoare triple {2936#false} assume ~st3~0 + ~nl3~0 <= 1; {2936#false} is VALID [2022-02-20 18:58:06,577 INFO L290 TraceCheckUtils]: 95: Hoare triple {2936#false} assume !(~r1~0 % 256 >= 2); {2936#false} is VALID [2022-02-20 18:58:06,577 INFO L290 TraceCheckUtils]: 96: Hoare triple {2936#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {2936#false} is VALID [2022-02-20 18:58:06,577 INFO L290 TraceCheckUtils]: 97: Hoare triple {2936#false} assume 0 == main_~assert__arg~1#1 % 256; {2936#false} is VALID [2022-02-20 18:58:06,577 INFO L290 TraceCheckUtils]: 98: Hoare triple {2936#false} assume !false; {2936#false} is VALID [2022-02-20 18:58:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:06,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:06,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088698640] [2022-02-20 18:58:06,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088698640] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:06,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:06,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:06,579 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906384446] [2022-02-20 18:58:06,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:06,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-02-20 18:58:06,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:06,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:06,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:06,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:06,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:06,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:06,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:06,630 INFO L87 Difference]: Start difference. First operand 492 states and 718 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:07,359 INFO L93 Difference]: Finished difference Result 1438 states and 2092 transitions. [2022-02-20 18:58:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:07,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-02-20 18:58:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1149 transitions. [2022-02-20 18:58:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1149 transitions. [2022-02-20 18:58:07,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1149 transitions. [2022-02-20 18:58:08,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1149 edges. 1149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:08,099 INFO L225 Difference]: With dead ends: 1438 [2022-02-20 18:58:08,099 INFO L226 Difference]: Without dead ends: 974 [2022-02-20 18:58:08,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:08,101 INFO L933 BasicCegarLoop]: 744 mSDtfsCounter, 381 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1127 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:58:08,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 1127 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:08,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-02-20 18:58:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 494. [2022-02-20 18:58:08,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:08,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 974 states. Second operand has 494 states, 492 states have (on average 1.4634146341463414) internal successors, (720), 493 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,155 INFO L74 IsIncluded]: Start isIncluded. First operand 974 states. Second operand has 494 states, 492 states have (on average 1.4634146341463414) internal successors, (720), 493 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,156 INFO L87 Difference]: Start difference. First operand 974 states. Second operand has 494 states, 492 states have (on average 1.4634146341463414) internal successors, (720), 493 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:08,187 INFO L93 Difference]: Finished difference Result 974 states and 1419 transitions. [2022-02-20 18:58:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1419 transitions. [2022-02-20 18:58:08,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:08,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:08,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 492 states have (on average 1.4634146341463414) internal successors, (720), 493 states have internal predecessors, (720), 0 states have call successors, (0), 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 974 states. [2022-02-20 18:58:08,190 INFO L87 Difference]: Start difference. First operand has 494 states, 492 states have (on average 1.4634146341463414) internal successors, (720), 493 states have internal predecessors, (720), 0 states have call successors, (0), 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 974 states. [2022-02-20 18:58:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:08,220 INFO L93 Difference]: Finished difference Result 974 states and 1419 transitions. [2022-02-20 18:58:08,220 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1419 transitions. [2022-02-20 18:58:08,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:08,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:08,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:08,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:08,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 492 states have (on average 1.4634146341463414) internal successors, (720), 493 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 720 transitions. [2022-02-20 18:58:08,232 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 720 transitions. Word has length 99 [2022-02-20 18:58:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:08,233 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 720 transitions. [2022-02-20 18:58:08,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 720 transitions. [2022-02-20 18:58:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-20 18:58:08,234 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:08,234 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, 1, 1, 1] [2022-02-20 18:58:08,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:58:08,234 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:08,235 INFO L85 PathProgramCache]: Analyzing trace with hash -56994056, now seen corresponding path program 1 times [2022-02-20 18:58:08,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:08,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901736006] [2022-02-20 18:58:08,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:08,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:08,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {7358#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {7358#true} is VALID [2022-02-20 18:58:08,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {7358#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {7358#true} is VALID [2022-02-20 18:58:08,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {7358#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {7358#true} is VALID [2022-02-20 18:58:08,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {7358#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {7358#true} is VALID [2022-02-20 18:58:08,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {7358#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {7358#true} is VALID [2022-02-20 18:58:08,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {7358#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {7358#true} is VALID [2022-02-20 18:58:08,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {7358#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {7358#true} is VALID [2022-02-20 18:58:08,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {7358#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {7358#true} is VALID [2022-02-20 18:58:08,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {7358#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {7358#true} is VALID [2022-02-20 18:58:08,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {7358#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {7358#true} is VALID [2022-02-20 18:58:08,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {7358#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {7358#true} is VALID [2022-02-20 18:58:08,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {7358#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {7358#true} is VALID [2022-02-20 18:58:08,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {7358#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {7358#true} is VALID [2022-02-20 18:58:08,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {7358#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {7358#true} is VALID [2022-02-20 18:58:08,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {7358#true} assume ~id1~0 != ~id2~0; {7358#true} is VALID [2022-02-20 18:58:08,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {7358#true} assume ~id1~0 != ~id3~0; {7358#true} is VALID [2022-02-20 18:58:08,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {7358#true} assume ~id2~0 != ~id3~0; {7358#true} is VALID [2022-02-20 18:58:08,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {7358#true} assume ~id1~0 >= 0; {7358#true} is VALID [2022-02-20 18:58:08,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {7358#true} assume ~id2~0 >= 0; {7358#true} is VALID [2022-02-20 18:58:08,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {7358#true} assume ~id3~0 >= 0; {7358#true} is VALID [2022-02-20 18:58:08,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {7358#true} assume 0 == ~r1~0 % 256; {7358#true} is VALID [2022-02-20 18:58:08,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {7358#true} assume 0 == ~r2~0 % 256; {7358#true} is VALID [2022-02-20 18:58:08,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {7358#true} assume 0 == ~r3~0 % 256; {7358#true} is VALID [2022-02-20 18:58:08,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {7358#true} assume !(0 == main_~init__r122~0#1 % 256); {7358#true} is VALID [2022-02-20 18:58:08,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {7358#true} assume !(0 == main_~init__r132~0#1 % 256); {7358#true} is VALID [2022-02-20 18:58:08,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {7358#true} assume !(0 == main_~init__r212~0#1 % 256); {7358#true} is VALID [2022-02-20 18:58:08,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {7358#true} assume !(0 == main_~init__r232~0#1 % 256); {7358#true} is VALID [2022-02-20 18:58:08,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {7358#true} assume !(0 == main_~init__r312~0#1 % 256); {7358#true} is VALID [2022-02-20 18:58:08,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {7358#true} assume !(0 == main_~init__r322~0#1 % 256); {7358#true} is VALID [2022-02-20 18:58:08,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {7358#true} assume ~max1~0 == ~id1~0; {7358#true} is VALID [2022-02-20 18:58:08,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {7358#true} assume ~max2~0 == ~id2~0; {7358#true} is VALID [2022-02-20 18:58:08,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {7358#true} assume ~max3~0 == ~id3~0; {7358#true} is VALID [2022-02-20 18:58:08,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {7358#true} assume 0 == ~st1~0; {7358#true} is VALID [2022-02-20 18:58:08,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {7358#true} assume 0 == ~st2~0; {7358#true} is VALID [2022-02-20 18:58:08,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {7358#true} assume 0 == ~st3~0; {7358#true} is VALID [2022-02-20 18:58:08,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {7358#true} assume 0 == ~nl1~0; {7358#true} is VALID [2022-02-20 18:58:08,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {7358#true} assume 0 == ~nl2~0; {7358#true} is VALID [2022-02-20 18:58:08,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {7358#true} assume 0 == ~nl3~0; {7358#true} is VALID [2022-02-20 18:58:08,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {7358#true} assume 0 == ~mode1~0 % 256; {7358#true} is VALID [2022-02-20 18:58:08,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {7358#true} assume 0 == ~mode2~0 % 256; {7358#true} is VALID [2022-02-20 18:58:08,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {7358#true} assume 0 == ~mode3~0 % 256; {7358#true} is VALID [2022-02-20 18:58:08,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {7358#true} assume !(0 == ~newmax1~0 % 256); {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume !(0 == ~newmax2~0 % 256); {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume !!(0 == ~mode1~0 % 256); {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume ~r1~0 % 256 < 2; {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume !(0 == ~ep12~0 % 256); {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {7360#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume !!(0 == ~newmax1~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {7359#false} assume !!(0 == ~ep13~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {7359#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {7359#false} is VALID [2022-02-20 18:58:08,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {7359#false} assume !!(0 == ~mode2~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {7359#false} assume ~r2~0 % 256 < 2; {7359#false} is VALID [2022-02-20 18:58:08,311 INFO L290 TraceCheckUtils]: 53: Hoare triple {7359#false} assume !!(0 == ~ep21~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {7359#false} assume !!(0 == ~ep23~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {7359#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {7359#false} is VALID [2022-02-20 18:58:08,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {7359#false} assume !!(0 == ~mode3~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {7359#false} assume ~r3~0 % 256 < 2; {7359#false} is VALID [2022-02-20 18:58:08,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {7359#false} assume !!(0 == ~ep31~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {7359#false} assume !!(0 == ~ep32~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {7359#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; {7359#false} is VALID [2022-02-20 18:58:08,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {7359#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7359#false} is VALID [2022-02-20 18:58:08,312 INFO L290 TraceCheckUtils]: 62: Hoare triple {7359#false} assume ~st1~0 + ~nl1~0 <= 1; {7359#false} is VALID [2022-02-20 18:58:08,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {7359#false} assume ~st2~0 + ~nl2~0 <= 1; {7359#false} is VALID [2022-02-20 18:58:08,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {7359#false} assume ~st3~0 + ~nl3~0 <= 1; {7359#false} is VALID [2022-02-20 18:58:08,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {7359#false} assume !(~r1~0 % 256 >= 2); {7359#false} is VALID [2022-02-20 18:58:08,313 INFO L290 TraceCheckUtils]: 66: Hoare triple {7359#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {7359#false} is VALID [2022-02-20 18:58:08,313 INFO L290 TraceCheckUtils]: 67: Hoare triple {7359#false} assume ~r1~0 % 256 < 2; {7359#false} is VALID [2022-02-20 18:58:08,313 INFO L290 TraceCheckUtils]: 68: Hoare triple {7359#false} assume !(~r1~0 % 256 >= 2); {7359#false} is VALID [2022-02-20 18:58:08,313 INFO L290 TraceCheckUtils]: 69: Hoare triple {7359#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {7359#false} is VALID [2022-02-20 18:58:08,314 INFO L290 TraceCheckUtils]: 70: Hoare triple {7359#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {7359#false} is VALID [2022-02-20 18:58:08,314 INFO L290 TraceCheckUtils]: 71: Hoare triple {7359#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {7359#false} is VALID [2022-02-20 18:58:08,314 INFO L290 TraceCheckUtils]: 72: Hoare triple {7359#false} assume !(0 == ~mode1~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,314 INFO L290 TraceCheckUtils]: 73: Hoare triple {7359#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {7359#false} is VALID [2022-02-20 18:58:08,314 INFO L290 TraceCheckUtils]: 74: Hoare triple {7359#false} assume !!(0 == ~ep21~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,314 INFO L290 TraceCheckUtils]: 75: Hoare triple {7359#false} assume !!(0 == ~ep31~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,315 INFO L290 TraceCheckUtils]: 76: Hoare triple {7359#false} ~newmax1~0 := main_~node1__newmax~1#1; {7359#false} is VALID [2022-02-20 18:58:08,315 INFO L290 TraceCheckUtils]: 77: Hoare triple {7359#false} assume 1 == ~r1~0 % 256; {7359#false} is VALID [2022-02-20 18:58:08,315 INFO L290 TraceCheckUtils]: 78: Hoare triple {7359#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {7359#false} is VALID [2022-02-20 18:58:08,315 INFO L290 TraceCheckUtils]: 79: Hoare triple {7359#false} assume !(0 == ~mode2~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,315 INFO L290 TraceCheckUtils]: 80: Hoare triple {7359#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {7359#false} is VALID [2022-02-20 18:58:08,315 INFO L290 TraceCheckUtils]: 81: Hoare triple {7359#false} assume !(0 == ~ep12~0 % 256);~m2~0 := ~p12_old~0;~p12_old~0 := ~nomsg~0; {7359#false} is VALID [2022-02-20 18:58:08,315 INFO L290 TraceCheckUtils]: 82: Hoare triple {7359#false} assume !(~m2~0 > ~max2~0); {7359#false} is VALID [2022-02-20 18:58:08,316 INFO L290 TraceCheckUtils]: 83: Hoare triple {7359#false} assume !!(0 == ~ep32~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,316 INFO L290 TraceCheckUtils]: 84: Hoare triple {7359#false} ~newmax2~0 := main_~node2__newmax~1#1; {7359#false} is VALID [2022-02-20 18:58:08,316 INFO L290 TraceCheckUtils]: 85: Hoare triple {7359#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {7359#false} is VALID [2022-02-20 18:58:08,316 INFO L290 TraceCheckUtils]: 86: Hoare triple {7359#false} assume !(0 == ~mode3~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,316 INFO L290 TraceCheckUtils]: 87: Hoare triple {7359#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {7359#false} is VALID [2022-02-20 18:58:08,316 INFO L290 TraceCheckUtils]: 88: Hoare triple {7359#false} assume !!(0 == ~ep13~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,316 INFO L290 TraceCheckUtils]: 89: Hoare triple {7359#false} assume !!(0 == ~ep23~0 % 256); {7359#false} is VALID [2022-02-20 18:58:08,317 INFO L290 TraceCheckUtils]: 90: Hoare triple {7359#false} ~newmax3~0 := main_~node3__newmax~1#1; {7359#false} is VALID [2022-02-20 18:58:08,317 INFO L290 TraceCheckUtils]: 91: Hoare triple {7359#false} assume !(2 == ~r3~0 % 256);~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; {7359#false} is VALID [2022-02-20 18:58:08,317 INFO L290 TraceCheckUtils]: 92: Hoare triple {7359#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7359#false} is VALID [2022-02-20 18:58:08,317 INFO L290 TraceCheckUtils]: 93: Hoare triple {7359#false} assume ~st1~0 + ~nl1~0 <= 1; {7359#false} is VALID [2022-02-20 18:58:08,317 INFO L290 TraceCheckUtils]: 94: Hoare triple {7359#false} assume ~st2~0 + ~nl2~0 <= 1; {7359#false} is VALID [2022-02-20 18:58:08,317 INFO L290 TraceCheckUtils]: 95: Hoare triple {7359#false} assume ~st3~0 + ~nl3~0 <= 1; {7359#false} is VALID [2022-02-20 18:58:08,317 INFO L290 TraceCheckUtils]: 96: Hoare triple {7359#false} assume !(~r1~0 % 256 >= 2); {7359#false} is VALID [2022-02-20 18:58:08,318 INFO L290 TraceCheckUtils]: 97: Hoare triple {7359#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {7359#false} is VALID [2022-02-20 18:58:08,318 INFO L290 TraceCheckUtils]: 98: Hoare triple {7359#false} assume 0 == main_~assert__arg~1#1 % 256; {7359#false} is VALID [2022-02-20 18:58:08,318 INFO L290 TraceCheckUtils]: 99: Hoare triple {7359#false} assume !false; {7359#false} is VALID [2022-02-20 18:58:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:08,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:08,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901736006] [2022-02-20 18:58:08,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901736006] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:08,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:08,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:08,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829419094] [2022-02-20 18:58:08,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:08,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2022-02-20 18:58:08,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:08,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:08,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:08,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:08,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:08,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:08,383 INFO L87 Difference]: Start difference. First operand 494 states and 720 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:08,852 INFO L93 Difference]: Finished difference Result 1025 states and 1550 transitions. [2022-02-20 18:58:08,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:08,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2022-02-20 18:58:08,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 838 transitions. [2022-02-20 18:58:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 838 transitions. [2022-02-20 18:58:08,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 838 transitions. [2022-02-20 18:58:09,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 838 edges. 838 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:09,419 INFO L225 Difference]: With dead ends: 1025 [2022-02-20 18:58:09,419 INFO L226 Difference]: Without dead ends: 658 [2022-02-20 18:58:09,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:09,427 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 233 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:09,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 803 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-02-20 18:58:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 642. [2022-02-20 18:58:09,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:09,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 658 states. Second operand has 642 states, 640 states have (on average 1.50625) internal successors, (964), 641 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:09,497 INFO L74 IsIncluded]: Start isIncluded. First operand 658 states. Second operand has 642 states, 640 states have (on average 1.50625) internal successors, (964), 641 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:09,498 INFO L87 Difference]: Start difference. First operand 658 states. Second operand has 642 states, 640 states have (on average 1.50625) internal successors, (964), 641 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:09,512 INFO L93 Difference]: Finished difference Result 658 states and 989 transitions. [2022-02-20 18:58:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 989 transitions. [2022-02-20 18:58:09,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:09,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:09,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 642 states, 640 states have (on average 1.50625) internal successors, (964), 641 states have internal predecessors, (964), 0 states have call successors, (0), 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 658 states. [2022-02-20 18:58:09,515 INFO L87 Difference]: Start difference. First operand has 642 states, 640 states have (on average 1.50625) internal successors, (964), 641 states have internal predecessors, (964), 0 states have call successors, (0), 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 658 states. [2022-02-20 18:58:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:09,530 INFO L93 Difference]: Finished difference Result 658 states and 989 transitions. [2022-02-20 18:58:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 989 transitions. [2022-02-20 18:58:09,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:09,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:09,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:09,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 640 states have (on average 1.50625) internal successors, (964), 641 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 964 transitions. [2022-02-20 18:58:09,548 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 964 transitions. Word has length 100 [2022-02-20 18:58:09,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:09,548 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 964 transitions. [2022-02-20 18:58:09,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 964 transitions. [2022-02-20 18:58:09,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-20 18:58:09,549 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:09,549 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, 1, 1, 1] [2022-02-20 18:58:09,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:58:09,550 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:09,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash 329606004, now seen corresponding path program 1 times [2022-02-20 18:58:09,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:09,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680076809] [2022-02-20 18:58:09,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:09,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:09,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {10865#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {10865#true} is VALID [2022-02-20 18:58:09,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {10865#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {10867#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {10867#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {10867#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {10867#(= (+ |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; {10867#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {10867#(= (+ |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); {10867#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {10867#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {10867#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {10867#(= (+ |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; {10867#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {10867#(= (+ |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); {10867#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {10867#(= (+ |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; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {10868#(<= (+ (* 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); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {10868#(<= (+ (* 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); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {10868#(<= (+ (* 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); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {10868#(<= (+ (* 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); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id2~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id3~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 != ~id3~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 >= 0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 >= 0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id3~0 >= 0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r1~0 % 256; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r2~0 % 256; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r3~0 % 256; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r122~0#1 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r132~0#1 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r212~0#1 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r232~0#1 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r312~0#1 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r322~0#1 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max1~0 == ~id1~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max2~0 == ~id2~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max3~0 == ~id3~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st1~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st2~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st3~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl1~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl2~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl3~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode1~0 % 256; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode2~0 % 256; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode3~0 % 256; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == ~newmax1~0 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == ~newmax2~0 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {10868#(<= (+ (* 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;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode1~0 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r1~0 % 256 < 2; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep12~0 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep13~0 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode2~0 % 256); {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r2~0 % 256 < 2; {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {10868#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep21~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {10866#false} assume !!(0 == ~ep23~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {10866#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {10866#false} is VALID [2022-02-20 18:58:09,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {10866#false} assume !!(0 == ~mode3~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {10866#false} assume ~r3~0 % 256 < 2; {10866#false} is VALID [2022-02-20 18:58:09,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {10866#false} assume !!(0 == ~ep31~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,737 INFO L290 TraceCheckUtils]: 60: Hoare triple {10866#false} assume !!(0 == ~ep32~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,737 INFO L290 TraceCheckUtils]: 61: Hoare triple {10866#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; {10866#false} is VALID [2022-02-20 18:58:09,737 INFO L290 TraceCheckUtils]: 62: Hoare triple {10866#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10866#false} is VALID [2022-02-20 18:58:09,737 INFO L290 TraceCheckUtils]: 63: Hoare triple {10866#false} assume ~st1~0 + ~nl1~0 <= 1; {10866#false} is VALID [2022-02-20 18:58:09,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {10866#false} assume ~st2~0 + ~nl2~0 <= 1; {10866#false} is VALID [2022-02-20 18:58:09,737 INFO L290 TraceCheckUtils]: 65: Hoare triple {10866#false} assume ~st3~0 + ~nl3~0 <= 1; {10866#false} is VALID [2022-02-20 18:58:09,737 INFO L290 TraceCheckUtils]: 66: Hoare triple {10866#false} assume !(~r1~0 % 256 >= 2); {10866#false} is VALID [2022-02-20 18:58:09,738 INFO L290 TraceCheckUtils]: 67: Hoare triple {10866#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {10866#false} is VALID [2022-02-20 18:58:09,738 INFO L290 TraceCheckUtils]: 68: Hoare triple {10866#false} assume ~r1~0 % 256 < 2; {10866#false} is VALID [2022-02-20 18:58:09,738 INFO L290 TraceCheckUtils]: 69: Hoare triple {10866#false} assume !(~r1~0 % 256 >= 2); {10866#false} is VALID [2022-02-20 18:58:09,738 INFO L290 TraceCheckUtils]: 70: Hoare triple {10866#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {10866#false} is VALID [2022-02-20 18:58:09,742 INFO L290 TraceCheckUtils]: 71: Hoare triple {10866#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {10866#false} is VALID [2022-02-20 18:58:09,742 INFO L290 TraceCheckUtils]: 72: Hoare triple {10866#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {10866#false} is VALID [2022-02-20 18:58:09,742 INFO L290 TraceCheckUtils]: 73: Hoare triple {10866#false} assume !(0 == ~mode1~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,743 INFO L290 TraceCheckUtils]: 74: Hoare triple {10866#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {10866#false} is VALID [2022-02-20 18:58:09,744 INFO L290 TraceCheckUtils]: 75: Hoare triple {10866#false} assume !!(0 == ~ep21~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,748 INFO L290 TraceCheckUtils]: 76: Hoare triple {10866#false} assume !!(0 == ~ep31~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,748 INFO L290 TraceCheckUtils]: 77: Hoare triple {10866#false} ~newmax1~0 := main_~node1__newmax~1#1; {10866#false} is VALID [2022-02-20 18:58:09,748 INFO L290 TraceCheckUtils]: 78: Hoare triple {10866#false} assume 1 == ~r1~0 % 256; {10866#false} is VALID [2022-02-20 18:58:09,748 INFO L290 TraceCheckUtils]: 79: Hoare triple {10866#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {10866#false} is VALID [2022-02-20 18:58:09,748 INFO L290 TraceCheckUtils]: 80: Hoare triple {10866#false} assume !(0 == ~mode2~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,748 INFO L290 TraceCheckUtils]: 81: Hoare triple {10866#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {10866#false} is VALID [2022-02-20 18:58:09,748 INFO L290 TraceCheckUtils]: 82: Hoare triple {10866#false} assume !!(0 == ~ep12~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,749 INFO L290 TraceCheckUtils]: 83: Hoare triple {10866#false} assume !!(0 == ~ep32~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,749 INFO L290 TraceCheckUtils]: 84: Hoare triple {10866#false} ~newmax2~0 := main_~node2__newmax~1#1; {10866#false} is VALID [2022-02-20 18:58:09,749 INFO L290 TraceCheckUtils]: 85: Hoare triple {10866#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {10866#false} is VALID [2022-02-20 18:58:09,749 INFO L290 TraceCheckUtils]: 86: Hoare triple {10866#false} assume !(0 == ~mode3~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,749 INFO L290 TraceCheckUtils]: 87: Hoare triple {10866#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {10866#false} is VALID [2022-02-20 18:58:09,749 INFO L290 TraceCheckUtils]: 88: Hoare triple {10866#false} assume !!(0 == ~ep13~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,749 INFO L290 TraceCheckUtils]: 89: Hoare triple {10866#false} assume !!(0 == ~ep23~0 % 256); {10866#false} is VALID [2022-02-20 18:58:09,750 INFO L290 TraceCheckUtils]: 90: Hoare triple {10866#false} ~newmax3~0 := main_~node3__newmax~1#1; {10866#false} is VALID [2022-02-20 18:58:09,750 INFO L290 TraceCheckUtils]: 91: Hoare triple {10866#false} assume !(2 == ~r3~0 % 256);~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; {10866#false} is VALID [2022-02-20 18:58:09,751 INFO L290 TraceCheckUtils]: 92: Hoare triple {10866#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10866#false} is VALID [2022-02-20 18:58:09,751 INFO L290 TraceCheckUtils]: 93: Hoare triple {10866#false} assume ~st1~0 + ~nl1~0 <= 1; {10866#false} is VALID [2022-02-20 18:58:09,751 INFO L290 TraceCheckUtils]: 94: Hoare triple {10866#false} assume ~st2~0 + ~nl2~0 <= 1; {10866#false} is VALID [2022-02-20 18:58:09,751 INFO L290 TraceCheckUtils]: 95: Hoare triple {10866#false} assume ~st3~0 + ~nl3~0 <= 1; {10866#false} is VALID [2022-02-20 18:58:09,751 INFO L290 TraceCheckUtils]: 96: Hoare triple {10866#false} assume !(~r1~0 % 256 >= 2); {10866#false} is VALID [2022-02-20 18:58:09,751 INFO L290 TraceCheckUtils]: 97: Hoare triple {10866#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {10866#false} is VALID [2022-02-20 18:58:09,751 INFO L290 TraceCheckUtils]: 98: Hoare triple {10866#false} assume 0 == main_~assert__arg~1#1 % 256; {10866#false} is VALID [2022-02-20 18:58:09,752 INFO L290 TraceCheckUtils]: 99: Hoare triple {10866#false} assume !false; {10866#false} is VALID [2022-02-20 18:58:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:09,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:09,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680076809] [2022-02-20 18:58:09,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680076809] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:09,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:09,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:09,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915695283] [2022-02-20 18:58:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:09,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2022-02-20 18:58:09,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:09,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:09,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:09,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:09,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:09,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:09,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:09,819 INFO L87 Difference]: Start difference. First operand 642 states and 964 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:10,835 INFO L93 Difference]: Finished difference Result 1838 states and 2748 transitions. [2022-02-20 18:58:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:10,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2022-02-20 18:58:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1097 transitions. [2022-02-20 18:58:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1097 transitions. [2022-02-20 18:58:10,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1097 transitions. [2022-02-20 18:58:11,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1097 edges. 1097 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:11,629 INFO L225 Difference]: With dead ends: 1838 [2022-02-20 18:58:11,629 INFO L226 Difference]: Without dead ends: 1226 [2022-02-20 18:58:11,630 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:58:11,631 INFO L933 BasicCegarLoop]: 640 mSDtfsCounter, 769 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 992 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:58:11,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [769 Valid, 992 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-02-20 18:58:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1196. [2022-02-20 18:58:11,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:11,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1226 states. Second operand has 1196 states, 1194 states have (on average 1.4932998324958124) internal successors, (1783), 1195 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:11,866 INFO L74 IsIncluded]: Start isIncluded. First operand 1226 states. Second operand has 1196 states, 1194 states have (on average 1.4932998324958124) internal successors, (1783), 1195 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:11,867 INFO L87 Difference]: Start difference. First operand 1226 states. Second operand has 1196 states, 1194 states have (on average 1.4932998324958124) internal successors, (1783), 1195 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:11,906 INFO L93 Difference]: Finished difference Result 1226 states and 1819 transitions. [2022-02-20 18:58:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1819 transitions. [2022-02-20 18:58:11,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:11,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:11,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 1196 states, 1194 states have (on average 1.4932998324958124) internal successors, (1783), 1195 states have internal predecessors, (1783), 0 states have call successors, (0), 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 1226 states. [2022-02-20 18:58:11,911 INFO L87 Difference]: Start difference. First operand has 1196 states, 1194 states have (on average 1.4932998324958124) internal successors, (1783), 1195 states have internal predecessors, (1783), 0 states have call successors, (0), 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 1226 states. [2022-02-20 18:58:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:11,950 INFO L93 Difference]: Finished difference Result 1226 states and 1819 transitions. [2022-02-20 18:58:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1819 transitions. [2022-02-20 18:58:11,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:11,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:11,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:11,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1194 states have (on average 1.4932998324958124) internal successors, (1783), 1195 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1783 transitions. [2022-02-20 18:58:12,001 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1783 transitions. Word has length 100 [2022-02-20 18:58:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:12,001 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 1783 transitions. [2022-02-20 18:58:12,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1783 transitions. [2022-02-20 18:58:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 18:58:12,003 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:12,003 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, 1, 1, 1, 1] [2022-02-20 18:58:12,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:58:12,003 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:12,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash 386972200, now seen corresponding path program 1 times [2022-02-20 18:58:12,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:12,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872735891] [2022-02-20 18:58:12,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:12,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:12,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {17299#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {17299#true} is VALID [2022-02-20 18:58:12,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {17299#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {17299#true} is VALID [2022-02-20 18:58:12,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {17299#true} assume !!(0 == main_~init__r121~0#1 % 256); {17299#true} is VALID [2022-02-20 18:58:12,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {17299#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {17299#true} is VALID [2022-02-20 18:58:12,049 INFO L290 TraceCheckUtils]: 4: Hoare triple {17299#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {17299#true} is VALID [2022-02-20 18:58:12,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {17299#true} assume !!(0 == main_~init__r131~0#1 % 256); {17299#true} is VALID [2022-02-20 18:58:12,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {17299#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {17299#true} is VALID [2022-02-20 18:58:12,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {17299#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {17299#true} is VALID [2022-02-20 18:58:12,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {17299#true} assume !!(0 == main_~init__r211~0#1 % 256); {17299#true} is VALID [2022-02-20 18:58:12,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {17299#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {17301#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} is VALID [2022-02-20 18:58:12,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {17301#(= (+ |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); {17301#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} is VALID [2022-02-20 18:58:12,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {17301#(= (+ |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; {17300#false} is VALID [2022-02-20 18:58:12,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {17300#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {17300#false} is VALID [2022-02-20 18:58:12,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {17300#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {17300#false} is VALID [2022-02-20 18:58:12,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {17300#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {17300#false} is VALID [2022-02-20 18:58:12,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {17300#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {17300#false} is VALID [2022-02-20 18:58:12,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {17300#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {17300#false} is VALID [2022-02-20 18:58:12,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {17300#false} assume ~id1~0 != ~id2~0; {17300#false} is VALID [2022-02-20 18:58:12,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {17300#false} assume ~id1~0 != ~id3~0; {17300#false} is VALID [2022-02-20 18:58:12,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {17300#false} assume ~id2~0 != ~id3~0; {17300#false} is VALID [2022-02-20 18:58:12,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {17300#false} assume ~id1~0 >= 0; {17300#false} is VALID [2022-02-20 18:58:12,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {17300#false} assume ~id2~0 >= 0; {17300#false} is VALID [2022-02-20 18:58:12,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {17300#false} assume ~id3~0 >= 0; {17300#false} is VALID [2022-02-20 18:58:12,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {17300#false} assume 0 == ~r1~0 % 256; {17300#false} is VALID [2022-02-20 18:58:12,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {17300#false} assume 0 == ~r2~0 % 256; {17300#false} is VALID [2022-02-20 18:58:12,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {17300#false} assume 0 == ~r3~0 % 256; {17300#false} is VALID [2022-02-20 18:58:12,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {17300#false} assume !(0 == main_~init__r122~0#1 % 256); {17300#false} is VALID [2022-02-20 18:58:12,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {17300#false} assume !(0 == main_~init__r132~0#1 % 256); {17300#false} is VALID [2022-02-20 18:58:12,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {17300#false} assume !(0 == main_~init__r212~0#1 % 256); {17300#false} is VALID [2022-02-20 18:58:12,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {17300#false} assume !(0 == main_~init__r232~0#1 % 256); {17300#false} is VALID [2022-02-20 18:58:12,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {17300#false} assume !(0 == main_~init__r312~0#1 % 256); {17300#false} is VALID [2022-02-20 18:58:12,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {17300#false} assume !(0 == main_~init__r322~0#1 % 256); {17300#false} is VALID [2022-02-20 18:58:12,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {17300#false} assume ~max1~0 == ~id1~0; {17300#false} is VALID [2022-02-20 18:58:12,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {17300#false} assume ~max2~0 == ~id2~0; {17300#false} is VALID [2022-02-20 18:58:12,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {17300#false} assume ~max3~0 == ~id3~0; {17300#false} is VALID [2022-02-20 18:58:12,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {17300#false} assume 0 == ~st1~0; {17300#false} is VALID [2022-02-20 18:58:12,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {17300#false} assume 0 == ~st2~0; {17300#false} is VALID [2022-02-20 18:58:12,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {17300#false} assume 0 == ~st3~0; {17300#false} is VALID [2022-02-20 18:58:12,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {17300#false} assume 0 == ~nl1~0; {17300#false} is VALID [2022-02-20 18:58:12,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {17300#false} assume 0 == ~nl2~0; {17300#false} is VALID [2022-02-20 18:58:12,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {17300#false} assume 0 == ~nl3~0; {17300#false} is VALID [2022-02-20 18:58:12,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {17300#false} assume 0 == ~mode1~0 % 256; {17300#false} is VALID [2022-02-20 18:58:12,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {17300#false} assume 0 == ~mode2~0 % 256; {17300#false} is VALID [2022-02-20 18:58:12,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {17300#false} assume 0 == ~mode3~0 % 256; {17300#false} is VALID [2022-02-20 18:58:12,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {17300#false} assume !(0 == ~newmax1~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {17300#false} assume !(0 == ~newmax2~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {17300#false} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {17300#false} is VALID [2022-02-20 18:58:12,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {17300#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;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {17300#false} is VALID [2022-02-20 18:58:12,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {17300#false} assume !!(0 == ~mode1~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {17300#false} assume ~r1~0 % 256 < 2; {17300#false} is VALID [2022-02-20 18:58:12,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {17300#false} assume !!(0 == ~ep12~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {17300#false} assume !!(0 == ~ep13~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {17300#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {17300#false} is VALID [2022-02-20 18:58:12,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {17300#false} assume !!(0 == ~mode2~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {17300#false} assume ~r2~0 % 256 < 2; {17300#false} is VALID [2022-02-20 18:58:12,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {17300#false} assume !!(0 == ~ep21~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {17300#false} assume !!(0 == ~ep23~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {17300#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {17300#false} is VALID [2022-02-20 18:58:12,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {17300#false} assume !!(0 == ~mode3~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {17300#false} assume ~r3~0 % 256 < 2; {17300#false} is VALID [2022-02-20 18:58:12,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {17300#false} assume !!(0 == ~ep31~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {17300#false} assume !!(0 == ~ep32~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {17300#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; {17300#false} is VALID [2022-02-20 18:58:12,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {17300#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17300#false} is VALID [2022-02-20 18:58:12,061 INFO L290 TraceCheckUtils]: 64: Hoare triple {17300#false} assume ~st1~0 + ~nl1~0 <= 1; {17300#false} is VALID [2022-02-20 18:58:12,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {17300#false} assume ~st2~0 + ~nl2~0 <= 1; {17300#false} is VALID [2022-02-20 18:58:12,062 INFO L290 TraceCheckUtils]: 66: Hoare triple {17300#false} assume ~st3~0 + ~nl3~0 <= 1; {17300#false} is VALID [2022-02-20 18:58:12,062 INFO L290 TraceCheckUtils]: 67: Hoare triple {17300#false} assume !(~r1~0 % 256 >= 2); {17300#false} is VALID [2022-02-20 18:58:12,062 INFO L290 TraceCheckUtils]: 68: Hoare triple {17300#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {17300#false} is VALID [2022-02-20 18:58:12,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {17300#false} assume ~r1~0 % 256 < 2; {17300#false} is VALID [2022-02-20 18:58:12,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {17300#false} assume !(~r1~0 % 256 >= 2); {17300#false} is VALID [2022-02-20 18:58:12,062 INFO L290 TraceCheckUtils]: 71: Hoare triple {17300#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {17300#false} is VALID [2022-02-20 18:58:12,062 INFO L290 TraceCheckUtils]: 72: Hoare triple {17300#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {17300#false} is VALID [2022-02-20 18:58:12,063 INFO L290 TraceCheckUtils]: 73: Hoare triple {17300#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {17300#false} is VALID [2022-02-20 18:58:12,063 INFO L290 TraceCheckUtils]: 74: Hoare triple {17300#false} assume !(0 == ~mode1~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,063 INFO L290 TraceCheckUtils]: 75: Hoare triple {17300#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {17300#false} is VALID [2022-02-20 18:58:12,063 INFO L290 TraceCheckUtils]: 76: Hoare triple {17300#false} assume !!(0 == ~ep21~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,063 INFO L290 TraceCheckUtils]: 77: Hoare triple {17300#false} assume !!(0 == ~ep31~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,063 INFO L290 TraceCheckUtils]: 78: Hoare triple {17300#false} ~newmax1~0 := main_~node1__newmax~1#1; {17300#false} is VALID [2022-02-20 18:58:12,063 INFO L290 TraceCheckUtils]: 79: Hoare triple {17300#false} assume 1 == ~r1~0 % 256; {17300#false} is VALID [2022-02-20 18:58:12,063 INFO L290 TraceCheckUtils]: 80: Hoare triple {17300#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {17300#false} is VALID [2022-02-20 18:58:12,063 INFO L290 TraceCheckUtils]: 81: Hoare triple {17300#false} assume !(0 == ~mode2~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,064 INFO L290 TraceCheckUtils]: 82: Hoare triple {17300#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {17300#false} is VALID [2022-02-20 18:58:12,064 INFO L290 TraceCheckUtils]: 83: Hoare triple {17300#false} assume !!(0 == ~ep12~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,064 INFO L290 TraceCheckUtils]: 84: Hoare triple {17300#false} assume !!(0 == ~ep32~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,064 INFO L290 TraceCheckUtils]: 85: Hoare triple {17300#false} ~newmax2~0 := main_~node2__newmax~1#1; {17300#false} is VALID [2022-02-20 18:58:12,064 INFO L290 TraceCheckUtils]: 86: Hoare triple {17300#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {17300#false} is VALID [2022-02-20 18:58:12,064 INFO L290 TraceCheckUtils]: 87: Hoare triple {17300#false} assume !(0 == ~mode3~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,064 INFO L290 TraceCheckUtils]: 88: Hoare triple {17300#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {17300#false} is VALID [2022-02-20 18:58:12,064 INFO L290 TraceCheckUtils]: 89: Hoare triple {17300#false} assume !!(0 == ~ep13~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,065 INFO L290 TraceCheckUtils]: 90: Hoare triple {17300#false} assume !!(0 == ~ep23~0 % 256); {17300#false} is VALID [2022-02-20 18:58:12,065 INFO L290 TraceCheckUtils]: 91: Hoare triple {17300#false} ~newmax3~0 := main_~node3__newmax~1#1; {17300#false} is VALID [2022-02-20 18:58:12,065 INFO L290 TraceCheckUtils]: 92: Hoare triple {17300#false} assume !(2 == ~r3~0 % 256);~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; {17300#false} is VALID [2022-02-20 18:58:12,065 INFO L290 TraceCheckUtils]: 93: Hoare triple {17300#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17300#false} is VALID [2022-02-20 18:58:12,065 INFO L290 TraceCheckUtils]: 94: Hoare triple {17300#false} assume ~st1~0 + ~nl1~0 <= 1; {17300#false} is VALID [2022-02-20 18:58:12,065 INFO L290 TraceCheckUtils]: 95: Hoare triple {17300#false} assume ~st2~0 + ~nl2~0 <= 1; {17300#false} is VALID [2022-02-20 18:58:12,065 INFO L290 TraceCheckUtils]: 96: Hoare triple {17300#false} assume ~st3~0 + ~nl3~0 <= 1; {17300#false} is VALID [2022-02-20 18:58:12,065 INFO L290 TraceCheckUtils]: 97: Hoare triple {17300#false} assume !(~r1~0 % 256 >= 2); {17300#false} is VALID [2022-02-20 18:58:12,066 INFO L290 TraceCheckUtils]: 98: Hoare triple {17300#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {17300#false} is VALID [2022-02-20 18:58:12,066 INFO L290 TraceCheckUtils]: 99: Hoare triple {17300#false} assume 0 == main_~assert__arg~1#1 % 256; {17300#false} is VALID [2022-02-20 18:58:12,066 INFO L290 TraceCheckUtils]: 100: Hoare triple {17300#false} assume !false; {17300#false} is VALID [2022-02-20 18:58:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:12,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:12,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872735891] [2022-02-20 18:58:12,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872735891] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:12,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:12,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:12,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171178838] [2022-02-20 18:58:12,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:12,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-02-20 18:58:12,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:12,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:12,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:12,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:12,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:12,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:12,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:12,118 INFO L87 Difference]: Start difference. First operand 1196 states and 1783 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:13,362 INFO L93 Difference]: Finished difference Result 3512 states and 5229 transitions. [2022-02-20 18:58:13,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:13,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-02-20 18:58:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2022-02-20 18:58:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2022-02-20 18:58:13,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1115 transitions. [2022-02-20 18:58:13,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1115 edges. 1115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:14,095 INFO L225 Difference]: With dead ends: 3512 [2022-02-20 18:58:14,095 INFO L226 Difference]: Without dead ends: 2360 [2022-02-20 18:58:14,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:14,097 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 365 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 899 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:58:14,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 899 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2022-02-20 18:58:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1200. [2022-02-20 18:58:14,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:14,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2360 states. Second operand has 1200 states, 1198 states have (on average 1.491652754590985) internal successors, (1787), 1199 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:14,314 INFO L74 IsIncluded]: Start isIncluded. First operand 2360 states. Second operand has 1200 states, 1198 states have (on average 1.491652754590985) internal successors, (1787), 1199 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:14,316 INFO L87 Difference]: Start difference. First operand 2360 states. Second operand has 1200 states, 1198 states have (on average 1.491652754590985) internal successors, (1787), 1199 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:14,470 INFO L93 Difference]: Finished difference Result 2360 states and 3513 transitions. [2022-02-20 18:58:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3513 transitions. [2022-02-20 18:58:14,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:14,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:14,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 1200 states, 1198 states have (on average 1.491652754590985) internal successors, (1787), 1199 states have internal predecessors, (1787), 0 states have call successors, (0), 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 2360 states. [2022-02-20 18:58:14,482 INFO L87 Difference]: Start difference. First operand has 1200 states, 1198 states have (on average 1.491652754590985) internal successors, (1787), 1199 states have internal predecessors, (1787), 0 states have call successors, (0), 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 2360 states. [2022-02-20 18:58:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:14,633 INFO L93 Difference]: Finished difference Result 2360 states and 3513 transitions. [2022-02-20 18:58:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3513 transitions. [2022-02-20 18:58:14,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:14,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:14,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:14,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1198 states have (on average 1.491652754590985) internal successors, (1787), 1199 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1787 transitions. [2022-02-20 18:58:14,686 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1787 transitions. Word has length 101 [2022-02-20 18:58:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:14,686 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 1787 transitions. [2022-02-20 18:58:14,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1787 transitions. [2022-02-20 18:58:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 18:58:14,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:14,688 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, 1, 1, 1, 1, 1] [2022-02-20 18:58:14,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:58:14,688 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1171143051, now seen corresponding path program 1 times [2022-02-20 18:58:14,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:14,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299771107] [2022-02-20 18:58:14,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:14,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {28212#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {28212#true} is VALID [2022-02-20 18:58:14,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {28212#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {28214#(= (+ |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; {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {28214#(= (+ |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); {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {28214#(= (+ |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; {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {28214#(= (+ |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); {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {28214#(= (+ |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; {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {28214#(= (+ |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); {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256); {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {28214#(= (+ |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; {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {28214#(= (+ |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); {28214#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:14,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {28214#(= (+ |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; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {28215#(<= (+ (* 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); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {28215#(<= (+ (* 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); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id2~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id3~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 != ~id3~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 >= 0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 >= 0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id3~0 >= 0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r1~0 % 256; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r2~0 % 256; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r3~0 % 256; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r122~0#1 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r132~0#1 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r212~0#1 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r232~0#1 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r312~0#1 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r322~0#1 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max1~0 == ~id1~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max2~0 == ~id2~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max3~0 == ~id3~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st1~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st2~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st3~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl1~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl2~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl3~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode1~0 % 256; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode2~0 % 256; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode3~0 % 256; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == ~newmax1~0 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == ~newmax2~0 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {28215#(<= (+ (* 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;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,782 INFO L290 TraceCheckUtils]: 49: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode1~0 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r1~0 % 256 < 2; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep12~0 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,782 INFO L290 TraceCheckUtils]: 52: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep13~0 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode2~0 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,783 INFO L290 TraceCheckUtils]: 55: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r2~0 % 256 < 2; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep21~0 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep23~0 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,784 INFO L290 TraceCheckUtils]: 58: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,784 INFO L290 TraceCheckUtils]: 59: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode3~0 % 256); {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r3~0 % 256 < 2; {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:14,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {28215#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep31~0 % 256); {28213#false} is VALID [2022-02-20 18:58:14,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {28213#false} assume !!(0 == ~ep32~0 % 256); {28213#false} is VALID [2022-02-20 18:58:14,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {28213#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; {28213#false} is VALID [2022-02-20 18:58:14,786 INFO L290 TraceCheckUtils]: 64: Hoare triple {28213#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {28213#false} is VALID [2022-02-20 18:58:14,786 INFO L290 TraceCheckUtils]: 65: Hoare triple {28213#false} assume ~st1~0 + ~nl1~0 <= 1; {28213#false} is VALID [2022-02-20 18:58:14,786 INFO L290 TraceCheckUtils]: 66: Hoare triple {28213#false} assume ~st2~0 + ~nl2~0 <= 1; {28213#false} is VALID [2022-02-20 18:58:14,786 INFO L290 TraceCheckUtils]: 67: Hoare triple {28213#false} assume ~st3~0 + ~nl3~0 <= 1; {28213#false} is VALID [2022-02-20 18:58:14,786 INFO L290 TraceCheckUtils]: 68: Hoare triple {28213#false} assume !(~r1~0 % 256 >= 2); {28213#false} is VALID [2022-02-20 18:58:14,786 INFO L290 TraceCheckUtils]: 69: Hoare triple {28213#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {28213#false} is VALID [2022-02-20 18:58:14,786 INFO L290 TraceCheckUtils]: 70: Hoare triple {28213#false} assume ~r1~0 % 256 < 2; {28213#false} is VALID [2022-02-20 18:58:14,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {28213#false} assume !(~r1~0 % 256 >= 2); {28213#false} is VALID [2022-02-20 18:58:14,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {28213#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {28213#false} is VALID [2022-02-20 18:58:14,787 INFO L290 TraceCheckUtils]: 73: Hoare triple {28213#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {28213#false} is VALID [2022-02-20 18:58:14,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {28213#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {28213#false} is VALID [2022-02-20 18:58:14,787 INFO L290 TraceCheckUtils]: 75: Hoare triple {28213#false} assume !(0 == ~mode1~0 % 256); {28213#false} is VALID [2022-02-20 18:58:14,787 INFO L290 TraceCheckUtils]: 76: Hoare triple {28213#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {28213#false} is VALID [2022-02-20 18:58:14,787 INFO L290 TraceCheckUtils]: 77: Hoare triple {28213#false} assume !!(0 == ~ep21~0 % 256); {28213#false} is VALID [2022-02-20 18:58:14,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {28213#false} assume !!(0 == ~ep31~0 % 256); {28213#false} is VALID [2022-02-20 18:58:14,787 INFO L290 TraceCheckUtils]: 79: Hoare triple {28213#false} ~newmax1~0 := main_~node1__newmax~1#1; {28213#false} is VALID [2022-02-20 18:58:14,787 INFO L290 TraceCheckUtils]: 80: Hoare triple {28213#false} assume 1 == ~r1~0 % 256; {28213#false} is VALID [2022-02-20 18:58:14,788 INFO L290 TraceCheckUtils]: 81: Hoare triple {28213#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {28213#false} is VALID [2022-02-20 18:58:14,788 INFO L290 TraceCheckUtils]: 82: Hoare triple {28213#false} assume !(0 == ~mode2~0 % 256); {28213#false} is VALID [2022-02-20 18:58:14,788 INFO L290 TraceCheckUtils]: 83: Hoare triple {28213#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {28213#false} is VALID [2022-02-20 18:58:14,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {28213#false} assume !!(0 == ~ep12~0 % 256); {28213#false} is VALID [2022-02-20 18:58:14,788 INFO L290 TraceCheckUtils]: 85: Hoare triple {28213#false} assume !!(0 == ~ep32~0 % 256); {28213#false} is VALID [2022-02-20 18:58:14,788 INFO L290 TraceCheckUtils]: 86: Hoare triple {28213#false} ~newmax2~0 := main_~node2__newmax~1#1; {28213#false} is VALID [2022-02-20 18:58:14,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {28213#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {28213#false} is VALID [2022-02-20 18:58:14,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {28213#false} assume !(0 == ~mode3~0 % 256); {28213#false} is VALID [2022-02-20 18:58:14,788 INFO L290 TraceCheckUtils]: 89: Hoare triple {28213#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {28213#false} is VALID [2022-02-20 18:58:14,789 INFO L290 TraceCheckUtils]: 90: Hoare triple {28213#false} assume !!(0 == ~ep13~0 % 256); {28213#false} is VALID [2022-02-20 18:58:14,789 INFO L290 TraceCheckUtils]: 91: Hoare triple {28213#false} assume !!(0 == ~ep23~0 % 256); {28213#false} is VALID [2022-02-20 18:58:14,789 INFO L290 TraceCheckUtils]: 92: Hoare triple {28213#false} ~newmax3~0 := main_~node3__newmax~1#1; {28213#false} is VALID [2022-02-20 18:58:14,789 INFO L290 TraceCheckUtils]: 93: Hoare triple {28213#false} assume !(2 == ~r3~0 % 256);~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; {28213#false} is VALID [2022-02-20 18:58:14,789 INFO L290 TraceCheckUtils]: 94: Hoare triple {28213#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {28213#false} is VALID [2022-02-20 18:58:14,789 INFO L290 TraceCheckUtils]: 95: Hoare triple {28213#false} assume ~st1~0 + ~nl1~0 <= 1; {28213#false} is VALID [2022-02-20 18:58:14,789 INFO L290 TraceCheckUtils]: 96: Hoare triple {28213#false} assume ~st2~0 + ~nl2~0 <= 1; {28213#false} is VALID [2022-02-20 18:58:14,789 INFO L290 TraceCheckUtils]: 97: Hoare triple {28213#false} assume ~st3~0 + ~nl3~0 <= 1; {28213#false} is VALID [2022-02-20 18:58:14,790 INFO L290 TraceCheckUtils]: 98: Hoare triple {28213#false} assume !(~r1~0 % 256 >= 2); {28213#false} is VALID [2022-02-20 18:58:14,790 INFO L290 TraceCheckUtils]: 99: Hoare triple {28213#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {28213#false} is VALID [2022-02-20 18:58:14,790 INFO L290 TraceCheckUtils]: 100: Hoare triple {28213#false} assume 0 == main_~assert__arg~1#1 % 256; {28213#false} is VALID [2022-02-20 18:58:14,790 INFO L290 TraceCheckUtils]: 101: Hoare triple {28213#false} assume !false; {28213#false} is VALID [2022-02-20 18:58:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:14,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:14,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299771107] [2022-02-20 18:58:14,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299771107] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:14,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:14,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:14,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626895169] [2022-02-20 18:58:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:14,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:58:14,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:14,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:14,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:14,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:14,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:14,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:14,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:14,854 INFO L87 Difference]: Start difference. First operand 1200 states and 1787 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:16,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:16,592 INFO L93 Difference]: Finished difference Result 3440 states and 5109 transitions. [2022-02-20 18:58:16,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:16,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-02-20 18:58:16,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1090 transitions. [2022-02-20 18:58:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1090 transitions. [2022-02-20 18:58:16,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1090 transitions. [2022-02-20 18:58:17,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1090 edges. 1090 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:17,493 INFO L225 Difference]: With dead ends: 3440 [2022-02-20 18:58:17,494 INFO L226 Difference]: Without dead ends: 2288 [2022-02-20 18:58:17,495 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:58:17,496 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 767 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 977 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:58:17,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [767 Valid, 977 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2022-02-20 18:58:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2258. [2022-02-20 18:58:18,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:18,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2288 states. Second operand has 2258 states, 2256 states have (on average 1.4765070921985815) internal successors, (3331), 2257 states have internal predecessors, (3331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:18,098 INFO L74 IsIncluded]: Start isIncluded. First operand 2288 states. Second operand has 2258 states, 2256 states have (on average 1.4765070921985815) internal successors, (3331), 2257 states have internal predecessors, (3331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:18,100 INFO L87 Difference]: Start difference. First operand 2288 states. Second operand has 2258 states, 2256 states have (on average 1.4765070921985815) internal successors, (3331), 2257 states have internal predecessors, (3331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:18,246 INFO L93 Difference]: Finished difference Result 2288 states and 3367 transitions. [2022-02-20 18:58:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 3367 transitions. [2022-02-20 18:58:18,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:18,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:18,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 2258 states, 2256 states have (on average 1.4765070921985815) internal successors, (3331), 2257 states have internal predecessors, (3331), 0 states have call successors, (0), 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 2288 states. [2022-02-20 18:58:18,252 INFO L87 Difference]: Start difference. First operand has 2258 states, 2256 states have (on average 1.4765070921985815) internal successors, (3331), 2257 states have internal predecessors, (3331), 0 states have call successors, (0), 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 2288 states. [2022-02-20 18:58:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:18,395 INFO L93 Difference]: Finished difference Result 2288 states and 3367 transitions. [2022-02-20 18:58:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 3367 transitions. [2022-02-20 18:58:18,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:18,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:18,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:18,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2256 states have (on average 1.4765070921985815) internal successors, (3331), 2257 states have internal predecessors, (3331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3331 transitions. [2022-02-20 18:58:18,591 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3331 transitions. Word has length 102 [2022-02-20 18:58:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:18,591 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 3331 transitions. [2022-02-20 18:58:18,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3331 transitions. [2022-02-20 18:58:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-20 18:58:18,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:18,593 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, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:18,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:58:18,593 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:18,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:18,594 INFO L85 PathProgramCache]: Analyzing trace with hash -308769655, now seen corresponding path program 1 times [2022-02-20 18:58:18,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:18,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771897093] [2022-02-20 18:58:18,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:18,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:18,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {40284#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {40284#true} is VALID [2022-02-20 18:58:18,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {40284#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {40284#true} is VALID [2022-02-20 18:58:18,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {40284#true} assume !!(0 == main_~init__r121~0#1 % 256); {40284#true} is VALID [2022-02-20 18:58:18,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {40284#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {40284#true} is VALID [2022-02-20 18:58:18,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {40284#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {40284#true} is VALID [2022-02-20 18:58:18,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {40284#true} assume !!(0 == main_~init__r131~0#1 % 256); {40284#true} is VALID [2022-02-20 18:58:18,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {40284#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {40284#true} is VALID [2022-02-20 18:58:18,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {40284#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {40284#true} is VALID [2022-02-20 18:58:18,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {40284#true} assume !!(0 == main_~init__r211~0#1 % 256); {40284#true} is VALID [2022-02-20 18:58:18,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {40284#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {40284#true} is VALID [2022-02-20 18:58:18,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {40284#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {40284#true} is VALID [2022-02-20 18:58:18,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {40284#true} assume !!(0 == main_~init__r231~0#1 % 256); {40284#true} is VALID [2022-02-20 18:58:18,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {40284#true} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {40284#true} is VALID [2022-02-20 18:58:18,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {40284#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {40284#true} is VALID [2022-02-20 18:58:18,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {40284#true} assume !!(0 == main_~init__r311~0#1 % 256); {40284#true} is VALID [2022-02-20 18:58:18,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {40284#true} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {40286#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} is VALID [2022-02-20 18:58:18,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {40286#(= (+ |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); {40286#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} is VALID [2022-02-20 18:58:18,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {40286#(= (+ |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; {40285#false} is VALID [2022-02-20 18:58:18,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {40285#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {40285#false} is VALID [2022-02-20 18:58:18,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {40285#false} assume ~id1~0 != ~id2~0; {40285#false} is VALID [2022-02-20 18:58:18,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {40285#false} assume ~id1~0 != ~id3~0; {40285#false} is VALID [2022-02-20 18:58:18,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {40285#false} assume ~id2~0 != ~id3~0; {40285#false} is VALID [2022-02-20 18:58:18,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {40285#false} assume ~id1~0 >= 0; {40285#false} is VALID [2022-02-20 18:58:18,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {40285#false} assume ~id2~0 >= 0; {40285#false} is VALID [2022-02-20 18:58:18,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {40285#false} assume ~id3~0 >= 0; {40285#false} is VALID [2022-02-20 18:58:18,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {40285#false} assume 0 == ~r1~0 % 256; {40285#false} is VALID [2022-02-20 18:58:18,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {40285#false} assume 0 == ~r2~0 % 256; {40285#false} is VALID [2022-02-20 18:58:18,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {40285#false} assume 0 == ~r3~0 % 256; {40285#false} is VALID [2022-02-20 18:58:18,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {40285#false} assume !(0 == main_~init__r122~0#1 % 256); {40285#false} is VALID [2022-02-20 18:58:18,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {40285#false} assume !(0 == main_~init__r132~0#1 % 256); {40285#false} is VALID [2022-02-20 18:58:18,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {40285#false} assume !(0 == main_~init__r212~0#1 % 256); {40285#false} is VALID [2022-02-20 18:58:18,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {40285#false} assume !(0 == main_~init__r232~0#1 % 256); {40285#false} is VALID [2022-02-20 18:58:18,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {40285#false} assume !(0 == main_~init__r312~0#1 % 256); {40285#false} is VALID [2022-02-20 18:58:18,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {40285#false} assume !(0 == main_~init__r322~0#1 % 256); {40285#false} is VALID [2022-02-20 18:58:18,644 INFO L290 TraceCheckUtils]: 34: Hoare triple {40285#false} assume ~max1~0 == ~id1~0; {40285#false} is VALID [2022-02-20 18:58:18,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {40285#false} assume ~max2~0 == ~id2~0; {40285#false} is VALID [2022-02-20 18:58:18,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {40285#false} assume ~max3~0 == ~id3~0; {40285#false} is VALID [2022-02-20 18:58:18,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {40285#false} assume 0 == ~st1~0; {40285#false} is VALID [2022-02-20 18:58:18,645 INFO L290 TraceCheckUtils]: 38: Hoare triple {40285#false} assume 0 == ~st2~0; {40285#false} is VALID [2022-02-20 18:58:18,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {40285#false} assume 0 == ~st3~0; {40285#false} is VALID [2022-02-20 18:58:18,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {40285#false} assume 0 == ~nl1~0; {40285#false} is VALID [2022-02-20 18:58:18,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {40285#false} assume 0 == ~nl2~0; {40285#false} is VALID [2022-02-20 18:58:18,645 INFO L290 TraceCheckUtils]: 42: Hoare triple {40285#false} assume 0 == ~nl3~0; {40285#false} is VALID [2022-02-20 18:58:18,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {40285#false} assume 0 == ~mode1~0 % 256; {40285#false} is VALID [2022-02-20 18:58:18,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {40285#false} assume 0 == ~mode2~0 % 256; {40285#false} is VALID [2022-02-20 18:58:18,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {40285#false} assume 0 == ~mode3~0 % 256; {40285#false} is VALID [2022-02-20 18:58:18,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {40285#false} assume !(0 == ~newmax1~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {40285#false} assume !(0 == ~newmax2~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {40285#false} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {40285#false} is VALID [2022-02-20 18:58:18,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {40285#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;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {40285#false} is VALID [2022-02-20 18:58:18,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {40285#false} assume !!(0 == ~mode1~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {40285#false} assume ~r1~0 % 256 < 2; {40285#false} is VALID [2022-02-20 18:58:18,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {40285#false} assume !!(0 == ~ep12~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {40285#false} assume !!(0 == ~ep13~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {40285#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {40285#false} is VALID [2022-02-20 18:58:18,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {40285#false} assume !!(0 == ~mode2~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,647 INFO L290 TraceCheckUtils]: 56: Hoare triple {40285#false} assume ~r2~0 % 256 < 2; {40285#false} is VALID [2022-02-20 18:58:18,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {40285#false} assume !!(0 == ~ep21~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {40285#false} assume !!(0 == ~ep23~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,648 INFO L290 TraceCheckUtils]: 59: Hoare triple {40285#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {40285#false} is VALID [2022-02-20 18:58:18,648 INFO L290 TraceCheckUtils]: 60: Hoare triple {40285#false} assume !!(0 == ~mode3~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {40285#false} assume ~r3~0 % 256 < 2; {40285#false} is VALID [2022-02-20 18:58:18,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {40285#false} assume !!(0 == ~ep31~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,648 INFO L290 TraceCheckUtils]: 63: Hoare triple {40285#false} assume !!(0 == ~ep32~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,648 INFO L290 TraceCheckUtils]: 64: Hoare triple {40285#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; {40285#false} is VALID [2022-02-20 18:58:18,648 INFO L290 TraceCheckUtils]: 65: Hoare triple {40285#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {40285#false} is VALID [2022-02-20 18:58:18,648 INFO L290 TraceCheckUtils]: 66: Hoare triple {40285#false} assume ~st1~0 + ~nl1~0 <= 1; {40285#false} is VALID [2022-02-20 18:58:18,648 INFO L290 TraceCheckUtils]: 67: Hoare triple {40285#false} assume ~st2~0 + ~nl2~0 <= 1; {40285#false} is VALID [2022-02-20 18:58:18,649 INFO L290 TraceCheckUtils]: 68: Hoare triple {40285#false} assume ~st3~0 + ~nl3~0 <= 1; {40285#false} is VALID [2022-02-20 18:58:18,649 INFO L290 TraceCheckUtils]: 69: Hoare triple {40285#false} assume !(~r1~0 % 256 >= 2); {40285#false} is VALID [2022-02-20 18:58:18,649 INFO L290 TraceCheckUtils]: 70: Hoare triple {40285#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {40285#false} is VALID [2022-02-20 18:58:18,649 INFO L290 TraceCheckUtils]: 71: Hoare triple {40285#false} assume ~r1~0 % 256 < 2; {40285#false} is VALID [2022-02-20 18:58:18,649 INFO L290 TraceCheckUtils]: 72: Hoare triple {40285#false} assume !(~r1~0 % 256 >= 2); {40285#false} is VALID [2022-02-20 18:58:18,649 INFO L290 TraceCheckUtils]: 73: Hoare triple {40285#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {40285#false} is VALID [2022-02-20 18:58:18,649 INFO L290 TraceCheckUtils]: 74: Hoare triple {40285#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {40285#false} is VALID [2022-02-20 18:58:18,649 INFO L290 TraceCheckUtils]: 75: Hoare triple {40285#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {40285#false} is VALID [2022-02-20 18:58:18,650 INFO L290 TraceCheckUtils]: 76: Hoare triple {40285#false} assume !(0 == ~mode1~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,650 INFO L290 TraceCheckUtils]: 77: Hoare triple {40285#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {40285#false} is VALID [2022-02-20 18:58:18,650 INFO L290 TraceCheckUtils]: 78: Hoare triple {40285#false} assume !!(0 == ~ep21~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,650 INFO L290 TraceCheckUtils]: 79: Hoare triple {40285#false} assume !!(0 == ~ep31~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,650 INFO L290 TraceCheckUtils]: 80: Hoare triple {40285#false} ~newmax1~0 := main_~node1__newmax~1#1; {40285#false} is VALID [2022-02-20 18:58:18,650 INFO L290 TraceCheckUtils]: 81: Hoare triple {40285#false} assume 1 == ~r1~0 % 256; {40285#false} is VALID [2022-02-20 18:58:18,650 INFO L290 TraceCheckUtils]: 82: Hoare triple {40285#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {40285#false} is VALID [2022-02-20 18:58:18,650 INFO L290 TraceCheckUtils]: 83: Hoare triple {40285#false} assume !(0 == ~mode2~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,650 INFO L290 TraceCheckUtils]: 84: Hoare triple {40285#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {40285#false} is VALID [2022-02-20 18:58:18,651 INFO L290 TraceCheckUtils]: 85: Hoare triple {40285#false} assume !!(0 == ~ep12~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,651 INFO L290 TraceCheckUtils]: 86: Hoare triple {40285#false} assume !!(0 == ~ep32~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,651 INFO L290 TraceCheckUtils]: 87: Hoare triple {40285#false} ~newmax2~0 := main_~node2__newmax~1#1; {40285#false} is VALID [2022-02-20 18:58:18,651 INFO L290 TraceCheckUtils]: 88: Hoare triple {40285#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {40285#false} is VALID [2022-02-20 18:58:18,651 INFO L290 TraceCheckUtils]: 89: Hoare triple {40285#false} assume !(0 == ~mode3~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,651 INFO L290 TraceCheckUtils]: 90: Hoare triple {40285#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {40285#false} is VALID [2022-02-20 18:58:18,651 INFO L290 TraceCheckUtils]: 91: Hoare triple {40285#false} assume !!(0 == ~ep13~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,651 INFO L290 TraceCheckUtils]: 92: Hoare triple {40285#false} assume !!(0 == ~ep23~0 % 256); {40285#false} is VALID [2022-02-20 18:58:18,652 INFO L290 TraceCheckUtils]: 93: Hoare triple {40285#false} ~newmax3~0 := main_~node3__newmax~1#1; {40285#false} is VALID [2022-02-20 18:58:18,652 INFO L290 TraceCheckUtils]: 94: Hoare triple {40285#false} assume !(2 == ~r3~0 % 256);~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; {40285#false} is VALID [2022-02-20 18:58:18,652 INFO L290 TraceCheckUtils]: 95: Hoare triple {40285#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {40285#false} is VALID [2022-02-20 18:58:18,652 INFO L290 TraceCheckUtils]: 96: Hoare triple {40285#false} assume ~st1~0 + ~nl1~0 <= 1; {40285#false} is VALID [2022-02-20 18:58:18,652 INFO L290 TraceCheckUtils]: 97: Hoare triple {40285#false} assume ~st2~0 + ~nl2~0 <= 1; {40285#false} is VALID [2022-02-20 18:58:18,652 INFO L290 TraceCheckUtils]: 98: Hoare triple {40285#false} assume ~st3~0 + ~nl3~0 <= 1; {40285#false} is VALID [2022-02-20 18:58:18,652 INFO L290 TraceCheckUtils]: 99: Hoare triple {40285#false} assume !(~r1~0 % 256 >= 2); {40285#false} is VALID [2022-02-20 18:58:18,652 INFO L290 TraceCheckUtils]: 100: Hoare triple {40285#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {40285#false} is VALID [2022-02-20 18:58:18,652 INFO L290 TraceCheckUtils]: 101: Hoare triple {40285#false} assume 0 == main_~assert__arg~1#1 % 256; {40285#false} is VALID [2022-02-20 18:58:18,653 INFO L290 TraceCheckUtils]: 102: Hoare triple {40285#false} assume !false; {40285#false} is VALID [2022-02-20 18:58:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:18,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:18,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771897093] [2022-02-20 18:58:18,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771897093] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:18,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:18,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:18,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019129114] [2022-02-20 18:58:18,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:18,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-02-20 18:58:18,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:18,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:18,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:18,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:18,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:18,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:18,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:18,725 INFO L87 Difference]: Start difference. First operand 2258 states and 3331 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:22,060 INFO L93 Difference]: Finished difference Result 6342 states and 9421 transitions. [2022-02-20 18:58:22,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:22,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-02-20 18:58:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1087 transitions. [2022-02-20 18:58:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1087 transitions. [2022-02-20 18:58:22,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1087 transitions. [2022-02-20 18:58:22,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1087 edges. 1087 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:23,511 INFO L225 Difference]: With dead ends: 6342 [2022-02-20 18:58:23,512 INFO L226 Difference]: Without dead ends: 4424 [2022-02-20 18:58:23,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:23,515 INFO L933 BasicCegarLoop]: 738 mSDtfsCounter, 351 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1119 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:58:23,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 1119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4424 states. [2022-02-20 18:58:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 2266. [2022-02-20 18:58:24,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:24,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4424 states. Second operand has 2266 states, 2264 states have (on average 1.4748233215547704) internal successors, (3339), 2265 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:24,128 INFO L74 IsIncluded]: Start isIncluded. First operand 4424 states. Second operand has 2266 states, 2264 states have (on average 1.4748233215547704) internal successors, (3339), 2265 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:24,129 INFO L87 Difference]: Start difference. First operand 4424 states. Second operand has 2266 states, 2264 states have (on average 1.4748233215547704) internal successors, (3339), 2265 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:24,658 INFO L93 Difference]: Finished difference Result 4424 states and 6519 transitions. [2022-02-20 18:58:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 6519 transitions. [2022-02-20 18:58:24,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:24,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:24,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 2266 states, 2264 states have (on average 1.4748233215547704) internal successors, (3339), 2265 states have internal predecessors, (3339), 0 states have call successors, (0), 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 4424 states. [2022-02-20 18:58:24,667 INFO L87 Difference]: Start difference. First operand has 2266 states, 2264 states have (on average 1.4748233215547704) internal successors, (3339), 2265 states have internal predecessors, (3339), 0 states have call successors, (0), 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 4424 states. [2022-02-20 18:58:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:25,227 INFO L93 Difference]: Finished difference Result 4424 states and 6519 transitions. [2022-02-20 18:58:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 6519 transitions. [2022-02-20 18:58:25,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:25,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:25,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:25,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2266 states, 2264 states have (on average 1.4748233215547704) internal successors, (3339), 2265 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 3339 transitions. [2022-02-20 18:58:25,419 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 3339 transitions. Word has length 103 [2022-02-20 18:58:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:25,420 INFO L470 AbstractCegarLoop]: Abstraction has 2266 states and 3339 transitions. [2022-02-20 18:58:25,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 3339 transitions. [2022-02-20 18:58:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-20 18:58:25,421 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:25,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:25,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:58:25,422 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:25,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:25,422 INFO L85 PathProgramCache]: Analyzing trace with hash 407327222, now seen corresponding path program 1 times [2022-02-20 18:58:25,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:25,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760355099] [2022-02-20 18:58:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:25,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {60503#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {60503#true} is VALID [2022-02-20 18:58:25,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {60503#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {60505#(= (+ |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; {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,517 INFO L290 TraceCheckUtils]: 4: Hoare triple {60505#(= (+ |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); {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {60505#(= (+ |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; {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {60505#(= (+ |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); {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {60505#(= (+ |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; {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {60505#(= (+ |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); {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256); {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {60505#(= (+ |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; {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {60505#(= (+ |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); {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r311~0#1 % 256); {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:58:25,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {60505#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !(0 == main_~init__r321~0#1 % 256); {60506#(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:58:25,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {60506#(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; {60506#(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:58:25,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {60506#(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); {60506#(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:58:25,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {60506#(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; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {60507#(<= (+ (* 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); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 != ~id2~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 != ~id3~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id2~0 != ~id3~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 >= 0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id2~0 >= 0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id3~0 >= 0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r1~0 % 256; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r2~0 % 256; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r3~0 % 256; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r122~0#1 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r132~0#1 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r212~0#1 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r232~0#1 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r312~0#1 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r322~0#1 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max1~0 == ~id1~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max2~0 == ~id2~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max3~0 == ~id3~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st1~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st2~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,529 INFO L290 TraceCheckUtils]: 40: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st3~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl1~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl2~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl3~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode1~0 % 256; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode2~0 % 256; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode3~0 % 256; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,531 INFO L290 TraceCheckUtils]: 47: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == ~newmax1~0 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,531 INFO L290 TraceCheckUtils]: 48: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == ~newmax2~0 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,532 INFO L290 TraceCheckUtils]: 50: Hoare triple {60507#(<= (+ (* 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;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,532 INFO L290 TraceCheckUtils]: 51: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode1~0 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,532 INFO L290 TraceCheckUtils]: 52: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r1~0 % 256 < 2; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep12~0 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep13~0 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,533 INFO L290 TraceCheckUtils]: 55: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode2~0 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,534 INFO L290 TraceCheckUtils]: 57: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r2~0 % 256 < 2; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,534 INFO L290 TraceCheckUtils]: 58: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep21~0 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,534 INFO L290 TraceCheckUtils]: 59: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep23~0 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode3~0 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r3~0 % 256 < 2; {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,535 INFO L290 TraceCheckUtils]: 63: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep31~0 % 256); {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:58:25,536 INFO L290 TraceCheckUtils]: 64: Hoare triple {60507#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep32~0 % 256); {60504#false} is VALID [2022-02-20 18:58:25,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {60504#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; {60504#false} is VALID [2022-02-20 18:58:25,536 INFO L290 TraceCheckUtils]: 66: Hoare triple {60504#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60504#false} is VALID [2022-02-20 18:58:25,536 INFO L290 TraceCheckUtils]: 67: Hoare triple {60504#false} assume ~st1~0 + ~nl1~0 <= 1; {60504#false} is VALID [2022-02-20 18:58:25,536 INFO L290 TraceCheckUtils]: 68: Hoare triple {60504#false} assume ~st2~0 + ~nl2~0 <= 1; {60504#false} is VALID [2022-02-20 18:58:25,537 INFO L290 TraceCheckUtils]: 69: Hoare triple {60504#false} assume ~st3~0 + ~nl3~0 <= 1; {60504#false} is VALID [2022-02-20 18:58:25,537 INFO L290 TraceCheckUtils]: 70: Hoare triple {60504#false} assume !(~r1~0 % 256 >= 2); {60504#false} is VALID [2022-02-20 18:58:25,537 INFO L290 TraceCheckUtils]: 71: Hoare triple {60504#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {60504#false} is VALID [2022-02-20 18:58:25,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {60504#false} assume ~r1~0 % 256 < 2; {60504#false} is VALID [2022-02-20 18:58:25,537 INFO L290 TraceCheckUtils]: 73: Hoare triple {60504#false} assume !(~r1~0 % 256 >= 2); {60504#false} is VALID [2022-02-20 18:58:25,537 INFO L290 TraceCheckUtils]: 74: Hoare triple {60504#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {60504#false} is VALID [2022-02-20 18:58:25,537 INFO L290 TraceCheckUtils]: 75: Hoare triple {60504#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {60504#false} is VALID [2022-02-20 18:58:25,537 INFO L290 TraceCheckUtils]: 76: Hoare triple {60504#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {60504#false} is VALID [2022-02-20 18:58:25,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {60504#false} assume !(0 == ~mode1~0 % 256); {60504#false} is VALID [2022-02-20 18:58:25,538 INFO L290 TraceCheckUtils]: 78: Hoare triple {60504#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {60504#false} is VALID [2022-02-20 18:58:25,538 INFO L290 TraceCheckUtils]: 79: Hoare triple {60504#false} assume !!(0 == ~ep21~0 % 256); {60504#false} is VALID [2022-02-20 18:58:25,538 INFO L290 TraceCheckUtils]: 80: Hoare triple {60504#false} assume !!(0 == ~ep31~0 % 256); {60504#false} is VALID [2022-02-20 18:58:25,538 INFO L290 TraceCheckUtils]: 81: Hoare triple {60504#false} ~newmax1~0 := main_~node1__newmax~1#1; {60504#false} is VALID [2022-02-20 18:58:25,538 INFO L290 TraceCheckUtils]: 82: Hoare triple {60504#false} assume 1 == ~r1~0 % 256; {60504#false} is VALID [2022-02-20 18:58:25,538 INFO L290 TraceCheckUtils]: 83: Hoare triple {60504#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {60504#false} is VALID [2022-02-20 18:58:25,538 INFO L290 TraceCheckUtils]: 84: Hoare triple {60504#false} assume !(0 == ~mode2~0 % 256); {60504#false} is VALID [2022-02-20 18:58:25,538 INFO L290 TraceCheckUtils]: 85: Hoare triple {60504#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {60504#false} is VALID [2022-02-20 18:58:25,539 INFO L290 TraceCheckUtils]: 86: Hoare triple {60504#false} assume !!(0 == ~ep12~0 % 256); {60504#false} is VALID [2022-02-20 18:58:25,539 INFO L290 TraceCheckUtils]: 87: Hoare triple {60504#false} assume !!(0 == ~ep32~0 % 256); {60504#false} is VALID [2022-02-20 18:58:25,539 INFO L290 TraceCheckUtils]: 88: Hoare triple {60504#false} ~newmax2~0 := main_~node2__newmax~1#1; {60504#false} is VALID [2022-02-20 18:58:25,539 INFO L290 TraceCheckUtils]: 89: Hoare triple {60504#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {60504#false} is VALID [2022-02-20 18:58:25,539 INFO L290 TraceCheckUtils]: 90: Hoare triple {60504#false} assume !(0 == ~mode3~0 % 256); {60504#false} is VALID [2022-02-20 18:58:25,539 INFO L290 TraceCheckUtils]: 91: Hoare triple {60504#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {60504#false} is VALID [2022-02-20 18:58:25,539 INFO L290 TraceCheckUtils]: 92: Hoare triple {60504#false} assume !!(0 == ~ep13~0 % 256); {60504#false} is VALID [2022-02-20 18:58:25,539 INFO L290 TraceCheckUtils]: 93: Hoare triple {60504#false} assume !!(0 == ~ep23~0 % 256); {60504#false} is VALID [2022-02-20 18:58:25,540 INFO L290 TraceCheckUtils]: 94: Hoare triple {60504#false} ~newmax3~0 := main_~node3__newmax~1#1; {60504#false} is VALID [2022-02-20 18:58:25,540 INFO L290 TraceCheckUtils]: 95: Hoare triple {60504#false} assume !(2 == ~r3~0 % 256);~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; {60504#false} is VALID [2022-02-20 18:58:25,540 INFO L290 TraceCheckUtils]: 96: Hoare triple {60504#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60504#false} is VALID [2022-02-20 18:58:25,540 INFO L290 TraceCheckUtils]: 97: Hoare triple {60504#false} assume ~st1~0 + ~nl1~0 <= 1; {60504#false} is VALID [2022-02-20 18:58:25,540 INFO L290 TraceCheckUtils]: 98: Hoare triple {60504#false} assume ~st2~0 + ~nl2~0 <= 1; {60504#false} is VALID [2022-02-20 18:58:25,540 INFO L290 TraceCheckUtils]: 99: Hoare triple {60504#false} assume ~st3~0 + ~nl3~0 <= 1; {60504#false} is VALID [2022-02-20 18:58:25,540 INFO L290 TraceCheckUtils]: 100: Hoare triple {60504#false} assume !(~r1~0 % 256 >= 2); {60504#false} is VALID [2022-02-20 18:58:25,540 INFO L290 TraceCheckUtils]: 101: Hoare triple {60504#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {60504#false} is VALID [2022-02-20 18:58:25,540 INFO L290 TraceCheckUtils]: 102: Hoare triple {60504#false} assume 0 == main_~assert__arg~1#1 % 256; {60504#false} is VALID [2022-02-20 18:58:25,541 INFO L290 TraceCheckUtils]: 103: Hoare triple {60504#false} assume !false; {60504#false} is VALID [2022-02-20 18:58:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:25,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:25,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760355099] [2022-02-20 18:58:25,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760355099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:25,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:25,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:58:25,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121388575] [2022-02-20 18:58:25,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:25,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 18:58:25,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:25,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:25,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:25,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:58:25,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:25,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:58:25,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:58:25,611 INFO L87 Difference]: Start difference. First operand 2266 states and 3339 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:29,554 INFO L93 Difference]: Finished difference Result 6523 states and 9584 transitions. [2022-02-20 18:58:29,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:29,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 18:58:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1097 transitions. [2022-02-20 18:58:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1097 transitions. [2022-02-20 18:58:29,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1097 transitions. [2022-02-20 18:58:30,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1097 edges. 1097 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:30,984 INFO L225 Difference]: With dead ends: 6523 [2022-02-20 18:58:30,984 INFO L226 Difference]: Without dead ends: 4345 [2022-02-20 18:58:30,986 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:58:30,987 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 1147 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:30,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1147 Valid, 974 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:30,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4345 states. [2022-02-20 18:58:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4345 to 4324. [2022-02-20 18:58:32,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:32,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4345 states. Second operand has 4324 states, 4322 states have (on average 1.4562702452568255) internal successors, (6294), 4323 states have internal predecessors, (6294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:32,442 INFO L74 IsIncluded]: Start isIncluded. First operand 4345 states. Second operand has 4324 states, 4322 states have (on average 1.4562702452568255) internal successors, (6294), 4323 states have internal predecessors, (6294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:32,446 INFO L87 Difference]: Start difference. First operand 4345 states. Second operand has 4324 states, 4322 states have (on average 1.4562702452568255) internal successors, (6294), 4323 states have internal predecessors, (6294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:32,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:32,944 INFO L93 Difference]: Finished difference Result 4345 states and 6317 transitions. [2022-02-20 18:58:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 6317 transitions. [2022-02-20 18:58:32,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:32,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:32,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 4324 states, 4322 states have (on average 1.4562702452568255) internal successors, (6294), 4323 states have internal predecessors, (6294), 0 states have call successors, (0), 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 4345 states. [2022-02-20 18:58:32,956 INFO L87 Difference]: Start difference. First operand has 4324 states, 4322 states have (on average 1.4562702452568255) internal successors, (6294), 4323 states have internal predecessors, (6294), 0 states have call successors, (0), 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 4345 states. [2022-02-20 18:58:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:33,484 INFO L93 Difference]: Finished difference Result 4345 states and 6317 transitions. [2022-02-20 18:58:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 6317 transitions. [2022-02-20 18:58:33,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:33,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:33,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:33,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4324 states, 4322 states have (on average 1.4562702452568255) internal successors, (6294), 4323 states have internal predecessors, (6294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4324 states to 4324 states and 6294 transitions. [2022-02-20 18:58:34,175 INFO L78 Accepts]: Start accepts. Automaton has 4324 states and 6294 transitions. Word has length 104 [2022-02-20 18:58:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:34,175 INFO L470 AbstractCegarLoop]: Abstraction has 4324 states and 6294 transitions. [2022-02-20 18:58:34,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4324 states and 6294 transitions. [2022-02-20 18:58:34,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-20 18:58:34,178 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:34,178 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:34,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:58:34,178 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:34,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:34,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1168400906, now seen corresponding path program 1 times [2022-02-20 18:58:34,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:34,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336804379] [2022-02-20 18:58:34,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:34,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:34,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {83484#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {83484#true} is VALID [2022-02-20 18:58:34,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {83484#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {83484#true} is VALID [2022-02-20 18:58:34,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {83484#true} assume !!(0 == main_~init__r121~0#1 % 256); {83484#true} is VALID [2022-02-20 18:58:34,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {83484#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {83486#(= |ULTIMATE.start_main_~init__tmp~0#1| 0)} is VALID [2022-02-20 18:58:34,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {83486#(= |ULTIMATE.start_main_~init__tmp~0#1| 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume !!(0 == main_~init__r131~0#1 % 256); {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume !!(0 == main_~init__r211~0#1 % 256); {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume !!(0 == main_~init__r231~0#1 % 256); {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume !!(0 == main_~init__r311~0#1 % 256); {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume !!(0 == main_~init__r321~0#1 % 256); {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume !!(0 == main_~init__r311~0#1 % 256);main_~init__tmp___4~0#1 := 0; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume ~id1~0 != ~id2~0; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume ~id1~0 != ~id3~0; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume ~id2~0 != ~id3~0; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume ~id1~0 >= 0; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume ~id2~0 >= 0; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume ~id3~0 >= 0; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume 0 == ~r1~0 % 256; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume 0 == ~r2~0 % 256; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume 0 == ~r3~0 % 256; {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} is VALID [2022-02-20 18:58:34,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {83487#(<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256)))} assume !(0 == main_~init__r122~0#1 % 256); {83485#false} is VALID [2022-02-20 18:58:34,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {83485#false} assume !(0 == main_~init__r132~0#1 % 256); {83485#false} is VALID [2022-02-20 18:58:34,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {83485#false} assume !(0 == main_~init__r212~0#1 % 256); {83485#false} is VALID [2022-02-20 18:58:34,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {83485#false} assume !(0 == main_~init__r232~0#1 % 256); {83485#false} is VALID [2022-02-20 18:58:34,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {83485#false} assume !(0 == main_~init__r312~0#1 % 256); {83485#false} is VALID [2022-02-20 18:58:34,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {83485#false} assume !(0 == main_~init__r322~0#1 % 256); {83485#false} is VALID [2022-02-20 18:58:34,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {83485#false} assume ~max1~0 == ~id1~0; {83485#false} is VALID [2022-02-20 18:58:34,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {83485#false} assume ~max2~0 == ~id2~0; {83485#false} is VALID [2022-02-20 18:58:34,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {83485#false} assume ~max3~0 == ~id3~0; {83485#false} is VALID [2022-02-20 18:58:34,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {83485#false} assume 0 == ~st1~0; {83485#false} is VALID [2022-02-20 18:58:34,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {83485#false} assume 0 == ~st2~0; {83485#false} is VALID [2022-02-20 18:58:34,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {83485#false} assume 0 == ~st3~0; {83485#false} is VALID [2022-02-20 18:58:34,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {83485#false} assume 0 == ~nl1~0; {83485#false} is VALID [2022-02-20 18:58:34,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {83485#false} assume 0 == ~nl2~0; {83485#false} is VALID [2022-02-20 18:58:34,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {83485#false} assume 0 == ~nl3~0; {83485#false} is VALID [2022-02-20 18:58:34,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {83485#false} assume 0 == ~mode1~0 % 256; {83485#false} is VALID [2022-02-20 18:58:34,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {83485#false} assume 0 == ~mode2~0 % 256; {83485#false} is VALID [2022-02-20 18:58:34,253 INFO L290 TraceCheckUtils]: 46: Hoare triple {83485#false} assume 0 == ~mode3~0 % 256; {83485#false} is VALID [2022-02-20 18:58:34,253 INFO L290 TraceCheckUtils]: 47: Hoare triple {83485#false} assume !(0 == ~newmax1~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {83485#false} assume !(0 == ~newmax2~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {83485#false} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {83485#false} is VALID [2022-02-20 18:58:34,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {83485#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;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {83485#false} is VALID [2022-02-20 18:58:34,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {83485#false} assume !!(0 == ~mode1~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {83485#false} assume ~r1~0 % 256 < 2; {83485#false} is VALID [2022-02-20 18:58:34,254 INFO L290 TraceCheckUtils]: 53: Hoare triple {83485#false} assume !!(0 == ~ep12~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,254 INFO L290 TraceCheckUtils]: 54: Hoare triple {83485#false} assume !!(0 == ~ep13~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,254 INFO L290 TraceCheckUtils]: 55: Hoare triple {83485#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {83485#false} is VALID [2022-02-20 18:58:34,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {83485#false} assume !!(0 == ~mode2~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,254 INFO L290 TraceCheckUtils]: 57: Hoare triple {83485#false} assume ~r2~0 % 256 < 2; {83485#false} is VALID [2022-02-20 18:58:34,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {83485#false} assume !!(0 == ~ep21~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,254 INFO L290 TraceCheckUtils]: 59: Hoare triple {83485#false} assume !!(0 == ~ep23~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {83485#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {83485#false} is VALID [2022-02-20 18:58:34,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {83485#false} assume !!(0 == ~mode3~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {83485#false} assume ~r3~0 % 256 < 2; {83485#false} is VALID [2022-02-20 18:58:34,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {83485#false} assume !!(0 == ~ep31~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {83485#false} assume !!(0 == ~ep32~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {83485#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; {83485#false} is VALID [2022-02-20 18:58:34,255 INFO L290 TraceCheckUtils]: 66: Hoare triple {83485#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {83485#false} is VALID [2022-02-20 18:58:34,255 INFO L290 TraceCheckUtils]: 67: Hoare triple {83485#false} assume ~st1~0 + ~nl1~0 <= 1; {83485#false} is VALID [2022-02-20 18:58:34,255 INFO L290 TraceCheckUtils]: 68: Hoare triple {83485#false} assume ~st2~0 + ~nl2~0 <= 1; {83485#false} is VALID [2022-02-20 18:58:34,255 INFO L290 TraceCheckUtils]: 69: Hoare triple {83485#false} assume ~st3~0 + ~nl3~0 <= 1; {83485#false} is VALID [2022-02-20 18:58:34,255 INFO L290 TraceCheckUtils]: 70: Hoare triple {83485#false} assume !(~r1~0 % 256 >= 2); {83485#false} is VALID [2022-02-20 18:58:34,256 INFO L290 TraceCheckUtils]: 71: Hoare triple {83485#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {83485#false} is VALID [2022-02-20 18:58:34,256 INFO L290 TraceCheckUtils]: 72: Hoare triple {83485#false} assume ~r1~0 % 256 < 2; {83485#false} is VALID [2022-02-20 18:58:34,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {83485#false} assume !(~r1~0 % 256 >= 2); {83485#false} is VALID [2022-02-20 18:58:34,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {83485#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {83485#false} is VALID [2022-02-20 18:58:34,256 INFO L290 TraceCheckUtils]: 75: Hoare triple {83485#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {83485#false} is VALID [2022-02-20 18:58:34,256 INFO L290 TraceCheckUtils]: 76: Hoare triple {83485#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {83485#false} is VALID [2022-02-20 18:58:34,256 INFO L290 TraceCheckUtils]: 77: Hoare triple {83485#false} assume !(0 == ~mode1~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,256 INFO L290 TraceCheckUtils]: 78: Hoare triple {83485#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {83485#false} is VALID [2022-02-20 18:58:34,256 INFO L290 TraceCheckUtils]: 79: Hoare triple {83485#false} assume !!(0 == ~ep21~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,257 INFO L290 TraceCheckUtils]: 80: Hoare triple {83485#false} assume !!(0 == ~ep31~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,257 INFO L290 TraceCheckUtils]: 81: Hoare triple {83485#false} ~newmax1~0 := main_~node1__newmax~1#1; {83485#false} is VALID [2022-02-20 18:58:34,257 INFO L290 TraceCheckUtils]: 82: Hoare triple {83485#false} assume 1 == ~r1~0 % 256; {83485#false} is VALID [2022-02-20 18:58:34,257 INFO L290 TraceCheckUtils]: 83: Hoare triple {83485#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {83485#false} is VALID [2022-02-20 18:58:34,257 INFO L290 TraceCheckUtils]: 84: Hoare triple {83485#false} assume !(0 == ~mode2~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,257 INFO L290 TraceCheckUtils]: 85: Hoare triple {83485#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {83485#false} is VALID [2022-02-20 18:58:34,257 INFO L290 TraceCheckUtils]: 86: Hoare triple {83485#false} assume !!(0 == ~ep12~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,257 INFO L290 TraceCheckUtils]: 87: Hoare triple {83485#false} assume !!(0 == ~ep32~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,258 INFO L290 TraceCheckUtils]: 88: Hoare triple {83485#false} ~newmax2~0 := main_~node2__newmax~1#1; {83485#false} is VALID [2022-02-20 18:58:34,258 INFO L290 TraceCheckUtils]: 89: Hoare triple {83485#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {83485#false} is VALID [2022-02-20 18:58:34,258 INFO L290 TraceCheckUtils]: 90: Hoare triple {83485#false} assume !(0 == ~mode3~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,258 INFO L290 TraceCheckUtils]: 91: Hoare triple {83485#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {83485#false} is VALID [2022-02-20 18:58:34,258 INFO L290 TraceCheckUtils]: 92: Hoare triple {83485#false} assume !!(0 == ~ep13~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,258 INFO L290 TraceCheckUtils]: 93: Hoare triple {83485#false} assume !!(0 == ~ep23~0 % 256); {83485#false} is VALID [2022-02-20 18:58:34,258 INFO L290 TraceCheckUtils]: 94: Hoare triple {83485#false} ~newmax3~0 := main_~node3__newmax~1#1; {83485#false} is VALID [2022-02-20 18:58:34,258 INFO L290 TraceCheckUtils]: 95: Hoare triple {83485#false} assume !(2 == ~r3~0 % 256);~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; {83485#false} is VALID [2022-02-20 18:58:34,258 INFO L290 TraceCheckUtils]: 96: Hoare triple {83485#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {83485#false} is VALID [2022-02-20 18:58:34,259 INFO L290 TraceCheckUtils]: 97: Hoare triple {83485#false} assume ~st1~0 + ~nl1~0 <= 1; {83485#false} is VALID [2022-02-20 18:58:34,259 INFO L290 TraceCheckUtils]: 98: Hoare triple {83485#false} assume ~st2~0 + ~nl2~0 <= 1; {83485#false} is VALID [2022-02-20 18:58:34,259 INFO L290 TraceCheckUtils]: 99: Hoare triple {83485#false} assume ~st3~0 + ~nl3~0 <= 1; {83485#false} is VALID [2022-02-20 18:58:34,259 INFO L290 TraceCheckUtils]: 100: Hoare triple {83485#false} assume !(~r1~0 % 256 >= 2); {83485#false} is VALID [2022-02-20 18:58:34,259 INFO L290 TraceCheckUtils]: 101: Hoare triple {83485#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {83485#false} is VALID [2022-02-20 18:58:34,259 INFO L290 TraceCheckUtils]: 102: Hoare triple {83485#false} assume 0 == main_~assert__arg~1#1 % 256; {83485#false} is VALID [2022-02-20 18:58:34,259 INFO L290 TraceCheckUtils]: 103: Hoare triple {83485#false} assume !false; {83485#false} is VALID [2022-02-20 18:58:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:34,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:34,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336804379] [2022-02-20 18:58:34,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336804379] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:34,260 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:34,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:34,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363424769] [2022-02-20 18:58:34,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:34,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 18:58:34,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:34,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:34,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:34,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:34,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:34,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:34,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:34,317 INFO L87 Difference]: Start difference. First operand 4324 states and 6294 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:38,116 INFO L93 Difference]: Finished difference Result 7561 states and 10991 transitions. [2022-02-20 18:58:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:38,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-02-20 18:58:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 771 transitions. [2022-02-20 18:58:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 771 transitions. [2022-02-20 18:58:38,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 771 transitions. [2022-02-20 18:58:38,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:38,938 INFO L225 Difference]: With dead ends: 7561 [2022-02-20 18:58:38,939 INFO L226 Difference]: Without dead ends: 3311 [2022-02-20 18:58:38,950 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:58:38,951 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 65 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:38,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 1201 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2022-02-20 18:58:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 3311. [2022-02-20 18:58:39,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:39,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3311 states. Second operand has 3311 states, 3309 states have (on average 1.4505893019038985) internal successors, (4800), 3310 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:39,870 INFO L74 IsIncluded]: Start isIncluded. First operand 3311 states. Second operand has 3311 states, 3309 states have (on average 1.4505893019038985) internal successors, (4800), 3310 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:39,872 INFO L87 Difference]: Start difference. First operand 3311 states. Second operand has 3311 states, 3309 states have (on average 1.4505893019038985) internal successors, (4800), 3310 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:40,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:40,216 INFO L93 Difference]: Finished difference Result 3311 states and 4800 transitions. [2022-02-20 18:58:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4800 transitions. [2022-02-20 18:58:40,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:40,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:40,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 3311 states, 3309 states have (on average 1.4505893019038985) internal successors, (4800), 3310 states have internal predecessors, (4800), 0 states have call successors, (0), 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 3311 states. [2022-02-20 18:58:40,224 INFO L87 Difference]: Start difference. First operand has 3311 states, 3309 states have (on average 1.4505893019038985) internal successors, (4800), 3310 states have internal predecessors, (4800), 0 states have call successors, (0), 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 3311 states. [2022-02-20 18:58:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:40,541 INFO L93 Difference]: Finished difference Result 3311 states and 4800 transitions. [2022-02-20 18:58:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4800 transitions. [2022-02-20 18:58:40,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:40,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:40,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:40,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3311 states, 3309 states have (on average 1.4505893019038985) internal successors, (4800), 3310 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4800 transitions. [2022-02-20 18:58:41,037 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4800 transitions. Word has length 104 [2022-02-20 18:58:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:41,037 INFO L470 AbstractCegarLoop]: Abstraction has 3311 states and 4800 transitions. [2022-02-20 18:58:41,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4800 transitions. [2022-02-20 18:58:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 18:58:41,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:41,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:41,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:58:41,041 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:41,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:41,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1671829970, now seen corresponding path program 1 times [2022-02-20 18:58:41,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:41,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084968791] [2022-02-20 18:58:41,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:41,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {104435#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {104435#true} is VALID [2022-02-20 18:58:41,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {104435#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {104435#true} is VALID [2022-02-20 18:58:41,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {104435#true} assume !!(0 == main_~init__r121~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {104435#true} assume !(0 == main_~init__r131~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {104435#true} assume !(0 == ~ep32~0 % 256);main_~init__tmp~0#1 := 1; {104435#true} is VALID [2022-02-20 18:58:41,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {104435#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {104435#true} is VALID [2022-02-20 18:58:41,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {104435#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {104435#true} is VALID [2022-02-20 18:58:41,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {104435#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {104435#true} is VALID [2022-02-20 18:58:41,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {104435#true} assume !!(0 == main_~init__r211~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {104435#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {104435#true} is VALID [2022-02-20 18:58:41,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {104435#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {104435#true} is VALID [2022-02-20 18:58:41,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {104435#true} assume !!(0 == main_~init__r231~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {104435#true} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {104435#true} is VALID [2022-02-20 18:58:41,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {104435#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {104435#true} is VALID [2022-02-20 18:58:41,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {104435#true} assume !!(0 == main_~init__r311~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {104435#true} assume !(0 == main_~init__r321~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {104435#true} assume !!(0 == ~ep21~0 % 256);main_~init__tmp___3~0#1 := 0; {104435#true} is VALID [2022-02-20 18:58:41,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {104435#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {104435#true} is VALID [2022-02-20 18:58:41,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {104435#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {104435#true} is VALID [2022-02-20 18:58:41,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {104435#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {104435#true} is VALID [2022-02-20 18:58:41,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {104435#true} assume ~id1~0 != ~id2~0; {104435#true} is VALID [2022-02-20 18:58:41,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {104435#true} assume ~id1~0 != ~id3~0; {104435#true} is VALID [2022-02-20 18:58:41,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {104435#true} assume ~id2~0 != ~id3~0; {104435#true} is VALID [2022-02-20 18:58:41,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {104435#true} assume ~id1~0 >= 0; {104435#true} is VALID [2022-02-20 18:58:41,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {104435#true} assume ~id2~0 >= 0; {104435#true} is VALID [2022-02-20 18:58:41,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {104435#true} assume ~id3~0 >= 0; {104435#true} is VALID [2022-02-20 18:58:41,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {104435#true} assume 0 == ~r1~0 % 256; {104435#true} is VALID [2022-02-20 18:58:41,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {104435#true} assume 0 == ~r2~0 % 256; {104435#true} is VALID [2022-02-20 18:58:41,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {104435#true} assume 0 == ~r3~0 % 256; {104435#true} is VALID [2022-02-20 18:58:41,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {104435#true} assume !(0 == main_~init__r122~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {104435#true} assume !(0 == main_~init__r132~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {104435#true} assume !(0 == main_~init__r212~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {104435#true} assume !(0 == main_~init__r232~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {104435#true} assume !(0 == main_~init__r312~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {104435#true} assume !(0 == main_~init__r322~0#1 % 256); {104435#true} is VALID [2022-02-20 18:58:41,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {104435#true} assume ~max1~0 == ~id1~0; {104435#true} is VALID [2022-02-20 18:58:41,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {104435#true} assume ~max2~0 == ~id2~0; {104435#true} is VALID [2022-02-20 18:58:41,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {104435#true} assume ~max3~0 == ~id3~0; {104435#true} is VALID [2022-02-20 18:58:41,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {104435#true} assume 0 == ~st1~0; {104435#true} is VALID [2022-02-20 18:58:41,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {104435#true} assume 0 == ~st2~0; {104435#true} is VALID [2022-02-20 18:58:41,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {104435#true} assume 0 == ~st3~0; {104435#true} is VALID [2022-02-20 18:58:41,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {104435#true} assume 0 == ~nl1~0; {104435#true} is VALID [2022-02-20 18:58:41,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {104435#true} assume 0 == ~nl2~0; {104435#true} is VALID [2022-02-20 18:58:41,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {104435#true} assume 0 == ~nl3~0; {104435#true} is VALID [2022-02-20 18:58:41,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {104435#true} assume 0 == ~mode1~0 % 256; {104435#true} is VALID [2022-02-20 18:58:41,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {104435#true} assume 0 == ~mode2~0 % 256; {104435#true} is VALID [2022-02-20 18:58:41,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {104435#true} assume 0 == ~mode3~0 % 256; {104435#true} is VALID [2022-02-20 18:58:41,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {104435#true} assume !(0 == ~newmax1~0 % 256); {104435#true} is VALID [2022-02-20 18:58:41,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {104435#true} assume !(0 == ~newmax2~0 % 256); {104435#true} is VALID [2022-02-20 18:58:41,098 INFO L290 TraceCheckUtils]: 49: Hoare triple {104435#true} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,098 INFO L290 TraceCheckUtils]: 50: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume !!(0 == ~mode1~0 % 256); {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume ~r1~0 % 256 < 2; {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume !!(0 == ~ep12~0 % 256); {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume !!(0 == ~ep13~0 % 256); {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume !!(0 == ~mode2~0 % 256); {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume ~r2~0 % 256 < 2; {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,101 INFO L290 TraceCheckUtils]: 58: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume !!(0 == ~ep21~0 % 256); {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume !!(0 == ~ep23~0 % 256); {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume !!(0 == ~mode3~0 % 256); {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume ~r3~0 % 256 < 2; {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume !!(0 == ~ep31~0 % 256); {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,104 INFO L290 TraceCheckUtils]: 64: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume !(0 == ~ep32~0 % 256); {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} is VALID [2022-02-20 18:58:41,104 INFO L290 TraceCheckUtils]: 65: Hoare triple {104437#(not (= (+ (* (div ~newmax3~0 256) (- 256)) ~newmax3~0) 0))} assume !!(0 == ~newmax3~0 % 256); {104436#false} is VALID [2022-02-20 18:58:41,104 INFO L290 TraceCheckUtils]: 66: Hoare triple {104436#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; {104436#false} is VALID [2022-02-20 18:58:41,104 INFO L290 TraceCheckUtils]: 67: Hoare triple {104436#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {104436#false} is VALID [2022-02-20 18:58:41,105 INFO L290 TraceCheckUtils]: 68: Hoare triple {104436#false} assume ~st1~0 + ~nl1~0 <= 1; {104436#false} is VALID [2022-02-20 18:58:41,105 INFO L290 TraceCheckUtils]: 69: Hoare triple {104436#false} assume ~st2~0 + ~nl2~0 <= 1; {104436#false} is VALID [2022-02-20 18:58:41,105 INFO L290 TraceCheckUtils]: 70: Hoare triple {104436#false} assume ~st3~0 + ~nl3~0 <= 1; {104436#false} is VALID [2022-02-20 18:58:41,105 INFO L290 TraceCheckUtils]: 71: Hoare triple {104436#false} assume !(~r1~0 % 256 >= 2); {104436#false} is VALID [2022-02-20 18:58:41,105 INFO L290 TraceCheckUtils]: 72: Hoare triple {104436#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {104436#false} is VALID [2022-02-20 18:58:41,105 INFO L290 TraceCheckUtils]: 73: Hoare triple {104436#false} assume ~r1~0 % 256 < 2; {104436#false} is VALID [2022-02-20 18:58:41,105 INFO L290 TraceCheckUtils]: 74: Hoare triple {104436#false} assume !(~r1~0 % 256 >= 2); {104436#false} is VALID [2022-02-20 18:58:41,106 INFO L290 TraceCheckUtils]: 75: Hoare triple {104436#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {104436#false} is VALID [2022-02-20 18:58:41,106 INFO L290 TraceCheckUtils]: 76: Hoare triple {104436#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {104436#false} is VALID [2022-02-20 18:58:41,106 INFO L290 TraceCheckUtils]: 77: Hoare triple {104436#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {104436#false} is VALID [2022-02-20 18:58:41,106 INFO L290 TraceCheckUtils]: 78: Hoare triple {104436#false} assume !(0 == ~mode1~0 % 256); {104436#false} is VALID [2022-02-20 18:58:41,106 INFO L290 TraceCheckUtils]: 79: Hoare triple {104436#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {104436#false} is VALID [2022-02-20 18:58:41,106 INFO L290 TraceCheckUtils]: 80: Hoare triple {104436#false} assume !!(0 == ~ep21~0 % 256); {104436#false} is VALID [2022-02-20 18:58:41,106 INFO L290 TraceCheckUtils]: 81: Hoare triple {104436#false} assume !!(0 == ~ep31~0 % 256); {104436#false} is VALID [2022-02-20 18:58:41,107 INFO L290 TraceCheckUtils]: 82: Hoare triple {104436#false} ~newmax1~0 := main_~node1__newmax~1#1; {104436#false} is VALID [2022-02-20 18:58:41,107 INFO L290 TraceCheckUtils]: 83: Hoare triple {104436#false} assume 1 == ~r1~0 % 256; {104436#false} is VALID [2022-02-20 18:58:41,107 INFO L290 TraceCheckUtils]: 84: Hoare triple {104436#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {104436#false} is VALID [2022-02-20 18:58:41,107 INFO L290 TraceCheckUtils]: 85: Hoare triple {104436#false} assume !(0 == ~mode2~0 % 256); {104436#false} is VALID [2022-02-20 18:58:41,107 INFO L290 TraceCheckUtils]: 86: Hoare triple {104436#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {104436#false} is VALID [2022-02-20 18:58:41,107 INFO L290 TraceCheckUtils]: 87: Hoare triple {104436#false} assume !!(0 == ~ep12~0 % 256); {104436#false} is VALID [2022-02-20 18:58:41,107 INFO L290 TraceCheckUtils]: 88: Hoare triple {104436#false} assume !(0 == ~ep32~0 % 256);~m2~0 := ~p32_old~0;~p32_old~0 := ~nomsg~0; {104436#false} is VALID [2022-02-20 18:58:41,108 INFO L290 TraceCheckUtils]: 89: Hoare triple {104436#false} assume ~m2~0 > ~max2~0;~max2~0 := ~m2~0;main_~node2__newmax~1#1 := 1; {104436#false} is VALID [2022-02-20 18:58:41,108 INFO L290 TraceCheckUtils]: 90: Hoare triple {104436#false} ~newmax2~0 := main_~node2__newmax~1#1; {104436#false} is VALID [2022-02-20 18:58:41,108 INFO L290 TraceCheckUtils]: 91: Hoare triple {104436#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {104436#false} is VALID [2022-02-20 18:58:41,108 INFO L290 TraceCheckUtils]: 92: Hoare triple {104436#false} assume !(0 == ~mode3~0 % 256); {104436#false} is VALID [2022-02-20 18:58:41,108 INFO L290 TraceCheckUtils]: 93: Hoare triple {104436#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {104436#false} is VALID [2022-02-20 18:58:41,108 INFO L290 TraceCheckUtils]: 94: Hoare triple {104436#false} assume !!(0 == ~ep13~0 % 256); {104436#false} is VALID [2022-02-20 18:58:41,108 INFO L290 TraceCheckUtils]: 95: Hoare triple {104436#false} assume !!(0 == ~ep23~0 % 256); {104436#false} is VALID [2022-02-20 18:58:41,108 INFO L290 TraceCheckUtils]: 96: Hoare triple {104436#false} ~newmax3~0 := main_~node3__newmax~1#1; {104436#false} is VALID [2022-02-20 18:58:41,109 INFO L290 TraceCheckUtils]: 97: Hoare triple {104436#false} assume !(2 == ~r3~0 % 256);~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; {104436#false} is VALID [2022-02-20 18:58:41,109 INFO L290 TraceCheckUtils]: 98: Hoare triple {104436#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {104436#false} is VALID [2022-02-20 18:58:41,109 INFO L290 TraceCheckUtils]: 99: Hoare triple {104436#false} assume ~st1~0 + ~nl1~0 <= 1; {104436#false} is VALID [2022-02-20 18:58:41,109 INFO L290 TraceCheckUtils]: 100: Hoare triple {104436#false} assume ~st2~0 + ~nl2~0 <= 1; {104436#false} is VALID [2022-02-20 18:58:41,109 INFO L290 TraceCheckUtils]: 101: Hoare triple {104436#false} assume ~st3~0 + ~nl3~0 <= 1; {104436#false} is VALID [2022-02-20 18:58:41,109 INFO L290 TraceCheckUtils]: 102: Hoare triple {104436#false} assume !(~r1~0 % 256 >= 2); {104436#false} is VALID [2022-02-20 18:58:41,109 INFO L290 TraceCheckUtils]: 103: Hoare triple {104436#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {104436#false} is VALID [2022-02-20 18:58:41,110 INFO L290 TraceCheckUtils]: 104: Hoare triple {104436#false} assume 0 == main_~assert__arg~1#1 % 256; {104436#false} is VALID [2022-02-20 18:58:41,110 INFO L290 TraceCheckUtils]: 105: Hoare triple {104436#false} assume !false; {104436#false} is VALID [2022-02-20 18:58:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:41,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:41,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084968791] [2022-02-20 18:58:41,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084968791] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:41,111 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:41,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:41,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298552962] [2022-02-20 18:58:41,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 18:58:41,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:41,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:41,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:41,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:41,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:41,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:41,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:41,174 INFO L87 Difference]: Start difference. First operand 3311 states and 4800 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:44,589 INFO L93 Difference]: Finished difference Result 6697 states and 10124 transitions. [2022-02-20 18:58:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:44,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 18:58:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 787 transitions. [2022-02-20 18:58:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 787 transitions. [2022-02-20 18:58:44,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 787 transitions. [2022-02-20 18:58:44,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 787 edges. 787 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:45,795 INFO L225 Difference]: With dead ends: 6697 [2022-02-20 18:58:45,795 INFO L226 Difference]: Without dead ends: 4666 [2022-02-20 18:58:45,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:45,797 INFO L933 BasicCegarLoop]: 520 mSDtfsCounter, 268 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:45,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 748 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2022-02-20 18:58:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4524. [2022-02-20 18:58:47,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:47,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4666 states. Second operand has 4524 states, 4522 states have (on average 1.489827509951349) internal successors, (6737), 4523 states have internal predecessors, (6737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:47,119 INFO L74 IsIncluded]: Start isIncluded. First operand 4666 states. Second operand has 4524 states, 4522 states have (on average 1.489827509951349) internal successors, (6737), 4523 states have internal predecessors, (6737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:47,122 INFO L87 Difference]: Start difference. First operand 4666 states. Second operand has 4524 states, 4522 states have (on average 1.489827509951349) internal successors, (6737), 4523 states have internal predecessors, (6737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:47,704 INFO L93 Difference]: Finished difference Result 4666 states and 6978 transitions. [2022-02-20 18:58:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 6978 transitions. [2022-02-20 18:58:47,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:47,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:47,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 4524 states, 4522 states have (on average 1.489827509951349) internal successors, (6737), 4523 states have internal predecessors, (6737), 0 states have call successors, (0), 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 4666 states. [2022-02-20 18:58:47,716 INFO L87 Difference]: Start difference. First operand has 4524 states, 4522 states have (on average 1.489827509951349) internal successors, (6737), 4523 states have internal predecessors, (6737), 0 states have call successors, (0), 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 4666 states. [2022-02-20 18:58:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:48,294 INFO L93 Difference]: Finished difference Result 4666 states and 6978 transitions. [2022-02-20 18:58:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 6978 transitions. [2022-02-20 18:58:48,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:48,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:48,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:48,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4522 states have (on average 1.489827509951349) internal successors, (6737), 4523 states have internal predecessors, (6737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 6737 transitions. [2022-02-20 18:58:49,087 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 6737 transitions. Word has length 106 [2022-02-20 18:58:49,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:49,088 INFO L470 AbstractCegarLoop]: Abstraction has 4524 states and 6737 transitions. [2022-02-20 18:58:49,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 6737 transitions. [2022-02-20 18:58:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-20 18:58:49,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:49,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:49,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:58:49,090 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:49,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:49,090 INFO L85 PathProgramCache]: Analyzing trace with hash -819031446, now seen corresponding path program 1 times [2022-02-20 18:58:49,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:49,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307339113] [2022-02-20 18:58:49,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:49,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:49,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {128854#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {128854#true} is VALID [2022-02-20 18:58:49,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {128854#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {128856#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:58:49,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {128856#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {128856#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:58:49,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {128856#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {128856#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:58:49,158 INFO L290 TraceCheckUtils]: 4: Hoare triple {128856#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {128857#(<= (+ (* 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); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r211~0#1 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {128857#(<= (+ (* 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); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r231~0#1 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {128857#(<= (+ (* 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); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r311~0#1 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {128857#(<= (+ (* 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); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r321~0#1 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r311~0#1 % 256);main_~init__tmp___4~0#1 := 0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {128857#(<= (+ (* 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); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id2~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id3~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 != ~id3~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 >= 0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 >= 0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id3~0 >= 0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r1~0 % 256; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r2~0 % 256; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r3~0 % 256; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r122~0#1 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r132~0#1 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r212~0#1 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r232~0#1 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r312~0#1 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r322~0#1 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max1~0 == ~id1~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max2~0 == ~id2~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max3~0 == ~id3~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st1~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st2~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st3~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl1~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl2~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl3~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode1~0 % 256; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode2~0 % 256; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode3~0 % 256; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,169 INFO L290 TraceCheckUtils]: 45: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == ~newmax1~0 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == ~newmax2~0 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,170 INFO L290 TraceCheckUtils]: 47: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,170 INFO L290 TraceCheckUtils]: 48: Hoare triple {128857#(<= (+ (* 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;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,170 INFO L290 TraceCheckUtils]: 49: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~mode1~0 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,170 INFO L290 TraceCheckUtils]: 50: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~r1~0 % 256 < 2; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,171 INFO L290 TraceCheckUtils]: 51: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == ~ep12~0 % 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,171 INFO L290 TraceCheckUtils]: 52: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == ~newmax1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,171 INFO L290 TraceCheckUtils]: 53: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max1~0 != ~nomsg~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,171 INFO L290 TraceCheckUtils]: 54: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~p12_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~max1~0; {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,172 INFO L290 TraceCheckUtils]: 55: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} ~p12_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:58:49,172 INFO L290 TraceCheckUtils]: 56: Hoare triple {128857#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~ep13~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {128855#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {128855#false} is VALID [2022-02-20 18:58:49,172 INFO L290 TraceCheckUtils]: 58: Hoare triple {128855#false} assume !!(0 == ~mode2~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,173 INFO L290 TraceCheckUtils]: 59: Hoare triple {128855#false} assume ~r2~0 % 256 < 2; {128855#false} is VALID [2022-02-20 18:58:49,173 INFO L290 TraceCheckUtils]: 60: Hoare triple {128855#false} assume !!(0 == ~ep21~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,173 INFO L290 TraceCheckUtils]: 61: Hoare triple {128855#false} assume !!(0 == ~ep23~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,173 INFO L290 TraceCheckUtils]: 62: Hoare triple {128855#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {128855#false} is VALID [2022-02-20 18:58:49,173 INFO L290 TraceCheckUtils]: 63: Hoare triple {128855#false} assume !!(0 == ~mode3~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,173 INFO L290 TraceCheckUtils]: 64: Hoare triple {128855#false} assume ~r3~0 % 256 < 2; {128855#false} is VALID [2022-02-20 18:58:49,173 INFO L290 TraceCheckUtils]: 65: Hoare triple {128855#false} assume !!(0 == ~ep31~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {128855#false} assume !!(0 == ~ep32~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,173 INFO L290 TraceCheckUtils]: 67: Hoare triple {128855#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; {128855#false} is VALID [2022-02-20 18:58:49,174 INFO L290 TraceCheckUtils]: 68: Hoare triple {128855#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {128855#false} is VALID [2022-02-20 18:58:49,174 INFO L290 TraceCheckUtils]: 69: Hoare triple {128855#false} assume ~st1~0 + ~nl1~0 <= 1; {128855#false} is VALID [2022-02-20 18:58:49,174 INFO L290 TraceCheckUtils]: 70: Hoare triple {128855#false} assume ~st2~0 + ~nl2~0 <= 1; {128855#false} is VALID [2022-02-20 18:58:49,174 INFO L290 TraceCheckUtils]: 71: Hoare triple {128855#false} assume ~st3~0 + ~nl3~0 <= 1; {128855#false} is VALID [2022-02-20 18:58:49,174 INFO L290 TraceCheckUtils]: 72: Hoare triple {128855#false} assume !(~r1~0 % 256 >= 2); {128855#false} is VALID [2022-02-20 18:58:49,174 INFO L290 TraceCheckUtils]: 73: Hoare triple {128855#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {128855#false} is VALID [2022-02-20 18:58:49,174 INFO L290 TraceCheckUtils]: 74: Hoare triple {128855#false} assume ~r1~0 % 256 < 2; {128855#false} is VALID [2022-02-20 18:58:49,174 INFO L290 TraceCheckUtils]: 75: Hoare triple {128855#false} assume !(~r1~0 % 256 >= 2); {128855#false} is VALID [2022-02-20 18:58:49,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {128855#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {128855#false} is VALID [2022-02-20 18:58:49,175 INFO L290 TraceCheckUtils]: 77: Hoare triple {128855#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {128855#false} is VALID [2022-02-20 18:58:49,175 INFO L290 TraceCheckUtils]: 78: Hoare triple {128855#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {128855#false} is VALID [2022-02-20 18:58:49,175 INFO L290 TraceCheckUtils]: 79: Hoare triple {128855#false} assume !(0 == ~mode1~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,175 INFO L290 TraceCheckUtils]: 80: Hoare triple {128855#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {128855#false} is VALID [2022-02-20 18:58:49,175 INFO L290 TraceCheckUtils]: 81: Hoare triple {128855#false} assume !!(0 == ~ep21~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,175 INFO L290 TraceCheckUtils]: 82: Hoare triple {128855#false} assume !!(0 == ~ep31~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,175 INFO L290 TraceCheckUtils]: 83: Hoare triple {128855#false} ~newmax1~0 := main_~node1__newmax~1#1; {128855#false} is VALID [2022-02-20 18:58:49,175 INFO L290 TraceCheckUtils]: 84: Hoare triple {128855#false} assume 1 == ~r1~0 % 256; {128855#false} is VALID [2022-02-20 18:58:49,175 INFO L290 TraceCheckUtils]: 85: Hoare triple {128855#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {128855#false} is VALID [2022-02-20 18:58:49,176 INFO L290 TraceCheckUtils]: 86: Hoare triple {128855#false} assume !(0 == ~mode2~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,176 INFO L290 TraceCheckUtils]: 87: Hoare triple {128855#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {128855#false} is VALID [2022-02-20 18:58:49,176 INFO L290 TraceCheckUtils]: 88: Hoare triple {128855#false} assume !(0 == ~ep12~0 % 256);~m2~0 := ~p12_old~0;~p12_old~0 := ~nomsg~0; {128855#false} is VALID [2022-02-20 18:58:49,176 INFO L290 TraceCheckUtils]: 89: Hoare triple {128855#false} assume !(~m2~0 > ~max2~0); {128855#false} is VALID [2022-02-20 18:58:49,176 INFO L290 TraceCheckUtils]: 90: Hoare triple {128855#false} assume !!(0 == ~ep32~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,176 INFO L290 TraceCheckUtils]: 91: Hoare triple {128855#false} ~newmax2~0 := main_~node2__newmax~1#1; {128855#false} is VALID [2022-02-20 18:58:49,176 INFO L290 TraceCheckUtils]: 92: Hoare triple {128855#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {128855#false} is VALID [2022-02-20 18:58:49,176 INFO L290 TraceCheckUtils]: 93: Hoare triple {128855#false} assume !(0 == ~mode3~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,176 INFO L290 TraceCheckUtils]: 94: Hoare triple {128855#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {128855#false} is VALID [2022-02-20 18:58:49,177 INFO L290 TraceCheckUtils]: 95: Hoare triple {128855#false} assume !!(0 == ~ep13~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,177 INFO L290 TraceCheckUtils]: 96: Hoare triple {128855#false} assume !!(0 == ~ep23~0 % 256); {128855#false} is VALID [2022-02-20 18:58:49,177 INFO L290 TraceCheckUtils]: 97: Hoare triple {128855#false} ~newmax3~0 := main_~node3__newmax~1#1; {128855#false} is VALID [2022-02-20 18:58:49,177 INFO L290 TraceCheckUtils]: 98: Hoare triple {128855#false} assume !(2 == ~r3~0 % 256);~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; {128855#false} is VALID [2022-02-20 18:58:49,177 INFO L290 TraceCheckUtils]: 99: Hoare triple {128855#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {128855#false} is VALID [2022-02-20 18:58:49,177 INFO L290 TraceCheckUtils]: 100: Hoare triple {128855#false} assume ~st1~0 + ~nl1~0 <= 1; {128855#false} is VALID [2022-02-20 18:58:49,177 INFO L290 TraceCheckUtils]: 101: Hoare triple {128855#false} assume ~st2~0 + ~nl2~0 <= 1; {128855#false} is VALID [2022-02-20 18:58:49,177 INFO L290 TraceCheckUtils]: 102: Hoare triple {128855#false} assume ~st3~0 + ~nl3~0 <= 1; {128855#false} is VALID [2022-02-20 18:58:49,178 INFO L290 TraceCheckUtils]: 103: Hoare triple {128855#false} assume !(~r1~0 % 256 >= 2); {128855#false} is VALID [2022-02-20 18:58:49,178 INFO L290 TraceCheckUtils]: 104: Hoare triple {128855#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {128855#false} is VALID [2022-02-20 18:58:49,178 INFO L290 TraceCheckUtils]: 105: Hoare triple {128855#false} assume 0 == main_~assert__arg~1#1 % 256; {128855#false} is VALID [2022-02-20 18:58:49,178 INFO L290 TraceCheckUtils]: 106: Hoare triple {128855#false} assume !false; {128855#false} is VALID [2022-02-20 18:58:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:49,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:49,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307339113] [2022-02-20 18:58:49,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307339113] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:49,179 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:49,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:49,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794381400] [2022-02-20 18:58:49,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-02-20 18:58:49,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:49,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:49,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:49,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:49,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:49,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:49,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:49,245 INFO L87 Difference]: Start difference. First operand 4524 states and 6737 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:57,665 INFO L93 Difference]: Finished difference Result 11670 states and 17386 transitions. [2022-02-20 18:58:57,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:57,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-02-20 18:58:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1109 transitions. [2022-02-20 18:58:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1109 transitions. [2022-02-20 18:58:57,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1109 transitions. [2022-02-20 18:58:58,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1109 edges. 1109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:59:00,269 INFO L225 Difference]: With dead ends: 11670 [2022-02-20 18:59:00,269 INFO L226 Difference]: Without dead ends: 7278 [2022-02-20 18:59:00,272 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:59:00,273 INFO L933 BasicCegarLoop]: 637 mSDtfsCounter, 762 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:59:00,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [762 Valid, 977 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:59:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7278 states. [2022-02-20 18:59:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7278 to 7263. [2022-02-20 18:59:02,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:59:02,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7278 states. Second operand has 7263 states, 7261 states have (on average 1.4730753339760363) internal successors, (10696), 7262 states have internal predecessors, (10696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:03,006 INFO L74 IsIncluded]: Start isIncluded. First operand 7278 states. Second operand has 7263 states, 7261 states have (on average 1.4730753339760363) internal successors, (10696), 7262 states have internal predecessors, (10696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:03,012 INFO L87 Difference]: Start difference. First operand 7278 states. Second operand has 7263 states, 7261 states have (on average 1.4730753339760363) internal successors, (10696), 7262 states have internal predecessors, (10696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:04,426 INFO L93 Difference]: Finished difference Result 7278 states and 10711 transitions. [2022-02-20 18:59:04,427 INFO L276 IsEmpty]: Start isEmpty. Operand 7278 states and 10711 transitions. [2022-02-20 18:59:04,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:04,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:04,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 7263 states, 7261 states have (on average 1.4730753339760363) internal successors, (10696), 7262 states have internal predecessors, (10696), 0 states have call successors, (0), 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 7278 states. [2022-02-20 18:59:04,444 INFO L87 Difference]: Start difference. First operand has 7263 states, 7261 states have (on average 1.4730753339760363) internal successors, (10696), 7262 states have internal predecessors, (10696), 0 states have call successors, (0), 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 7278 states. [2022-02-20 18:59:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:06,014 INFO L93 Difference]: Finished difference Result 7278 states and 10711 transitions. [2022-02-20 18:59:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7278 states and 10711 transitions. [2022-02-20 18:59:06,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:59:06,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:59:06,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:59:06,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:59:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7263 states, 7261 states have (on average 1.4730753339760363) internal successors, (10696), 7262 states have internal predecessors, (10696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7263 states to 7263 states and 10696 transitions. [2022-02-20 18:59:08,092 INFO L78 Accepts]: Start accepts. Automaton has 7263 states and 10696 transitions. Word has length 107 [2022-02-20 18:59:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:59:08,093 INFO L470 AbstractCegarLoop]: Abstraction has 7263 states and 10696 transitions. [2022-02-20 18:59:08,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 7263 states and 10696 transitions. [2022-02-20 18:59:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-20 18:59:08,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:59:08,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:59:08,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:59:08,095 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:59:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:59:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1396534881, now seen corresponding path program 1 times [2022-02-20 18:59:08,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:59:08,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616827174] [2022-02-20 18:59:08,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:59:08,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:59:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:59:08,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {168826#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1248~0 := 0;~__return_1394~0 := 0;~__return_1872~0 := 0;~__return_1528~0 := 0;~__return_1653~0 := 0; {168826#true} is VALID [2022-02-20 18:59:08,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {168826#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~check__tmp~3#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~3#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~3#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3__newmax~2#1, main_~node2__newmax~2#1, main_~node1__newmax~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {168826#true} is VALID [2022-02-20 18:59:08,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {168826#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {168826#true} is VALID [2022-02-20 18:59:08,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {168826#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {168826#true} is VALID [2022-02-20 18:59:08,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {168826#true} assume !!(0 == main_~init__r131~0#1 % 256); {168826#true} is VALID [2022-02-20 18:59:08,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {168826#true} assume !(0 == main_~init__r121~0#1 % 256); {168826#true} is VALID [2022-02-20 18:59:08,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {168826#true} assume !!(0 == ~ep23~0 % 256);main_~init__tmp___0~0#1 := 0; {168828#(= |ULTIMATE.start_main_~init__tmp___0~0#1| 0)} is VALID [2022-02-20 18:59:08,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {168828#(= |ULTIMATE.start_main_~init__tmp___0~0#1| 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume !!(0 == main_~init__r211~0#1 % 256); {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume !!(0 == main_~init__r231~0#1 % 256); {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume !!(0 == main_~init__r311~0#1 % 256); {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume !!(0 == main_~init__r321~0#1 % 256); {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume !!(0 == main_~init__r311~0#1 % 256);main_~init__tmp___4~0#1 := 0; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume ~id1~0 != ~id2~0; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume ~id1~0 != ~id3~0; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume ~id2~0 != ~id3~0; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume ~id1~0 >= 0; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume ~id2~0 >= 0; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume ~id3~0 >= 0; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume 0 == ~r1~0 % 256; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume 0 == ~r2~0 % 256; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume 0 == ~r3~0 % 256; {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume !(0 == main_~init__r122~0#1 % 256); {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} is VALID [2022-02-20 18:59:08,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {168829#(<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256)))} assume !(0 == main_~init__r132~0#1 % 256); {168827#false} is VALID [2022-02-20 18:59:08,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {168827#false} assume !(0 == main_~init__r212~0#1 % 256); {168827#false} is VALID [2022-02-20 18:59:08,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {168827#false} assume !(0 == main_~init__r232~0#1 % 256); {168827#false} is VALID [2022-02-20 18:59:08,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {168827#false} assume !(0 == main_~init__r312~0#1 % 256); {168827#false} is VALID [2022-02-20 18:59:08,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {168827#false} assume !(0 == main_~init__r322~0#1 % 256); {168827#false} is VALID [2022-02-20 18:59:08,221 INFO L290 TraceCheckUtils]: 35: Hoare triple {168827#false} assume ~max1~0 == ~id1~0; {168827#false} is VALID [2022-02-20 18:59:08,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {168827#false} assume ~max2~0 == ~id2~0; {168827#false} is VALID [2022-02-20 18:59:08,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {168827#false} assume ~max3~0 == ~id3~0; {168827#false} is VALID [2022-02-20 18:59:08,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {168827#false} assume 0 == ~st1~0; {168827#false} is VALID [2022-02-20 18:59:08,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {168827#false} assume 0 == ~st2~0; {168827#false} is VALID [2022-02-20 18:59:08,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {168827#false} assume 0 == ~st3~0; {168827#false} is VALID [2022-02-20 18:59:08,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {168827#false} assume 0 == ~nl1~0; {168827#false} is VALID [2022-02-20 18:59:08,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {168827#false} assume 0 == ~nl2~0; {168827#false} is VALID [2022-02-20 18:59:08,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {168827#false} assume 0 == ~nl3~0; {168827#false} is VALID [2022-02-20 18:59:08,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {168827#false} assume 0 == ~mode1~0 % 256; {168827#false} is VALID [2022-02-20 18:59:08,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {168827#false} assume 0 == ~mode2~0 % 256; {168827#false} is VALID [2022-02-20 18:59:08,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {168827#false} assume 0 == ~mode3~0 % 256; {168827#false} is VALID [2022-02-20 18:59:08,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {168827#false} assume !(0 == ~newmax1~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {168827#false} assume !(0 == ~newmax2~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {168827#false} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1248~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1248~0; {168827#false} is VALID [2022-02-20 18:59:08,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {168827#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;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {168827#false} is VALID [2022-02-20 18:59:08,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {168827#false} assume !!(0 == ~mode1~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {168827#false} assume ~r1~0 % 256 < 2; {168827#false} is VALID [2022-02-20 18:59:08,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {168827#false} assume !(0 == ~ep12~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {168827#false} assume !(0 == ~newmax1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {168827#false} is VALID [2022-02-20 18:59:08,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {168827#false} assume ~max1~0 != ~nomsg~0; {168827#false} is VALID [2022-02-20 18:59:08,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {168827#false} assume ~p12_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~max1~0; {168827#false} is VALID [2022-02-20 18:59:08,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {168827#false} ~p12_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {168827#false} is VALID [2022-02-20 18:59:08,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {168827#false} assume !!(0 == ~ep13~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,223 INFO L290 TraceCheckUtils]: 59: Hoare triple {168827#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {168827#false} is VALID [2022-02-20 18:59:08,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {168827#false} assume !!(0 == ~mode2~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {168827#false} assume ~r2~0 % 256 < 2; {168827#false} is VALID [2022-02-20 18:59:08,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {168827#false} assume !!(0 == ~ep21~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,224 INFO L290 TraceCheckUtils]: 63: Hoare triple {168827#false} assume !!(0 == ~ep23~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,224 INFO L290 TraceCheckUtils]: 64: Hoare triple {168827#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {168827#false} is VALID [2022-02-20 18:59:08,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {168827#false} assume !!(0 == ~mode3~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {168827#false} assume ~r3~0 % 256 < 2; {168827#false} is VALID [2022-02-20 18:59:08,224 INFO L290 TraceCheckUtils]: 67: Hoare triple {168827#false} assume !!(0 == ~ep31~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,224 INFO L290 TraceCheckUtils]: 68: Hoare triple {168827#false} assume !!(0 == ~ep32~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {168827#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; {168827#false} is VALID [2022-02-20 18:59:08,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {168827#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {168827#false} is VALID [2022-02-20 18:59:08,225 INFO L290 TraceCheckUtils]: 71: Hoare triple {168827#false} assume ~st1~0 + ~nl1~0 <= 1; {168827#false} is VALID [2022-02-20 18:59:08,225 INFO L290 TraceCheckUtils]: 72: Hoare triple {168827#false} assume ~st2~0 + ~nl2~0 <= 1; {168827#false} is VALID [2022-02-20 18:59:08,225 INFO L290 TraceCheckUtils]: 73: Hoare triple {168827#false} assume ~st3~0 + ~nl3~0 <= 1; {168827#false} is VALID [2022-02-20 18:59:08,225 INFO L290 TraceCheckUtils]: 74: Hoare triple {168827#false} assume !(~r1~0 % 256 >= 2); {168827#false} is VALID [2022-02-20 18:59:08,225 INFO L290 TraceCheckUtils]: 75: Hoare triple {168827#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {168827#false} is VALID [2022-02-20 18:59:08,225 INFO L290 TraceCheckUtils]: 76: Hoare triple {168827#false} assume ~r1~0 % 256 < 2; {168827#false} is VALID [2022-02-20 18:59:08,226 INFO L290 TraceCheckUtils]: 77: Hoare triple {168827#false} assume !(~r1~0 % 256 >= 2); {168827#false} is VALID [2022-02-20 18:59:08,226 INFO L290 TraceCheckUtils]: 78: Hoare triple {168827#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {168827#false} is VALID [2022-02-20 18:59:08,226 INFO L290 TraceCheckUtils]: 79: Hoare triple {168827#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1394~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1394~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; {168827#false} is VALID [2022-02-20 18:59:08,226 INFO L290 TraceCheckUtils]: 80: Hoare triple {168827#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {168827#false} is VALID [2022-02-20 18:59:08,226 INFO L290 TraceCheckUtils]: 81: Hoare triple {168827#false} assume !(0 == ~mode1~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,226 INFO L290 TraceCheckUtils]: 82: Hoare triple {168827#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {168827#false} is VALID [2022-02-20 18:59:08,226 INFO L290 TraceCheckUtils]: 83: Hoare triple {168827#false} assume !!(0 == ~ep21~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,226 INFO L290 TraceCheckUtils]: 84: Hoare triple {168827#false} assume !!(0 == ~ep31~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,226 INFO L290 TraceCheckUtils]: 85: Hoare triple {168827#false} ~newmax1~0 := main_~node1__newmax~1#1; {168827#false} is VALID [2022-02-20 18:59:08,227 INFO L290 TraceCheckUtils]: 86: Hoare triple {168827#false} assume 1 == ~r1~0 % 256; {168827#false} is VALID [2022-02-20 18:59:08,227 INFO L290 TraceCheckUtils]: 87: Hoare triple {168827#false} assume ~max1~0 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {168827#false} is VALID [2022-02-20 18:59:08,227 INFO L290 TraceCheckUtils]: 88: Hoare triple {168827#false} assume !(0 == ~mode2~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,227 INFO L290 TraceCheckUtils]: 89: Hoare triple {168827#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {168827#false} is VALID [2022-02-20 18:59:08,227 INFO L290 TraceCheckUtils]: 90: Hoare triple {168827#false} assume !(0 == ~ep12~0 % 256);~m2~0 := ~p12_old~0;~p12_old~0 := ~nomsg~0; {168827#false} is VALID [2022-02-20 18:59:08,227 INFO L290 TraceCheckUtils]: 91: Hoare triple {168827#false} assume !(~m2~0 > ~max2~0); {168827#false} is VALID [2022-02-20 18:59:08,227 INFO L290 TraceCheckUtils]: 92: Hoare triple {168827#false} assume !!(0 == ~ep32~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,227 INFO L290 TraceCheckUtils]: 93: Hoare triple {168827#false} ~newmax2~0 := main_~node2__newmax~1#1; {168827#false} is VALID [2022-02-20 18:59:08,227 INFO L290 TraceCheckUtils]: 94: Hoare triple {168827#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {168827#false} is VALID [2022-02-20 18:59:08,228 INFO L290 TraceCheckUtils]: 95: Hoare triple {168827#false} assume !(0 == ~mode3~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,228 INFO L290 TraceCheckUtils]: 96: Hoare triple {168827#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {168827#false} is VALID [2022-02-20 18:59:08,228 INFO L290 TraceCheckUtils]: 97: Hoare triple {168827#false} assume !!(0 == ~ep13~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,228 INFO L290 TraceCheckUtils]: 98: Hoare triple {168827#false} assume !!(0 == ~ep23~0 % 256); {168827#false} is VALID [2022-02-20 18:59:08,228 INFO L290 TraceCheckUtils]: 99: Hoare triple {168827#false} ~newmax3~0 := main_~node3__newmax~1#1; {168827#false} is VALID [2022-02-20 18:59:08,228 INFO L290 TraceCheckUtils]: 100: Hoare triple {168827#false} assume !(2 == ~r3~0 % 256);~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; {168827#false} is VALID [2022-02-20 18:59:08,228 INFO L290 TraceCheckUtils]: 101: Hoare triple {168827#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {168827#false} is VALID [2022-02-20 18:59:08,228 INFO L290 TraceCheckUtils]: 102: Hoare triple {168827#false} assume ~st1~0 + ~nl1~0 <= 1; {168827#false} is VALID [2022-02-20 18:59:08,231 INFO L290 TraceCheckUtils]: 103: Hoare triple {168827#false} assume ~st2~0 + ~nl2~0 <= 1; {168827#false} is VALID [2022-02-20 18:59:08,231 INFO L290 TraceCheckUtils]: 104: Hoare triple {168827#false} assume ~st3~0 + ~nl3~0 <= 1; {168827#false} is VALID [2022-02-20 18:59:08,231 INFO L290 TraceCheckUtils]: 105: Hoare triple {168827#false} assume !(~r1~0 % 256 >= 2); {168827#false} is VALID [2022-02-20 18:59:08,232 INFO L290 TraceCheckUtils]: 106: Hoare triple {168827#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1872~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1872~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; {168827#false} is VALID [2022-02-20 18:59:08,232 INFO L290 TraceCheckUtils]: 107: Hoare triple {168827#false} assume 0 == main_~assert__arg~1#1 % 256; {168827#false} is VALID [2022-02-20 18:59:08,232 INFO L290 TraceCheckUtils]: 108: Hoare triple {168827#false} assume !false; {168827#false} is VALID [2022-02-20 18:59:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:59:08,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:59:08,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616827174] [2022-02-20 18:59:08,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616827174] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:59:08,233 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:59:08,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:59:08,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973457302] [2022-02-20 18:59:08,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:59:08,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-02-20 18:59:08,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:59:08,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:59:08,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:59:08,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:59:08,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:59:08,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:59:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:59:08,294 INFO L87 Difference]: Start difference. First operand 7263 states and 10696 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)