./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+nlh-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+nlh-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 93af4e6a9c0eb04ce4865a35985b5a12937072c2a8c22ec9da868c5c828002bb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:58:01,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:58:01,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:58:01,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:58:01,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:58:01,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:58:01,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:58:01,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:58:01,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:58:01,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:58:01,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:58:01,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:58:01,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:58:01,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:58:01,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:58:01,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:58:01,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:58:01,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:58:01,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:58:01,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:58:01,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:58:01,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:58:01,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:58:01,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:58:01,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:58:01,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:58:01,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:58:01,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:58:01,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:58:01,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:58:01,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:58:01,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:58:01,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:58:01,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:58:01,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:58:01,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:58:01,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:58:01,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:58:01,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:58:01,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:58:01,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:58:01,377 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,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:58:01,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:58:01,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:58:01,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:58:01,404 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:58:01,404 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:58:01,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:58:01,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:58:01,405 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:58:01,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:58:01,406 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:58:01,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:58:01,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:58:01,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:58:01,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:58:01,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:58:01,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:58:01,407 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:58:01,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:58:01,407 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:58:01,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:58:01,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:58:01,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:58:01,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:58:01,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:58:01,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:58:01,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:58:01,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:58:01,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:58:01,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:58:01,410 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:58:01,410 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:58:01,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:58:01,410 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 -> 93af4e6a9c0eb04ce4865a35985b5a12937072c2a8c22ec9da868c5c828002bb [2022-02-20 18:58:01,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:58:01,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:58:01,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:58:01,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:58:01,645 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:58:01,646 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+nlh-reducer.c [2022-02-20 18:58:01,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93f3bfd02/387b754eb31f488798460a632276036c/FLAG70ca9758f [2022-02-20 18:58:02,057 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:58:02,058 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+nlh-reducer.c [2022-02-20 18:58:02,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93f3bfd02/387b754eb31f488798460a632276036c/FLAG70ca9758f [2022-02-20 18:58:02,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93f3bfd02/387b754eb31f488798460a632276036c [2022-02-20 18:58:02,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:58:02,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:58:02,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:58:02,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:58:02,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:58:02,097 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,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a86a63 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,098 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,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:58:02,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:58:02,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10668,10681] [2022-02-20 18:58:02,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:58:02,512 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:58:02,577 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+nlh-reducer.c[10668,10681] [2022-02-20 18:58:02,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:58:02,639 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:58:02,640 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,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:58:02,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:58:02,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:58:02,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:58:02,649 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,672 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,719 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 952 [2022-02-20 18:58:02,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:58:02,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:58:02,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:58:02,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:58:02,725 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,726 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,729 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,730 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,744 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,759 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,768 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,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:58:02,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:58:02,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:58:02,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:58:02,773 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,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:58:02,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:58:02,821 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,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:58:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:58:02,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:58:02,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:58:02,835 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,933 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:58:02,934 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:58:03,765 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:58:03,775 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:58:03,775 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:58:03,777 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,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:58:03,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:58:03,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:58:03,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:58:03,782 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,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89dc26e 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,783 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,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89dc26e 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,783 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,784 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:58:03,795 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:58:03,795 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:58:03,831 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:58:03,835 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,835 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:58:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 247 states, 245 states have (on average 1.7591836734693878) internal successors, (431), 246 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call 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,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 18:58:03,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:03,871 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:03,871 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1005429677, now seen corresponding path program 1 times [2022-02-20 18:58:03,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:03,882 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287584716] [2022-02-20 18:58:03,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:03,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:04,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {250#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_1528~0 := 0;~__return_1653~0 := 0; {250#true} is VALID [2022-02-20 18:58:04,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {250#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_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#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_~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; {252#(= (+ (* (- 1) ~ep12~0) |ULTIMATE.start_main_~init__r121~0#1|) 0)} is VALID [2022-02-20 18:58:04,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {252#(= (+ (* (- 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; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {253#(<= (+ (* (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); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(<= (+ (* (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); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {253#(<= (+ (* (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); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {253#(<= (+ (* (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); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {253#(<= (+ (* (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); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id2~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id3~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 != ~id3~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 >= 0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 >= 0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id3~0 >= 0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r1~0 % 256; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r2~0 % 256; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r3~0 % 256; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r122~0#1 % 256); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r132~0#1 % 256); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r212~0#1 % 256); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r232~0#1 % 256); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r312~0#1 % 256); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r322~0#1 % 256); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max1~0 == ~id1~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max2~0 == ~id2~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max3~0 == ~id3~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st1~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st2~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st3~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl1~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl2~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl3~0; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode1~0 % 256; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode2~0 % 256; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode3~0 % 256; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == ~newmax1~0 % 256); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == ~newmax2~0 % 256); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,352 INFO L290 TraceCheckUtils]: 43: Hoare triple {253#(<= (+ (* (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; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {253#(<= (+ (* (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; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~mode1~0 % 256); {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~r1~0 % 256 < 2; {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:58:04,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {253#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~ep12~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {251#false} assume !!(0 == ~ep13~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {251#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {251#false} is VALID [2022-02-20 18:58:04,358 INFO L290 TraceCheckUtils]: 50: Hoare triple {251#false} assume !!(0 == ~mode2~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {251#false} assume ~r2~0 % 256 < 2; {251#false} is VALID [2022-02-20 18:58:04,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {251#false} assume !!(0 == ~ep21~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {251#false} assume !!(0 == ~ep23~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {251#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {251#false} is VALID [2022-02-20 18:58:04,361 INFO L290 TraceCheckUtils]: 55: Hoare triple {251#false} assume !!(0 == ~mode3~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {251#false} assume ~r3~0 % 256 < 2; {251#false} is VALID [2022-02-20 18:58:04,363 INFO L290 TraceCheckUtils]: 57: Hoare triple {251#false} assume !!(0 == ~ep31~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {251#false} assume !!(0 == ~ep32~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,363 INFO L290 TraceCheckUtils]: 59: Hoare triple {251#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; {251#false} is VALID [2022-02-20 18:58:04,364 INFO L290 TraceCheckUtils]: 60: Hoare triple {251#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {251#false} is VALID [2022-02-20 18:58:04,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {251#false} assume ~st1~0 + ~nl1~0 <= 1; {251#false} is VALID [2022-02-20 18:58:04,364 INFO L290 TraceCheckUtils]: 62: Hoare triple {251#false} assume ~st2~0 + ~nl2~0 <= 1; {251#false} is VALID [2022-02-20 18:58:04,365 INFO L290 TraceCheckUtils]: 63: Hoare triple {251#false} assume ~st3~0 + ~nl3~0 <= 1; {251#false} is VALID [2022-02-20 18:58:04,365 INFO L290 TraceCheckUtils]: 64: Hoare triple {251#false} assume !(~r1~0 % 256 >= 2); {251#false} is VALID [2022-02-20 18:58:04,365 INFO L290 TraceCheckUtils]: 65: Hoare triple {251#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {251#false} is VALID [2022-02-20 18:58:04,365 INFO L290 TraceCheckUtils]: 66: Hoare triple {251#false} assume ~r1~0 % 256 < 2; {251#false} is VALID [2022-02-20 18:58:04,366 INFO L290 TraceCheckUtils]: 67: Hoare triple {251#false} assume !(~r1~0 % 256 >= 2); {251#false} is VALID [2022-02-20 18:58:04,366 INFO L290 TraceCheckUtils]: 68: Hoare triple {251#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {251#false} is VALID [2022-02-20 18:58:04,366 INFO L290 TraceCheckUtils]: 69: Hoare triple {251#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; {251#false} is VALID [2022-02-20 18:58:04,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {251#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {251#false} is VALID [2022-02-20 18:58:04,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {251#false} assume !(0 == ~mode1~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,367 INFO L290 TraceCheckUtils]: 72: Hoare triple {251#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {251#false} is VALID [2022-02-20 18:58:04,367 INFO L290 TraceCheckUtils]: 73: Hoare triple {251#false} assume !!(0 == ~ep21~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,367 INFO L290 TraceCheckUtils]: 74: Hoare triple {251#false} assume !!(0 == ~ep31~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,367 INFO L290 TraceCheckUtils]: 75: Hoare triple {251#false} ~newmax1~0 := main_~node1__newmax~1#1; {251#false} is VALID [2022-02-20 18:58:04,367 INFO L290 TraceCheckUtils]: 76: Hoare triple {251#false} assume 1 == ~r1~0 % 256; {251#false} is VALID [2022-02-20 18:58:04,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {251#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {251#false} is VALID [2022-02-20 18:58:04,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {251#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {251#false} is VALID [2022-02-20 18:58:04,369 INFO L290 TraceCheckUtils]: 79: Hoare triple {251#false} assume !(0 == ~mode2~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,371 INFO L290 TraceCheckUtils]: 80: Hoare triple {251#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {251#false} is VALID [2022-02-20 18:58:04,371 INFO L290 TraceCheckUtils]: 81: Hoare triple {251#false} assume !!(0 == ~ep12~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,371 INFO L290 TraceCheckUtils]: 82: Hoare triple {251#false} assume !!(0 == ~ep32~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,371 INFO L290 TraceCheckUtils]: 83: Hoare triple {251#false} ~newmax2~0 := main_~node2__newmax~1#1; {251#false} is VALID [2022-02-20 18:58:04,372 INFO L290 TraceCheckUtils]: 84: Hoare triple {251#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {251#false} is VALID [2022-02-20 18:58:04,372 INFO L290 TraceCheckUtils]: 85: Hoare triple {251#false} assume !(0 == ~mode3~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,372 INFO L290 TraceCheckUtils]: 86: Hoare triple {251#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {251#false} is VALID [2022-02-20 18:58:04,372 INFO L290 TraceCheckUtils]: 87: Hoare triple {251#false} assume !!(0 == ~ep13~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,373 INFO L290 TraceCheckUtils]: 88: Hoare triple {251#false} assume !!(0 == ~ep23~0 % 256); {251#false} is VALID [2022-02-20 18:58:04,379 INFO L290 TraceCheckUtils]: 89: Hoare triple {251#false} ~newmax3~0 := main_~node3__newmax~1#1; {251#false} is VALID [2022-02-20 18:58:04,379 INFO L290 TraceCheckUtils]: 90: Hoare triple {251#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; {251#false} is VALID [2022-02-20 18:58:04,379 INFO L290 TraceCheckUtils]: 91: Hoare triple {251#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {251#false} is VALID [2022-02-20 18:58:04,380 INFO L290 TraceCheckUtils]: 92: Hoare triple {251#false} assume ~st1~0 + ~nl1~0 <= 1; {251#false} is VALID [2022-02-20 18:58:04,380 INFO L290 TraceCheckUtils]: 93: Hoare triple {251#false} assume ~st2~0 + ~nl2~0 <= 1; {251#false} is VALID [2022-02-20 18:58:04,380 INFO L290 TraceCheckUtils]: 94: Hoare triple {251#false} assume ~st3~0 + ~nl3~0 <= 1; {251#false} is VALID [2022-02-20 18:58:04,380 INFO L290 TraceCheckUtils]: 95: Hoare triple {251#false} assume !(~r1~0 % 256 >= 2); {251#false} is VALID [2022-02-20 18:58:04,380 INFO L290 TraceCheckUtils]: 96: Hoare triple {251#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {251#false} is VALID [2022-02-20 18:58:04,380 INFO L290 TraceCheckUtils]: 97: Hoare triple {251#false} ~__return_1528~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1528~0; {251#false} is VALID [2022-02-20 18:58:04,380 INFO L290 TraceCheckUtils]: 98: Hoare triple {251#false} 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; {251#false} is VALID [2022-02-20 18:58:04,380 INFO L290 TraceCheckUtils]: 99: Hoare triple {251#false} assume 0 == main_~assert__arg~1#1 % 256; {251#false} is VALID [2022-02-20 18:58:04,380 INFO L290 TraceCheckUtils]: 100: Hoare triple {251#false} assume !false; {251#false} is VALID [2022-02-20 18:58:04,388 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,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:04,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287584716] [2022-02-20 18:58:04,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287584716] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:04,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:04,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:04,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876247220] [2022-02-20 18:58:04,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:04,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:04,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:04,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:04,486 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:04,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:04,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:04,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:04,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:04,510 INFO L87 Difference]: Start difference. First operand has 247 states, 245 states have (on average 1.7591836734693878) internal successors, (431), 246 states have internal predecessors, (431), 0 states have call successors, (0), 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 25.25) internal successors, (101), 4 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:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:05,526 INFO L93 Difference]: Finished difference Result 714 states and 1248 transitions. [2022-02-20 18:58:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:05,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1248 transitions. [2022-02-20 18:58:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1248 transitions. [2022-02-20 18:58:05,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1248 transitions. [2022-02-20 18:58:06,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1248 edges. 1248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:06,420 INFO L225 Difference]: With dead ends: 714 [2022-02-20 18:58:06,420 INFO L226 Difference]: Without dead ends: 470 [2022-02-20 18:58:06,423 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,425 INFO L933 BasicCegarLoop]: 601 mSDtfsCounter, 1005 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:06,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1005 Valid, 993 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-02-20 18:58:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2022-02-20 18:58:06,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:06,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 470 states. Second operand has 468 states, 467 states have (on average 1.4753747323340471) internal successors, (689), 467 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call 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,506 INFO L74 IsIncluded]: Start isIncluded. First operand 470 states. Second operand has 468 states, 467 states have (on average 1.4753747323340471) internal successors, (689), 467 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call 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,507 INFO L87 Difference]: Start difference. First operand 470 states. Second operand has 468 states, 467 states have (on average 1.4753747323340471) internal successors, (689), 467 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call 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,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:06,524 INFO L93 Difference]: Finished difference Result 470 states and 690 transitions. [2022-02-20 18:58:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 690 transitions. [2022-02-20 18:58:06,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:06,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:06,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 468 states, 467 states have (on average 1.4753747323340471) internal successors, (689), 467 states have internal predecessors, (689), 0 states have call successors, (0), 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 470 states. [2022-02-20 18:58:06,528 INFO L87 Difference]: Start difference. First operand has 468 states, 467 states have (on average 1.4753747323340471) internal successors, (689), 467 states have internal predecessors, (689), 0 states have call successors, (0), 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 470 states. [2022-02-20 18:58:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:06,548 INFO L93 Difference]: Finished difference Result 470 states and 690 transitions. [2022-02-20 18:58:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 690 transitions. [2022-02-20 18:58:06,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:06,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:06,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:06,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.4753747323340471) internal successors, (689), 467 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call 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,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 689 transitions. [2022-02-20 18:58:06,570 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 689 transitions. Word has length 101 [2022-02-20 18:58:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:06,571 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 689 transitions. [2022-02-20 18:58:06,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 689 transitions. [2022-02-20 18:58:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-20 18:58:06,572 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:06,573 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:06,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:58:06,573 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:06,574 INFO L85 PathProgramCache]: Analyzing trace with hash -769716679, now seen corresponding path program 1 times [2022-02-20 18:58:06,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:06,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620732049] [2022-02-20 18:58:06,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:06,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:06,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {2724#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_1528~0 := 0;~__return_1653~0 := 0; {2724#true} is VALID [2022-02-20 18:58:06,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#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_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#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_~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; {2724#true} is VALID [2022-02-20 18:58:06,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume !!(0 == main_~init__r121~0#1 % 256); {2724#true} is VALID [2022-02-20 18:58:06,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {2724#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {2726#(= (+ (* (- 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,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {2726#(= (+ (* (- 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); {2726#(= (+ (* (- 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,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {2726#(= (+ (* (- 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; {2725#false} is VALID [2022-02-20 18:58:06,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {2725#false} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {2725#false} is VALID [2022-02-20 18:58:06,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {2725#false} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {2725#false} is VALID [2022-02-20 18:58:06,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {2725#false} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {2725#false} is VALID [2022-02-20 18:58:06,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {2725#false} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {2725#false} is VALID [2022-02-20 18:58:06,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {2725#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {2725#false} is VALID [2022-02-20 18:58:06,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {2725#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {2725#false} is VALID [2022-02-20 18:58:06,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {2725#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {2725#false} is VALID [2022-02-20 18:58:06,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {2725#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {2725#false} is VALID [2022-02-20 18:58:06,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {2725#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {2725#false} is VALID [2022-02-20 18:58:06,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {2725#false} assume ~id1~0 != ~id2~0; {2725#false} is VALID [2022-02-20 18:58:06,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {2725#false} assume ~id1~0 != ~id3~0; {2725#false} is VALID [2022-02-20 18:58:06,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {2725#false} assume ~id2~0 != ~id3~0; {2725#false} is VALID [2022-02-20 18:58:06,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {2725#false} assume ~id1~0 >= 0; {2725#false} is VALID [2022-02-20 18:58:06,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {2725#false} assume ~id2~0 >= 0; {2725#false} is VALID [2022-02-20 18:58:06,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {2725#false} assume ~id3~0 >= 0; {2725#false} is VALID [2022-02-20 18:58:06,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {2725#false} assume 0 == ~r1~0 % 256; {2725#false} is VALID [2022-02-20 18:58:06,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {2725#false} assume 0 == ~r2~0 % 256; {2725#false} is VALID [2022-02-20 18:58:06,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {2725#false} assume 0 == ~r3~0 % 256; {2725#false} is VALID [2022-02-20 18:58:06,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {2725#false} assume !(0 == main_~init__r122~0#1 % 256); {2725#false} is VALID [2022-02-20 18:58:06,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {2725#false} assume !(0 == main_~init__r132~0#1 % 256); {2725#false} is VALID [2022-02-20 18:58:06,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {2725#false} assume !(0 == main_~init__r212~0#1 % 256); {2725#false} is VALID [2022-02-20 18:58:06,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {2725#false} assume !(0 == main_~init__r232~0#1 % 256); {2725#false} is VALID [2022-02-20 18:58:06,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {2725#false} assume !(0 == main_~init__r312~0#1 % 256); {2725#false} is VALID [2022-02-20 18:58:06,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {2725#false} assume !(0 == main_~init__r322~0#1 % 256); {2725#false} is VALID [2022-02-20 18:58:06,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {2725#false} assume ~max1~0 == ~id1~0; {2725#false} is VALID [2022-02-20 18:58:06,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {2725#false} assume ~max2~0 == ~id2~0; {2725#false} is VALID [2022-02-20 18:58:06,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {2725#false} assume ~max3~0 == ~id3~0; {2725#false} is VALID [2022-02-20 18:58:06,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {2725#false} assume 0 == ~st1~0; {2725#false} is VALID [2022-02-20 18:58:06,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {2725#false} assume 0 == ~st2~0; {2725#false} is VALID [2022-02-20 18:58:06,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {2725#false} assume 0 == ~st3~0; {2725#false} is VALID [2022-02-20 18:58:06,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {2725#false} assume 0 == ~nl1~0; {2725#false} is VALID [2022-02-20 18:58:06,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {2725#false} assume 0 == ~nl2~0; {2725#false} is VALID [2022-02-20 18:58:06,638 INFO L290 TraceCheckUtils]: 38: Hoare triple {2725#false} assume 0 == ~nl3~0; {2725#false} is VALID [2022-02-20 18:58:06,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {2725#false} assume 0 == ~mode1~0 % 256; {2725#false} is VALID [2022-02-20 18:58:06,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {2725#false} assume 0 == ~mode2~0 % 256; {2725#false} is VALID [2022-02-20 18:58:06,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {2725#false} assume 0 == ~mode3~0 % 256; {2725#false} is VALID [2022-02-20 18:58:06,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {2725#false} assume !(0 == ~newmax1~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {2725#false} assume !(0 == ~newmax2~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {2725#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; {2725#false} is VALID [2022-02-20 18:58:06,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {2725#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; {2725#false} is VALID [2022-02-20 18:58:06,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {2725#false} assume !!(0 == ~mode1~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {2725#false} assume ~r1~0 % 256 < 2; {2725#false} is VALID [2022-02-20 18:58:06,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {2725#false} assume !!(0 == ~ep12~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {2725#false} assume !!(0 == ~ep13~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {2725#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {2725#false} is VALID [2022-02-20 18:58:06,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {2725#false} assume !!(0 == ~mode2~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {2725#false} assume ~r2~0 % 256 < 2; {2725#false} is VALID [2022-02-20 18:58:06,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {2725#false} assume !!(0 == ~ep21~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,640 INFO L290 TraceCheckUtils]: 54: Hoare triple {2725#false} assume !!(0 == ~ep23~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,640 INFO L290 TraceCheckUtils]: 55: Hoare triple {2725#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {2725#false} is VALID [2022-02-20 18:58:06,640 INFO L290 TraceCheckUtils]: 56: Hoare triple {2725#false} assume !!(0 == ~mode3~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,640 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume ~r3~0 % 256 < 2; {2725#false} is VALID [2022-02-20 18:58:06,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !!(0 == ~ep31~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,641 INFO L290 TraceCheckUtils]: 59: Hoare triple {2725#false} assume !!(0 == ~ep32~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,641 INFO L290 TraceCheckUtils]: 60: Hoare triple {2725#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; {2725#false} is VALID [2022-02-20 18:58:06,641 INFO L290 TraceCheckUtils]: 61: Hoare triple {2725#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2725#false} is VALID [2022-02-20 18:58:06,641 INFO L290 TraceCheckUtils]: 62: Hoare triple {2725#false} assume ~st1~0 + ~nl1~0 <= 1; {2725#false} is VALID [2022-02-20 18:58:06,641 INFO L290 TraceCheckUtils]: 63: Hoare triple {2725#false} assume ~st2~0 + ~nl2~0 <= 1; {2725#false} is VALID [2022-02-20 18:58:06,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {2725#false} assume ~st3~0 + ~nl3~0 <= 1; {2725#false} is VALID [2022-02-20 18:58:06,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {2725#false} assume !(~r1~0 % 256 >= 2); {2725#false} is VALID [2022-02-20 18:58:06,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {2725#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2725#false} is VALID [2022-02-20 18:58:06,642 INFO L290 TraceCheckUtils]: 67: Hoare triple {2725#false} assume ~r1~0 % 256 < 2; {2725#false} is VALID [2022-02-20 18:58:06,642 INFO L290 TraceCheckUtils]: 68: Hoare triple {2725#false} assume !(~r1~0 % 256 >= 2); {2725#false} is VALID [2022-02-20 18:58:06,642 INFO L290 TraceCheckUtils]: 69: Hoare triple {2725#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2725#false} is VALID [2022-02-20 18:58:06,642 INFO L290 TraceCheckUtils]: 70: Hoare triple {2725#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; {2725#false} is VALID [2022-02-20 18:58:06,643 INFO L290 TraceCheckUtils]: 71: Hoare triple {2725#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {2725#false} is VALID [2022-02-20 18:58:06,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {2725#false} assume !(0 == ~mode1~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,643 INFO L290 TraceCheckUtils]: 73: Hoare triple {2725#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {2725#false} is VALID [2022-02-20 18:58:06,643 INFO L290 TraceCheckUtils]: 74: Hoare triple {2725#false} assume !!(0 == ~ep21~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,643 INFO L290 TraceCheckUtils]: 75: Hoare triple {2725#false} assume !!(0 == ~ep31~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,643 INFO L290 TraceCheckUtils]: 76: Hoare triple {2725#false} ~newmax1~0 := main_~node1__newmax~1#1; {2725#false} is VALID [2022-02-20 18:58:06,644 INFO L290 TraceCheckUtils]: 77: Hoare triple {2725#false} assume 1 == ~r1~0 % 256; {2725#false} is VALID [2022-02-20 18:58:06,644 INFO L290 TraceCheckUtils]: 78: Hoare triple {2725#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {2725#false} is VALID [2022-02-20 18:58:06,644 INFO L290 TraceCheckUtils]: 79: Hoare triple {2725#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {2725#false} is VALID [2022-02-20 18:58:06,644 INFO L290 TraceCheckUtils]: 80: Hoare triple {2725#false} assume !(0 == ~mode2~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,644 INFO L290 TraceCheckUtils]: 81: Hoare triple {2725#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {2725#false} is VALID [2022-02-20 18:58:06,644 INFO L290 TraceCheckUtils]: 82: Hoare triple {2725#false} assume !!(0 == ~ep12~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,644 INFO L290 TraceCheckUtils]: 83: Hoare triple {2725#false} assume !!(0 == ~ep32~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,645 INFO L290 TraceCheckUtils]: 84: Hoare triple {2725#false} ~newmax2~0 := main_~node2__newmax~1#1; {2725#false} is VALID [2022-02-20 18:58:06,645 INFO L290 TraceCheckUtils]: 85: Hoare triple {2725#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {2725#false} is VALID [2022-02-20 18:58:06,645 INFO L290 TraceCheckUtils]: 86: Hoare triple {2725#false} assume !(0 == ~mode3~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,645 INFO L290 TraceCheckUtils]: 87: Hoare triple {2725#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {2725#false} is VALID [2022-02-20 18:58:06,645 INFO L290 TraceCheckUtils]: 88: Hoare triple {2725#false} assume !!(0 == ~ep13~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,645 INFO L290 TraceCheckUtils]: 89: Hoare triple {2725#false} assume !!(0 == ~ep23~0 % 256); {2725#false} is VALID [2022-02-20 18:58:06,645 INFO L290 TraceCheckUtils]: 90: Hoare triple {2725#false} ~newmax3~0 := main_~node3__newmax~1#1; {2725#false} is VALID [2022-02-20 18:58:06,646 INFO L290 TraceCheckUtils]: 91: Hoare triple {2725#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; {2725#false} is VALID [2022-02-20 18:58:06,646 INFO L290 TraceCheckUtils]: 92: Hoare triple {2725#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2725#false} is VALID [2022-02-20 18:58:06,646 INFO L290 TraceCheckUtils]: 93: Hoare triple {2725#false} assume ~st1~0 + ~nl1~0 <= 1; {2725#false} is VALID [2022-02-20 18:58:06,646 INFO L290 TraceCheckUtils]: 94: Hoare triple {2725#false} assume ~st2~0 + ~nl2~0 <= 1; {2725#false} is VALID [2022-02-20 18:58:06,646 INFO L290 TraceCheckUtils]: 95: Hoare triple {2725#false} assume ~st3~0 + ~nl3~0 <= 1; {2725#false} is VALID [2022-02-20 18:58:06,646 INFO L290 TraceCheckUtils]: 96: Hoare triple {2725#false} assume !(~r1~0 % 256 >= 2); {2725#false} is VALID [2022-02-20 18:58:06,647 INFO L290 TraceCheckUtils]: 97: Hoare triple {2725#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {2725#false} is VALID [2022-02-20 18:58:06,647 INFO L290 TraceCheckUtils]: 98: Hoare triple {2725#false} ~__return_1528~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1528~0; {2725#false} is VALID [2022-02-20 18:58:06,647 INFO L290 TraceCheckUtils]: 99: Hoare triple {2725#false} 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; {2725#false} is VALID [2022-02-20 18:58:06,647 INFO L290 TraceCheckUtils]: 100: Hoare triple {2725#false} assume 0 == main_~assert__arg~1#1 % 256; {2725#false} is VALID [2022-02-20 18:58:06,647 INFO L290 TraceCheckUtils]: 101: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-02-20 18:58:06,648 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,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:06,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620732049] [2022-02-20 18:58:06,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620732049] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:06,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:06,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:06,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552992612] [2022-02-20 18:58:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:06,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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:06,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:06,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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:06,705 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:06,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:06,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:06,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:06,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:06,706 INFO L87 Difference]: Start difference. First operand 468 states and 689 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:07,362 INFO L93 Difference]: Finished difference Result 1366 states and 2005 transitions. [2022-02-20 18:58:07,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:07,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2022-02-20 18:58:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2022-02-20 18:58:07,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1062 transitions. [2022-02-20 18:58:07,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1062 edges. 1062 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:08,033 INFO L225 Difference]: With dead ends: 1366 [2022-02-20 18:58:08,034 INFO L226 Difference]: Without dead ends: 926 [2022-02-20 18:58:08,037 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,038 INFO L933 BasicCegarLoop]: 687 mSDtfsCounter, 352 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1041 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,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 1041 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,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-02-20 18:58:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 470. [2022-02-20 18:58:08,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:08,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 926 states. Second operand has 470 states, 469 states have (on average 1.4733475479744136) internal successors, (691), 469 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call 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,094 INFO L74 IsIncluded]: Start isIncluded. First operand 926 states. Second operand has 470 states, 469 states have (on average 1.4733475479744136) internal successors, (691), 469 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call 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,095 INFO L87 Difference]: Start difference. First operand 926 states. Second operand has 470 states, 469 states have (on average 1.4733475479744136) internal successors, (691), 469 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call 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,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:08,124 INFO L93 Difference]: Finished difference Result 926 states and 1361 transitions. [2022-02-20 18:58:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1361 transitions. [2022-02-20 18:58:08,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:08,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:08,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 470 states, 469 states have (on average 1.4733475479744136) internal successors, (691), 469 states have internal predecessors, (691), 0 states have call successors, (0), 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 926 states. [2022-02-20 18:58:08,128 INFO L87 Difference]: Start difference. First operand has 470 states, 469 states have (on average 1.4733475479744136) internal successors, (691), 469 states have internal predecessors, (691), 0 states have call successors, (0), 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 926 states. [2022-02-20 18:58:08,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:08,157 INFO L93 Difference]: Finished difference Result 926 states and 1361 transitions. [2022-02-20 18:58:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1361 transitions. [2022-02-20 18:58:08,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:08,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:08,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:08,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.4733475479744136) internal successors, (691), 469 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call 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,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 691 transitions. [2022-02-20 18:58:08,170 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 691 transitions. Word has length 102 [2022-02-20 18:58:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:08,170 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 691 transitions. [2022-02-20 18:58:08,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 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:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 691 transitions. [2022-02-20 18:58:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-20 18:58:08,172 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:08,172 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:08,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:58:08,172 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1142488916, now seen corresponding path program 1 times [2022-02-20 18:58:08,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:08,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672781002] [2022-02-20 18:58:08,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:08,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:08,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {6955#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_1528~0 := 0;~__return_1653~0 := 0; {6955#true} is VALID [2022-02-20 18:58:08,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {6955#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_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#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_~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; {6955#true} is VALID [2022-02-20 18:58:08,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {6955#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {6955#true} is VALID [2022-02-20 18:58:08,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {6955#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {6955#true} is VALID [2022-02-20 18:58:08,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {6955#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {6955#true} is VALID [2022-02-20 18:58:08,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {6955#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {6955#true} is VALID [2022-02-20 18:58:08,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {6955#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {6955#true} is VALID [2022-02-20 18:58:08,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {6955#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {6955#true} is VALID [2022-02-20 18:58:08,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {6955#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {6955#true} is VALID [2022-02-20 18:58:08,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {6955#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {6955#true} is VALID [2022-02-20 18:58:08,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {6955#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {6955#true} is VALID [2022-02-20 18:58:08,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {6955#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {6955#true} is VALID [2022-02-20 18:58:08,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {6955#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {6955#true} is VALID [2022-02-20 18:58:08,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {6955#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {6955#true} is VALID [2022-02-20 18:58:08,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {6955#true} assume ~id1~0 != ~id2~0; {6955#true} is VALID [2022-02-20 18:58:08,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {6955#true} assume ~id1~0 != ~id3~0; {6955#true} is VALID [2022-02-20 18:58:08,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {6955#true} assume ~id2~0 != ~id3~0; {6955#true} is VALID [2022-02-20 18:58:08,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {6955#true} assume ~id1~0 >= 0; {6955#true} is VALID [2022-02-20 18:58:08,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {6955#true} assume ~id2~0 >= 0; {6955#true} is VALID [2022-02-20 18:58:08,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {6955#true} assume ~id3~0 >= 0; {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {6955#true} assume 0 == ~r1~0 % 256; {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {6955#true} assume 0 == ~r2~0 % 256; {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {6955#true} assume 0 == ~r3~0 % 256; {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {6955#true} assume !(0 == main_~init__r122~0#1 % 256); {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {6955#true} assume !(0 == main_~init__r132~0#1 % 256); {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {6955#true} assume !(0 == main_~init__r212~0#1 % 256); {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {6955#true} assume !(0 == main_~init__r232~0#1 % 256); {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {6955#true} assume !(0 == main_~init__r312~0#1 % 256); {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {6955#true} assume !(0 == main_~init__r322~0#1 % 256); {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {6955#true} assume ~max1~0 == ~id1~0; {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {6955#true} assume ~max2~0 == ~id2~0; {6955#true} is VALID [2022-02-20 18:58:08,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {6955#true} assume ~max3~0 == ~id3~0; {6955#true} is VALID [2022-02-20 18:58:08,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {6955#true} assume 0 == ~st1~0; {6955#true} is VALID [2022-02-20 18:58:08,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {6955#true} assume 0 == ~st2~0; {6955#true} is VALID [2022-02-20 18:58:08,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {6955#true} assume 0 == ~st3~0; {6955#true} is VALID [2022-02-20 18:58:08,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {6955#true} assume 0 == ~nl1~0; {6955#true} is VALID [2022-02-20 18:58:08,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {6955#true} assume 0 == ~nl2~0; {6955#true} is VALID [2022-02-20 18:58:08,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {6955#true} assume 0 == ~nl3~0; {6955#true} is VALID [2022-02-20 18:58:08,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {6955#true} assume 0 == ~mode1~0 % 256; {6955#true} is VALID [2022-02-20 18:58:08,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {6955#true} assume 0 == ~mode2~0 % 256; {6955#true} is VALID [2022-02-20 18:58:08,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {6955#true} assume 0 == ~mode3~0 % 256; {6955#true} is VALID [2022-02-20 18:58:08,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {6955#true} assume !(0 == ~newmax1~0 % 256); {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume !(0 == ~newmax2~0 % 256); {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {6957#(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; {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {6957#(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; {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume !!(0 == ~mode1~0 % 256); {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume ~r1~0 % 256 < 2; {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,280 INFO L290 TraceCheckUtils]: 47: Hoare triple {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume !(0 == ~ep12~0 % 256); {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} is VALID [2022-02-20 18:58:08,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {6957#(not (= (+ (* (div ~newmax1~0 256) (- 256)) ~newmax1~0) 0))} assume !!(0 == ~newmax1~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {6956#false} assume !!(0 == ~ep13~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,280 INFO L290 TraceCheckUtils]: 50: Hoare triple {6956#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {6956#false} is VALID [2022-02-20 18:58:08,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {6956#false} assume !!(0 == ~mode2~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {6956#false} assume ~r2~0 % 256 < 2; {6956#false} is VALID [2022-02-20 18:58:08,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {6956#false} assume !!(0 == ~ep21~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {6956#false} assume !!(0 == ~ep23~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {6956#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {6956#false} is VALID [2022-02-20 18:58:08,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {6956#false} assume !!(0 == ~mode3~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {6956#false} assume ~r3~0 % 256 < 2; {6956#false} is VALID [2022-02-20 18:58:08,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {6956#false} assume !!(0 == ~ep31~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {6956#false} assume !!(0 == ~ep32~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {6956#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; {6956#false} is VALID [2022-02-20 18:58:08,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {6956#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6956#false} is VALID [2022-02-20 18:58:08,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {6956#false} assume ~st1~0 + ~nl1~0 <= 1; {6956#false} is VALID [2022-02-20 18:58:08,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {6956#false} assume ~st2~0 + ~nl2~0 <= 1; {6956#false} is VALID [2022-02-20 18:58:08,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {6956#false} assume ~st3~0 + ~nl3~0 <= 1; {6956#false} is VALID [2022-02-20 18:58:08,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {6956#false} assume !(~r1~0 % 256 >= 2); {6956#false} is VALID [2022-02-20 18:58:08,283 INFO L290 TraceCheckUtils]: 66: Hoare triple {6956#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {6956#false} is VALID [2022-02-20 18:58:08,283 INFO L290 TraceCheckUtils]: 67: Hoare triple {6956#false} assume ~r1~0 % 256 < 2; {6956#false} is VALID [2022-02-20 18:58:08,283 INFO L290 TraceCheckUtils]: 68: Hoare triple {6956#false} assume !(~r1~0 % 256 >= 2); {6956#false} is VALID [2022-02-20 18:58:08,283 INFO L290 TraceCheckUtils]: 69: Hoare triple {6956#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {6956#false} is VALID [2022-02-20 18:58:08,283 INFO L290 TraceCheckUtils]: 70: Hoare triple {6956#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; {6956#false} is VALID [2022-02-20 18:58:08,283 INFO L290 TraceCheckUtils]: 71: Hoare triple {6956#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {6956#false} is VALID [2022-02-20 18:58:08,283 INFO L290 TraceCheckUtils]: 72: Hoare triple {6956#false} assume !(0 == ~mode1~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,284 INFO L290 TraceCheckUtils]: 73: Hoare triple {6956#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {6956#false} is VALID [2022-02-20 18:58:08,284 INFO L290 TraceCheckUtils]: 74: Hoare triple {6956#false} assume !!(0 == ~ep21~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,284 INFO L290 TraceCheckUtils]: 75: Hoare triple {6956#false} assume !!(0 == ~ep31~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,284 INFO L290 TraceCheckUtils]: 76: Hoare triple {6956#false} ~newmax1~0 := main_~node1__newmax~1#1; {6956#false} is VALID [2022-02-20 18:58:08,284 INFO L290 TraceCheckUtils]: 77: Hoare triple {6956#false} assume 1 == ~r1~0 % 256; {6956#false} is VALID [2022-02-20 18:58:08,284 INFO L290 TraceCheckUtils]: 78: Hoare triple {6956#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {6956#false} is VALID [2022-02-20 18:58:08,284 INFO L290 TraceCheckUtils]: 79: Hoare triple {6956#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {6956#false} is VALID [2022-02-20 18:58:08,285 INFO L290 TraceCheckUtils]: 80: Hoare triple {6956#false} assume !(0 == ~mode2~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,285 INFO L290 TraceCheckUtils]: 81: Hoare triple {6956#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {6956#false} is VALID [2022-02-20 18:58:08,285 INFO L290 TraceCheckUtils]: 82: Hoare triple {6956#false} assume !(0 == ~ep12~0 % 256);~m2~0 := ~p12_old~0;~p12_old~0 := ~nomsg~0; {6956#false} is VALID [2022-02-20 18:58:08,285 INFO L290 TraceCheckUtils]: 83: Hoare triple {6956#false} assume !(~m2~0 > ~max2~0); {6956#false} is VALID [2022-02-20 18:58:08,285 INFO L290 TraceCheckUtils]: 84: Hoare triple {6956#false} assume !!(0 == ~ep32~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,285 INFO L290 TraceCheckUtils]: 85: Hoare triple {6956#false} ~newmax2~0 := main_~node2__newmax~1#1; {6956#false} is VALID [2022-02-20 18:58:08,285 INFO L290 TraceCheckUtils]: 86: Hoare triple {6956#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {6956#false} is VALID [2022-02-20 18:58:08,285 INFO L290 TraceCheckUtils]: 87: Hoare triple {6956#false} assume !(0 == ~mode3~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,286 INFO L290 TraceCheckUtils]: 88: Hoare triple {6956#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {6956#false} is VALID [2022-02-20 18:58:08,286 INFO L290 TraceCheckUtils]: 89: Hoare triple {6956#false} assume !!(0 == ~ep13~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,286 INFO L290 TraceCheckUtils]: 90: Hoare triple {6956#false} assume !!(0 == ~ep23~0 % 256); {6956#false} is VALID [2022-02-20 18:58:08,286 INFO L290 TraceCheckUtils]: 91: Hoare triple {6956#false} ~newmax3~0 := main_~node3__newmax~1#1; {6956#false} is VALID [2022-02-20 18:58:08,286 INFO L290 TraceCheckUtils]: 92: Hoare triple {6956#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; {6956#false} is VALID [2022-02-20 18:58:08,286 INFO L290 TraceCheckUtils]: 93: Hoare triple {6956#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6956#false} is VALID [2022-02-20 18:58:08,286 INFO L290 TraceCheckUtils]: 94: Hoare triple {6956#false} assume ~st1~0 + ~nl1~0 <= 1; {6956#false} is VALID [2022-02-20 18:58:08,287 INFO L290 TraceCheckUtils]: 95: Hoare triple {6956#false} assume ~st2~0 + ~nl2~0 <= 1; {6956#false} is VALID [2022-02-20 18:58:08,287 INFO L290 TraceCheckUtils]: 96: Hoare triple {6956#false} assume ~st3~0 + ~nl3~0 <= 1; {6956#false} is VALID [2022-02-20 18:58:08,287 INFO L290 TraceCheckUtils]: 97: Hoare triple {6956#false} assume !(~r1~0 % 256 >= 2); {6956#false} is VALID [2022-02-20 18:58:08,287 INFO L290 TraceCheckUtils]: 98: Hoare triple {6956#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {6956#false} is VALID [2022-02-20 18:58:08,287 INFO L290 TraceCheckUtils]: 99: Hoare triple {6956#false} ~__return_1528~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1528~0; {6956#false} is VALID [2022-02-20 18:58:08,287 INFO L290 TraceCheckUtils]: 100: Hoare triple {6956#false} 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; {6956#false} is VALID [2022-02-20 18:58:08,287 INFO L290 TraceCheckUtils]: 101: Hoare triple {6956#false} assume 0 == main_~assert__arg~1#1 % 256; {6956#false} is VALID [2022-02-20 18:58:08,287 INFO L290 TraceCheckUtils]: 102: Hoare triple {6956#false} assume !false; {6956#false} is VALID [2022-02-20 18:58:08,288 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,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:08,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672781002] [2022-02-20 18:58:08,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672781002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:08,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:08,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:08,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875792975] [2022-02-20 18:58:08,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:08,289 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:08,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:08,290 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:08,353 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:08,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:08,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:08,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:08,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:08,354 INFO L87 Difference]: Start difference. First operand 470 states and 691 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:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:08,859 INFO L93 Difference]: Finished difference Result 977 states and 1492 transitions. [2022-02-20 18:58:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:08,860 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:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:08,860 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:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2022-02-20 18:58:08,863 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:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2022-02-20 18:58:08,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 780 transitions. [2022-02-20 18:58:09,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 780 edges. 780 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:09,337 INFO L225 Difference]: With dead ends: 977 [2022-02-20 18:58:09,337 INFO L226 Difference]: Without dead ends: 634 [2022-02-20 18:58:09,338 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,338 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 233 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 745 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,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 745 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,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-02-20 18:58:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 618. [2022-02-20 18:58:09,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:09,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 634 states. Second operand has 618 states, 617 states have (on average 1.5153970826580228) internal successors, (935), 617 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call 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,413 INFO L74 IsIncluded]: Start isIncluded. First operand 634 states. Second operand has 618 states, 617 states have (on average 1.5153970826580228) internal successors, (935), 617 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call 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,414 INFO L87 Difference]: Start difference. First operand 634 states. Second operand has 618 states, 617 states have (on average 1.5153970826580228) internal successors, (935), 617 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call 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,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:09,428 INFO L93 Difference]: Finished difference Result 634 states and 960 transitions. [2022-02-20 18:58:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 960 transitions. [2022-02-20 18:58:09,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:09,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:09,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 618 states, 617 states have (on average 1.5153970826580228) internal successors, (935), 617 states have internal predecessors, (935), 0 states have call successors, (0), 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 634 states. [2022-02-20 18:58:09,431 INFO L87 Difference]: Start difference. First operand has 618 states, 617 states have (on average 1.5153970826580228) internal successors, (935), 617 states have internal predecessors, (935), 0 states have call successors, (0), 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 634 states. [2022-02-20 18:58:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:09,446 INFO L93 Difference]: Finished difference Result 634 states and 960 transitions. [2022-02-20 18:58:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 960 transitions. [2022-02-20 18:58:09,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:09,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:09,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:09,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 1.5153970826580228) internal successors, (935), 617 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call 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,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 935 transitions. [2022-02-20 18:58:09,465 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 935 transitions. Word has length 103 [2022-02-20 18:58:09,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:09,465 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 935 transitions. [2022-02-20 18:58:09,465 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:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 935 transitions. [2022-02-20 18:58:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-20 18:58:09,466 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:09,466 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:09,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:58:09,467 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:09,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash -362955380, now seen corresponding path program 1 times [2022-02-20 18:58:09,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:09,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208560071] [2022-02-20 18:58:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:09,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:09,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {10342#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_1528~0 := 0;~__return_1653~0 := 0; {10342#true} is VALID [2022-02-20 18:58:09,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {10342#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_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#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_~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; {10344#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {10344#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {10344#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {10344#(= (+ |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; {10344#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {10344#(= (+ |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); {10344#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {10344#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {10344#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {10344#(= (+ |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; {10344#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {10344#(= (+ |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); {10344#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:58:09,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {10344#(= (+ |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; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {10345#(<= (+ (* 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); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {10345#(<= (+ (* 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); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {10345#(<= (+ (* 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); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {10345#(<= (+ (* 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); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id2~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id3~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 != ~id3~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 >= 0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 >= 0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id3~0 >= 0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r1~0 % 256; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r2~0 % 256; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r3~0 % 256; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r122~0#1 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r132~0#1 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r212~0#1 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r232~0#1 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r312~0#1 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r322~0#1 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max1~0 == ~id1~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max2~0 == ~id2~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max3~0 == ~id3~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st1~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st2~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st3~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl1~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,576 INFO L290 TraceCheckUtils]: 38: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl2~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,576 INFO L290 TraceCheckUtils]: 39: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl3~0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode1~0 % 256; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode2~0 % 256; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode3~0 % 256; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == ~newmax1~0 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == ~newmax2~0 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {10345#(<= (+ (* 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; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {10345#(<= (+ (* 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; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode1~0 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r1~0 % 256 < 2; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep12~0 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep13~0 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode2~0 % 256); {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r2~0 % 256 < 2; {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:58:09,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {10345#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep21~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {10343#false} assume !!(0 == ~ep23~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {10343#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {10343#false} is VALID [2022-02-20 18:58:09,582 INFO L290 TraceCheckUtils]: 57: Hoare triple {10343#false} assume !!(0 == ~mode3~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,582 INFO L290 TraceCheckUtils]: 58: Hoare triple {10343#false} assume ~r3~0 % 256 < 2; {10343#false} is VALID [2022-02-20 18:58:09,582 INFO L290 TraceCheckUtils]: 59: Hoare triple {10343#false} assume !!(0 == ~ep31~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,582 INFO L290 TraceCheckUtils]: 60: Hoare triple {10343#false} assume !!(0 == ~ep32~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,582 INFO L290 TraceCheckUtils]: 61: Hoare triple {10343#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; {10343#false} is VALID [2022-02-20 18:58:09,582 INFO L290 TraceCheckUtils]: 62: Hoare triple {10343#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10343#false} is VALID [2022-02-20 18:58:09,583 INFO L290 TraceCheckUtils]: 63: Hoare triple {10343#false} assume ~st1~0 + ~nl1~0 <= 1; {10343#false} is VALID [2022-02-20 18:58:09,583 INFO L290 TraceCheckUtils]: 64: Hoare triple {10343#false} assume ~st2~0 + ~nl2~0 <= 1; {10343#false} is VALID [2022-02-20 18:58:09,583 INFO L290 TraceCheckUtils]: 65: Hoare triple {10343#false} assume ~st3~0 + ~nl3~0 <= 1; {10343#false} is VALID [2022-02-20 18:58:09,583 INFO L290 TraceCheckUtils]: 66: Hoare triple {10343#false} assume !(~r1~0 % 256 >= 2); {10343#false} is VALID [2022-02-20 18:58:09,583 INFO L290 TraceCheckUtils]: 67: Hoare triple {10343#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {10343#false} is VALID [2022-02-20 18:58:09,583 INFO L290 TraceCheckUtils]: 68: Hoare triple {10343#false} assume ~r1~0 % 256 < 2; {10343#false} is VALID [2022-02-20 18:58:09,583 INFO L290 TraceCheckUtils]: 69: Hoare triple {10343#false} assume !(~r1~0 % 256 >= 2); {10343#false} is VALID [2022-02-20 18:58:09,583 INFO L290 TraceCheckUtils]: 70: Hoare triple {10343#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {10343#false} is VALID [2022-02-20 18:58:09,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {10343#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; {10343#false} is VALID [2022-02-20 18:58:09,584 INFO L290 TraceCheckUtils]: 72: Hoare triple {10343#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {10343#false} is VALID [2022-02-20 18:58:09,584 INFO L290 TraceCheckUtils]: 73: Hoare triple {10343#false} assume !(0 == ~mode1~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,584 INFO L290 TraceCheckUtils]: 74: Hoare triple {10343#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {10343#false} is VALID [2022-02-20 18:58:09,584 INFO L290 TraceCheckUtils]: 75: Hoare triple {10343#false} assume !!(0 == ~ep21~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,584 INFO L290 TraceCheckUtils]: 76: Hoare triple {10343#false} assume !!(0 == ~ep31~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,584 INFO L290 TraceCheckUtils]: 77: Hoare triple {10343#false} ~newmax1~0 := main_~node1__newmax~1#1; {10343#false} is VALID [2022-02-20 18:58:09,584 INFO L290 TraceCheckUtils]: 78: Hoare triple {10343#false} assume 1 == ~r1~0 % 256; {10343#false} is VALID [2022-02-20 18:58:09,584 INFO L290 TraceCheckUtils]: 79: Hoare triple {10343#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {10343#false} is VALID [2022-02-20 18:58:09,585 INFO L290 TraceCheckUtils]: 80: Hoare triple {10343#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {10343#false} is VALID [2022-02-20 18:58:09,585 INFO L290 TraceCheckUtils]: 81: Hoare triple {10343#false} assume !(0 == ~mode2~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,585 INFO L290 TraceCheckUtils]: 82: Hoare triple {10343#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {10343#false} is VALID [2022-02-20 18:58:09,585 INFO L290 TraceCheckUtils]: 83: Hoare triple {10343#false} assume !!(0 == ~ep12~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,585 INFO L290 TraceCheckUtils]: 84: Hoare triple {10343#false} assume !!(0 == ~ep32~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,585 INFO L290 TraceCheckUtils]: 85: Hoare triple {10343#false} ~newmax2~0 := main_~node2__newmax~1#1; {10343#false} is VALID [2022-02-20 18:58:09,585 INFO L290 TraceCheckUtils]: 86: Hoare triple {10343#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {10343#false} is VALID [2022-02-20 18:58:09,585 INFO L290 TraceCheckUtils]: 87: Hoare triple {10343#false} assume !(0 == ~mode3~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {10343#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {10343#false} is VALID [2022-02-20 18:58:09,586 INFO L290 TraceCheckUtils]: 89: Hoare triple {10343#false} assume !!(0 == ~ep13~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,586 INFO L290 TraceCheckUtils]: 90: Hoare triple {10343#false} assume !!(0 == ~ep23~0 % 256); {10343#false} is VALID [2022-02-20 18:58:09,586 INFO L290 TraceCheckUtils]: 91: Hoare triple {10343#false} ~newmax3~0 := main_~node3__newmax~1#1; {10343#false} is VALID [2022-02-20 18:58:09,586 INFO L290 TraceCheckUtils]: 92: Hoare triple {10343#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; {10343#false} is VALID [2022-02-20 18:58:09,586 INFO L290 TraceCheckUtils]: 93: Hoare triple {10343#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10343#false} is VALID [2022-02-20 18:58:09,586 INFO L290 TraceCheckUtils]: 94: Hoare triple {10343#false} assume ~st1~0 + ~nl1~0 <= 1; {10343#false} is VALID [2022-02-20 18:58:09,586 INFO L290 TraceCheckUtils]: 95: Hoare triple {10343#false} assume ~st2~0 + ~nl2~0 <= 1; {10343#false} is VALID [2022-02-20 18:58:09,586 INFO L290 TraceCheckUtils]: 96: Hoare triple {10343#false} assume ~st3~0 + ~nl3~0 <= 1; {10343#false} is VALID [2022-02-20 18:58:09,587 INFO L290 TraceCheckUtils]: 97: Hoare triple {10343#false} assume !(~r1~0 % 256 >= 2); {10343#false} is VALID [2022-02-20 18:58:09,587 INFO L290 TraceCheckUtils]: 98: Hoare triple {10343#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {10343#false} is VALID [2022-02-20 18:58:09,587 INFO L290 TraceCheckUtils]: 99: Hoare triple {10343#false} ~__return_1528~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1528~0; {10343#false} is VALID [2022-02-20 18:58:09,587 INFO L290 TraceCheckUtils]: 100: Hoare triple {10343#false} 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; {10343#false} is VALID [2022-02-20 18:58:09,587 INFO L290 TraceCheckUtils]: 101: Hoare triple {10343#false} assume 0 == main_~assert__arg~1#1 % 256; {10343#false} is VALID [2022-02-20 18:58:09,587 INFO L290 TraceCheckUtils]: 102: Hoare triple {10343#false} assume !false; {10343#false} is VALID [2022-02-20 18:58:09,588 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,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:09,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208560071] [2022-02-20 18:58:09,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208560071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:09,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:09,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:09,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484115754] [2022-02-20 18:58:09,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:09,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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:09,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:09,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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:09,650 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:09,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:09,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:09,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:09,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:09,651 INFO L87 Difference]: Start difference. First operand 618 states and 935 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:10,579 INFO L93 Difference]: Finished difference Result 1766 states and 2661 transitions. [2022-02-20 18:58:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:10,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1010 transitions. [2022-02-20 18:58:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1010 transitions. [2022-02-20 18:58:10,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1010 transitions. [2022-02-20 18:58:11,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1010 edges. 1010 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:11,293 INFO L225 Difference]: With dead ends: 1766 [2022-02-20 18:58:11,293 INFO L226 Difference]: Without dead ends: 1178 [2022-02-20 18:58:11,294 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,294 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 760 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:11,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 858 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2022-02-20 18:58:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2022-02-20 18:58:11,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:11,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1178 states. Second operand has 1176 states, 1175 states have (on average 1.4978723404255319) internal successors, (1760), 1175 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call 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,499 INFO L74 IsIncluded]: Start isIncluded. First operand 1178 states. Second operand has 1176 states, 1175 states have (on average 1.4978723404255319) internal successors, (1760), 1175 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call 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,501 INFO L87 Difference]: Start difference. First operand 1178 states. Second operand has 1176 states, 1175 states have (on average 1.4978723404255319) internal successors, (1760), 1175 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call 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,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:11,542 INFO L93 Difference]: Finished difference Result 1178 states and 1761 transitions. [2022-02-20 18:58:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1761 transitions. [2022-02-20 18:58:11,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:11,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:11,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 1176 states, 1175 states have (on average 1.4978723404255319) internal successors, (1760), 1175 states have internal predecessors, (1760), 0 states have call successors, (0), 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 1178 states. [2022-02-20 18:58:11,549 INFO L87 Difference]: Start difference. First operand has 1176 states, 1175 states have (on average 1.4978723404255319) internal successors, (1760), 1175 states have internal predecessors, (1760), 0 states have call successors, (0), 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 1178 states. [2022-02-20 18:58:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:11,590 INFO L93 Difference]: Finished difference Result 1178 states and 1761 transitions. [2022-02-20 18:58:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1761 transitions. [2022-02-20 18:58:11,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:11,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:11,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:11,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1175 states have (on average 1.4978723404255319) internal successors, (1760), 1175 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call 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,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1760 transitions. [2022-02-20 18:58:11,649 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1760 transitions. Word has length 103 [2022-02-20 18:58:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:11,650 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 1760 transitions. [2022-02-20 18:58:11,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 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:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1760 transitions. [2022-02-20 18:58:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-20 18:58:11,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:11,651 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:11,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:58:11,652 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:11,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1797210952, now seen corresponding path program 1 times [2022-02-20 18:58:11,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:11,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508389478] [2022-02-20 18:58:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:11,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {16592#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_1528~0 := 0;~__return_1653~0 := 0; {16592#true} is VALID [2022-02-20 18:58:11,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {16592#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_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#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_~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; {16592#true} is VALID [2022-02-20 18:58:11,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {16592#true} assume !!(0 == main_~init__r121~0#1 % 256); {16592#true} is VALID [2022-02-20 18:58:11,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {16592#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {16592#true} is VALID [2022-02-20 18:58:11,704 INFO L290 TraceCheckUtils]: 4: Hoare triple {16592#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {16592#true} is VALID [2022-02-20 18:58:11,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {16592#true} assume !!(0 == main_~init__r131~0#1 % 256); {16592#true} is VALID [2022-02-20 18:58:11,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {16592#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {16592#true} is VALID [2022-02-20 18:58:11,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {16592#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {16592#true} is VALID [2022-02-20 18:58:11,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {16592#true} assume !!(0 == main_~init__r211~0#1 % 256); {16592#true} is VALID [2022-02-20 18:58:11,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {16592#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {16594#(= (+ |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:11,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {16594#(= (+ |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); {16594#(= (+ |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:11,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {16594#(= (+ |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; {16593#false} is VALID [2022-02-20 18:58:11,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {16593#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {16593#false} is VALID [2022-02-20 18:58:11,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {16593#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {16593#false} is VALID [2022-02-20 18:58:11,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {16593#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {16593#false} is VALID [2022-02-20 18:58:11,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {16593#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {16593#false} is VALID [2022-02-20 18:58:11,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {16593#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {16593#false} is VALID [2022-02-20 18:58:11,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {16593#false} assume ~id1~0 != ~id2~0; {16593#false} is VALID [2022-02-20 18:58:11,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {16593#false} assume ~id1~0 != ~id3~0; {16593#false} is VALID [2022-02-20 18:58:11,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {16593#false} assume ~id2~0 != ~id3~0; {16593#false} is VALID [2022-02-20 18:58:11,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {16593#false} assume ~id1~0 >= 0; {16593#false} is VALID [2022-02-20 18:58:11,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {16593#false} assume ~id2~0 >= 0; {16593#false} is VALID [2022-02-20 18:58:11,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {16593#false} assume ~id3~0 >= 0; {16593#false} is VALID [2022-02-20 18:58:11,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {16593#false} assume 0 == ~r1~0 % 256; {16593#false} is VALID [2022-02-20 18:58:11,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {16593#false} assume 0 == ~r2~0 % 256; {16593#false} is VALID [2022-02-20 18:58:11,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {16593#false} assume 0 == ~r3~0 % 256; {16593#false} is VALID [2022-02-20 18:58:11,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {16593#false} assume !(0 == main_~init__r122~0#1 % 256); {16593#false} is VALID [2022-02-20 18:58:11,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {16593#false} assume !(0 == main_~init__r132~0#1 % 256); {16593#false} is VALID [2022-02-20 18:58:11,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {16593#false} assume !(0 == main_~init__r212~0#1 % 256); {16593#false} is VALID [2022-02-20 18:58:11,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {16593#false} assume !(0 == main_~init__r232~0#1 % 256); {16593#false} is VALID [2022-02-20 18:58:11,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {16593#false} assume !(0 == main_~init__r312~0#1 % 256); {16593#false} is VALID [2022-02-20 18:58:11,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {16593#false} assume !(0 == main_~init__r322~0#1 % 256); {16593#false} is VALID [2022-02-20 18:58:11,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {16593#false} assume ~max1~0 == ~id1~0; {16593#false} is VALID [2022-02-20 18:58:11,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {16593#false} assume ~max2~0 == ~id2~0; {16593#false} is VALID [2022-02-20 18:58:11,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {16593#false} assume ~max3~0 == ~id3~0; {16593#false} is VALID [2022-02-20 18:58:11,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {16593#false} assume 0 == ~st1~0; {16593#false} is VALID [2022-02-20 18:58:11,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {16593#false} assume 0 == ~st2~0; {16593#false} is VALID [2022-02-20 18:58:11,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {16593#false} assume 0 == ~st3~0; {16593#false} is VALID [2022-02-20 18:58:11,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {16593#false} assume 0 == ~nl1~0; {16593#false} is VALID [2022-02-20 18:58:11,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {16593#false} assume 0 == ~nl2~0; {16593#false} is VALID [2022-02-20 18:58:11,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {16593#false} assume 0 == ~nl3~0; {16593#false} is VALID [2022-02-20 18:58:11,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {16593#false} assume 0 == ~mode1~0 % 256; {16593#false} is VALID [2022-02-20 18:58:11,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {16593#false} assume 0 == ~mode2~0 % 256; {16593#false} is VALID [2022-02-20 18:58:11,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {16593#false} assume 0 == ~mode3~0 % 256; {16593#false} is VALID [2022-02-20 18:58:11,712 INFO L290 TraceCheckUtils]: 44: Hoare triple {16593#false} assume !(0 == ~newmax1~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {16593#false} assume !(0 == ~newmax2~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {16593#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; {16593#false} is VALID [2022-02-20 18:58:11,713 INFO L290 TraceCheckUtils]: 47: Hoare triple {16593#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; {16593#false} is VALID [2022-02-20 18:58:11,713 INFO L290 TraceCheckUtils]: 48: Hoare triple {16593#false} assume !!(0 == ~mode1~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {16593#false} assume ~r1~0 % 256 < 2; {16593#false} is VALID [2022-02-20 18:58:11,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {16593#false} assume !!(0 == ~ep12~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {16593#false} assume !!(0 == ~ep13~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,713 INFO L290 TraceCheckUtils]: 52: Hoare triple {16593#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {16593#false} is VALID [2022-02-20 18:58:11,713 INFO L290 TraceCheckUtils]: 53: Hoare triple {16593#false} assume !!(0 == ~mode2~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {16593#false} assume ~r2~0 % 256 < 2; {16593#false} is VALID [2022-02-20 18:58:11,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {16593#false} assume !!(0 == ~ep21~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {16593#false} assume !!(0 == ~ep23~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {16593#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {16593#false} is VALID [2022-02-20 18:58:11,714 INFO L290 TraceCheckUtils]: 58: Hoare triple {16593#false} assume !!(0 == ~mode3~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,714 INFO L290 TraceCheckUtils]: 59: Hoare triple {16593#false} assume ~r3~0 % 256 < 2; {16593#false} is VALID [2022-02-20 18:58:11,714 INFO L290 TraceCheckUtils]: 60: Hoare triple {16593#false} assume !!(0 == ~ep31~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,714 INFO L290 TraceCheckUtils]: 61: Hoare triple {16593#false} assume !!(0 == ~ep32~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {16593#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; {16593#false} is VALID [2022-02-20 18:58:11,715 INFO L290 TraceCheckUtils]: 63: Hoare triple {16593#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16593#false} is VALID [2022-02-20 18:58:11,715 INFO L290 TraceCheckUtils]: 64: Hoare triple {16593#false} assume ~st1~0 + ~nl1~0 <= 1; {16593#false} is VALID [2022-02-20 18:58:11,715 INFO L290 TraceCheckUtils]: 65: Hoare triple {16593#false} assume ~st2~0 + ~nl2~0 <= 1; {16593#false} is VALID [2022-02-20 18:58:11,715 INFO L290 TraceCheckUtils]: 66: Hoare triple {16593#false} assume ~st3~0 + ~nl3~0 <= 1; {16593#false} is VALID [2022-02-20 18:58:11,715 INFO L290 TraceCheckUtils]: 67: Hoare triple {16593#false} assume !(~r1~0 % 256 >= 2); {16593#false} is VALID [2022-02-20 18:58:11,715 INFO L290 TraceCheckUtils]: 68: Hoare triple {16593#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {16593#false} is VALID [2022-02-20 18:58:11,715 INFO L290 TraceCheckUtils]: 69: Hoare triple {16593#false} assume ~r1~0 % 256 < 2; {16593#false} is VALID [2022-02-20 18:58:11,715 INFO L290 TraceCheckUtils]: 70: Hoare triple {16593#false} assume !(~r1~0 % 256 >= 2); {16593#false} is VALID [2022-02-20 18:58:11,716 INFO L290 TraceCheckUtils]: 71: Hoare triple {16593#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {16593#false} is VALID [2022-02-20 18:58:11,716 INFO L290 TraceCheckUtils]: 72: Hoare triple {16593#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; {16593#false} is VALID [2022-02-20 18:58:11,716 INFO L290 TraceCheckUtils]: 73: Hoare triple {16593#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {16593#false} is VALID [2022-02-20 18:58:11,716 INFO L290 TraceCheckUtils]: 74: Hoare triple {16593#false} assume !(0 == ~mode1~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,716 INFO L290 TraceCheckUtils]: 75: Hoare triple {16593#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {16593#false} is VALID [2022-02-20 18:58:11,716 INFO L290 TraceCheckUtils]: 76: Hoare triple {16593#false} assume !!(0 == ~ep21~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,716 INFO L290 TraceCheckUtils]: 77: Hoare triple {16593#false} assume !!(0 == ~ep31~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {16593#false} ~newmax1~0 := main_~node1__newmax~1#1; {16593#false} is VALID [2022-02-20 18:58:11,717 INFO L290 TraceCheckUtils]: 79: Hoare triple {16593#false} assume 1 == ~r1~0 % 256; {16593#false} is VALID [2022-02-20 18:58:11,717 INFO L290 TraceCheckUtils]: 80: Hoare triple {16593#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {16593#false} is VALID [2022-02-20 18:58:11,717 INFO L290 TraceCheckUtils]: 81: Hoare triple {16593#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {16593#false} is VALID [2022-02-20 18:58:11,717 INFO L290 TraceCheckUtils]: 82: Hoare triple {16593#false} assume !(0 == ~mode2~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,717 INFO L290 TraceCheckUtils]: 83: Hoare triple {16593#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {16593#false} is VALID [2022-02-20 18:58:11,717 INFO L290 TraceCheckUtils]: 84: Hoare triple {16593#false} assume !!(0 == ~ep12~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,717 INFO L290 TraceCheckUtils]: 85: Hoare triple {16593#false} assume !!(0 == ~ep32~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,717 INFO L290 TraceCheckUtils]: 86: Hoare triple {16593#false} ~newmax2~0 := main_~node2__newmax~1#1; {16593#false} is VALID [2022-02-20 18:58:11,722 INFO L290 TraceCheckUtils]: 87: Hoare triple {16593#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {16593#false} is VALID [2022-02-20 18:58:11,722 INFO L290 TraceCheckUtils]: 88: Hoare triple {16593#false} assume !(0 == ~mode3~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,722 INFO L290 TraceCheckUtils]: 89: Hoare triple {16593#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {16593#false} is VALID [2022-02-20 18:58:11,722 INFO L290 TraceCheckUtils]: 90: Hoare triple {16593#false} assume !!(0 == ~ep13~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,722 INFO L290 TraceCheckUtils]: 91: Hoare triple {16593#false} assume !!(0 == ~ep23~0 % 256); {16593#false} is VALID [2022-02-20 18:58:11,722 INFO L290 TraceCheckUtils]: 92: Hoare triple {16593#false} ~newmax3~0 := main_~node3__newmax~1#1; {16593#false} is VALID [2022-02-20 18:58:11,722 INFO L290 TraceCheckUtils]: 93: Hoare triple {16593#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; {16593#false} is VALID [2022-02-20 18:58:11,722 INFO L290 TraceCheckUtils]: 94: Hoare triple {16593#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16593#false} is VALID [2022-02-20 18:58:11,723 INFO L290 TraceCheckUtils]: 95: Hoare triple {16593#false} assume ~st1~0 + ~nl1~0 <= 1; {16593#false} is VALID [2022-02-20 18:58:11,723 INFO L290 TraceCheckUtils]: 96: Hoare triple {16593#false} assume ~st2~0 + ~nl2~0 <= 1; {16593#false} is VALID [2022-02-20 18:58:11,723 INFO L290 TraceCheckUtils]: 97: Hoare triple {16593#false} assume ~st3~0 + ~nl3~0 <= 1; {16593#false} is VALID [2022-02-20 18:58:11,723 INFO L290 TraceCheckUtils]: 98: Hoare triple {16593#false} assume !(~r1~0 % 256 >= 2); {16593#false} is VALID [2022-02-20 18:58:11,723 INFO L290 TraceCheckUtils]: 99: Hoare triple {16593#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {16593#false} is VALID [2022-02-20 18:58:11,723 INFO L290 TraceCheckUtils]: 100: Hoare triple {16593#false} ~__return_1528~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1528~0; {16593#false} is VALID [2022-02-20 18:58:11,723 INFO L290 TraceCheckUtils]: 101: Hoare triple {16593#false} 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; {16593#false} is VALID [2022-02-20 18:58:11,723 INFO L290 TraceCheckUtils]: 102: Hoare triple {16593#false} assume 0 == main_~assert__arg~1#1 % 256; {16593#false} is VALID [2022-02-20 18:58:11,723 INFO L290 TraceCheckUtils]: 103: Hoare triple {16593#false} assume !false; {16593#false} is VALID [2022-02-20 18:58:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:11,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:11,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508389478] [2022-02-20 18:58:11,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508389478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:11,724 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:11,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:11,724 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573028069] [2022-02-20 18:58:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:11,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:11,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:11,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:11,788 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:11,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:11,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:11,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:11,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:11,789 INFO L87 Difference]: Start difference. First operand 1176 states and 1760 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:13,171 INFO L93 Difference]: Finished difference Result 3452 states and 5160 transitions. [2022-02-20 18:58:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:13,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2022-02-20 18:58:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2022-02-20 18:58:13,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1028 transitions. [2022-02-20 18:58:13,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1028 edges. 1028 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:13,959 INFO L225 Difference]: With dead ends: 3452 [2022-02-20 18:58:13,959 INFO L226 Difference]: Without dead ends: 2320 [2022-02-20 18:58:13,960 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:13,961 INFO L933 BasicCegarLoop]: 694 mSDtfsCounter, 336 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1046 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:13,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 1046 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:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2022-02-20 18:58:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 1180. [2022-02-20 18:58:14,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:14,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2320 states. Second operand has 1180 states, 1179 states have (on average 1.4961832061068703) internal successors, (1764), 1179 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call 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,190 INFO L74 IsIncluded]: Start isIncluded. First operand 2320 states. Second operand has 1180 states, 1179 states have (on average 1.4961832061068703) internal successors, (1764), 1179 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call 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,192 INFO L87 Difference]: Start difference. First operand 2320 states. Second operand has 1180 states, 1179 states have (on average 1.4961832061068703) internal successors, (1764), 1179 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call 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,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:14,336 INFO L93 Difference]: Finished difference Result 2320 states and 3467 transitions. [2022-02-20 18:58:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3467 transitions. [2022-02-20 18:58:14,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:14,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:14,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 1180 states, 1179 states have (on average 1.4961832061068703) internal successors, (1764), 1179 states have internal predecessors, (1764), 0 states have call successors, (0), 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 2320 states. [2022-02-20 18:58:14,343 INFO L87 Difference]: Start difference. First operand has 1180 states, 1179 states have (on average 1.4961832061068703) internal successors, (1764), 1179 states have internal predecessors, (1764), 0 states have call successors, (0), 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 2320 states. [2022-02-20 18:58:14,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:14,491 INFO L93 Difference]: Finished difference Result 2320 states and 3467 transitions. [2022-02-20 18:58:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3467 transitions. [2022-02-20 18:58:14,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:14,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:14,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:14,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1179 states have (on average 1.4961832061068703) internal successors, (1764), 1179 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call 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,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1764 transitions. [2022-02-20 18:58:14,561 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1764 transitions. Word has length 104 [2022-02-20 18:58:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:14,562 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1764 transitions. [2022-02-20 18:58:14,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1764 transitions. [2022-02-20 18:58:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:58:14,564 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:14,564 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] [2022-02-20 18:58:14,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:58:14,564 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:14,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash 978474865, now seen corresponding path program 1 times [2022-02-20 18:58:14,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:14,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682085382] [2022-02-20 18:58:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:14,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {27361#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_1528~0 := 0;~__return_1653~0 := 0; {27361#true} is VALID [2022-02-20 18:58:14,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {27361#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_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#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_~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; {27361#true} is VALID [2022-02-20 18:58:14,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {27361#true} assume !!(0 == main_~init__r121~0#1 % 256); {27361#true} is VALID [2022-02-20 18:58:14,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {27361#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {27361#true} is VALID [2022-02-20 18:58:14,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {27361#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {27361#true} is VALID [2022-02-20 18:58:14,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {27361#true} assume !!(0 == main_~init__r131~0#1 % 256); {27361#true} is VALID [2022-02-20 18:58:14,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {27361#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {27361#true} is VALID [2022-02-20 18:58:14,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {27361#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {27361#true} is VALID [2022-02-20 18:58:14,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {27361#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {27361#true} is VALID [2022-02-20 18:58:14,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {27361#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {27361#true} is VALID [2022-02-20 18:58:14,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {27361#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {27361#true} is VALID [2022-02-20 18:58:14,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {27361#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {27361#true} is VALID [2022-02-20 18:58:14,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {27361#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {27361#true} is VALID [2022-02-20 18:58:14,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {27361#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {27361#true} is VALID [2022-02-20 18:58:14,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {27361#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {27361#true} is VALID [2022-02-20 18:58:14,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {27361#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {27361#true} is VALID [2022-02-20 18:58:14,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {27361#true} assume ~id1~0 != ~id2~0; {27361#true} is VALID [2022-02-20 18:58:14,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {27361#true} assume ~id1~0 != ~id3~0; {27361#true} is VALID [2022-02-20 18:58:14,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {27361#true} assume ~id2~0 != ~id3~0; {27361#true} is VALID [2022-02-20 18:58:14,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {27361#true} assume ~id1~0 >= 0; {27361#true} is VALID [2022-02-20 18:58:14,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {27361#true} assume ~id2~0 >= 0; {27361#true} is VALID [2022-02-20 18:58:14,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {27361#true} assume ~id3~0 >= 0; {27361#true} is VALID [2022-02-20 18:58:14,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {27361#true} assume 0 == ~r1~0 % 256; {27361#true} is VALID [2022-02-20 18:58:14,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {27361#true} assume 0 == ~r2~0 % 256; {27361#true} is VALID [2022-02-20 18:58:14,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {27361#true} assume 0 == ~r3~0 % 256; {27361#true} is VALID [2022-02-20 18:58:14,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {27361#true} assume !(0 == main_~init__r122~0#1 % 256); {27361#true} is VALID [2022-02-20 18:58:14,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {27361#true} assume !(0 == main_~init__r132~0#1 % 256); {27361#true} is VALID [2022-02-20 18:58:14,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {27361#true} assume !(0 == main_~init__r212~0#1 % 256); {27361#true} is VALID [2022-02-20 18:58:14,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {27361#true} assume !(0 == main_~init__r232~0#1 % 256); {27361#true} is VALID [2022-02-20 18:58:14,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {27361#true} assume !(0 == main_~init__r312~0#1 % 256); {27361#true} is VALID [2022-02-20 18:58:14,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {27361#true} assume !(0 == main_~init__r322~0#1 % 256); {27361#true} is VALID [2022-02-20 18:58:14,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {27361#true} assume ~max1~0 == ~id1~0; {27361#true} is VALID [2022-02-20 18:58:14,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {27361#true} assume ~max2~0 == ~id2~0; {27361#true} is VALID [2022-02-20 18:58:14,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {27361#true} assume ~max3~0 == ~id3~0; {27361#true} is VALID [2022-02-20 18:58:14,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {27361#true} assume 0 == ~st1~0; {27361#true} is VALID [2022-02-20 18:58:14,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {27361#true} assume 0 == ~st2~0; {27361#true} is VALID [2022-02-20 18:58:14,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {27361#true} assume 0 == ~st3~0; {27361#true} is VALID [2022-02-20 18:58:14,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {27361#true} assume 0 == ~nl1~0; {27361#true} is VALID [2022-02-20 18:58:14,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {27361#true} assume 0 == ~nl2~0; {27361#true} is VALID [2022-02-20 18:58:14,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {27361#true} assume 0 == ~nl3~0; {27361#true} is VALID [2022-02-20 18:58:14,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {27361#true} assume 0 == ~mode1~0 % 256; {27361#true} is VALID [2022-02-20 18:58:14,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {27361#true} assume 0 == ~mode2~0 % 256; {27361#true} is VALID [2022-02-20 18:58:14,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {27361#true} assume 0 == ~mode3~0 % 256; {27361#true} is VALID [2022-02-20 18:58:14,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {27361#true} assume !(0 == ~newmax1~0 % 256); {27361#true} is VALID [2022-02-20 18:58:14,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {27361#true} assume !(0 == ~newmax2~0 % 256); {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} is VALID [2022-02-20 18:58:14,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~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; {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} is VALID [2022-02-20 18:58:14,624 INFO L290 TraceCheckUtils]: 46: Hoare triple {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~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; {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} is VALID [2022-02-20 18:58:14,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} assume !!(0 == ~mode1~0 % 256); {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} is VALID [2022-02-20 18:58:14,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} assume ~r1~0 % 256 < 2; {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} is VALID [2022-02-20 18:58:14,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} assume !!(0 == ~ep12~0 % 256); {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} is VALID [2022-02-20 18:58:14,625 INFO L290 TraceCheckUtils]: 50: Hoare triple {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} assume !!(0 == ~ep13~0 % 256); {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} is VALID [2022-02-20 18:58:14,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} is VALID [2022-02-20 18:58:14,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} assume !!(0 == ~mode2~0 % 256); {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} is VALID [2022-02-20 18:58:14,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} assume ~r2~0 % 256 < 2; {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} is VALID [2022-02-20 18:58:14,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} assume !(0 == ~ep21~0 % 256); {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} is VALID [2022-02-20 18:58:14,627 INFO L290 TraceCheckUtils]: 55: Hoare triple {27363#(not (= (+ (* (- 256) (div ~newmax2~0 256)) ~newmax2~0) 0))} assume !!(0 == ~newmax2~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,627 INFO L290 TraceCheckUtils]: 56: Hoare triple {27362#false} assume !!(0 == ~ep23~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,627 INFO L290 TraceCheckUtils]: 57: Hoare triple {27362#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {27362#false} is VALID [2022-02-20 18:58:14,627 INFO L290 TraceCheckUtils]: 58: Hoare triple {27362#false} assume !!(0 == ~mode3~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,627 INFO L290 TraceCheckUtils]: 59: Hoare triple {27362#false} assume ~r3~0 % 256 < 2; {27362#false} is VALID [2022-02-20 18:58:14,627 INFO L290 TraceCheckUtils]: 60: Hoare triple {27362#false} assume !!(0 == ~ep31~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {27362#false} assume !!(0 == ~ep32~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {27362#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; {27362#false} is VALID [2022-02-20 18:58:14,628 INFO L290 TraceCheckUtils]: 63: Hoare triple {27362#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {27362#false} is VALID [2022-02-20 18:58:14,628 INFO L290 TraceCheckUtils]: 64: Hoare triple {27362#false} assume ~st1~0 + ~nl1~0 <= 1; {27362#false} is VALID [2022-02-20 18:58:14,628 INFO L290 TraceCheckUtils]: 65: Hoare triple {27362#false} assume ~st2~0 + ~nl2~0 <= 1; {27362#false} is VALID [2022-02-20 18:58:14,628 INFO L290 TraceCheckUtils]: 66: Hoare triple {27362#false} assume ~st3~0 + ~nl3~0 <= 1; {27362#false} is VALID [2022-02-20 18:58:14,628 INFO L290 TraceCheckUtils]: 67: Hoare triple {27362#false} assume !(~r1~0 % 256 >= 2); {27362#false} is VALID [2022-02-20 18:58:14,628 INFO L290 TraceCheckUtils]: 68: Hoare triple {27362#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {27362#false} is VALID [2022-02-20 18:58:14,628 INFO L290 TraceCheckUtils]: 69: Hoare triple {27362#false} assume ~r1~0 % 256 < 2; {27362#false} is VALID [2022-02-20 18:58:14,628 INFO L290 TraceCheckUtils]: 70: Hoare triple {27362#false} assume !(~r1~0 % 256 >= 2); {27362#false} is VALID [2022-02-20 18:58:14,628 INFO L290 TraceCheckUtils]: 71: Hoare triple {27362#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {27362#false} is VALID [2022-02-20 18:58:14,629 INFO L290 TraceCheckUtils]: 72: Hoare triple {27362#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; {27362#false} is VALID [2022-02-20 18:58:14,629 INFO L290 TraceCheckUtils]: 73: Hoare triple {27362#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {27362#false} is VALID [2022-02-20 18:58:14,629 INFO L290 TraceCheckUtils]: 74: Hoare triple {27362#false} assume !(0 == ~mode1~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,629 INFO L290 TraceCheckUtils]: 75: Hoare triple {27362#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {27362#false} is VALID [2022-02-20 18:58:14,629 INFO L290 TraceCheckUtils]: 76: Hoare triple {27362#false} assume !(0 == ~ep21~0 % 256);~m1~0 := ~p21_old~0;~p21_old~0 := ~nomsg~0; {27362#false} is VALID [2022-02-20 18:58:14,629 INFO L290 TraceCheckUtils]: 77: Hoare triple {27362#false} assume !(~m1~0 > ~max1~0); {27362#false} is VALID [2022-02-20 18:58:14,629 INFO L290 TraceCheckUtils]: 78: Hoare triple {27362#false} assume !!(0 == ~ep31~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,629 INFO L290 TraceCheckUtils]: 79: Hoare triple {27362#false} ~newmax1~0 := main_~node1__newmax~1#1; {27362#false} is VALID [2022-02-20 18:58:14,629 INFO L290 TraceCheckUtils]: 80: Hoare triple {27362#false} assume 1 == ~r1~0 % 256; {27362#false} is VALID [2022-02-20 18:58:14,630 INFO L290 TraceCheckUtils]: 81: Hoare triple {27362#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {27362#false} is VALID [2022-02-20 18:58:14,630 INFO L290 TraceCheckUtils]: 82: Hoare triple {27362#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {27362#false} is VALID [2022-02-20 18:58:14,630 INFO L290 TraceCheckUtils]: 83: Hoare triple {27362#false} assume !(0 == ~mode2~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,630 INFO L290 TraceCheckUtils]: 84: Hoare triple {27362#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {27362#false} is VALID [2022-02-20 18:58:14,630 INFO L290 TraceCheckUtils]: 85: Hoare triple {27362#false} assume !!(0 == ~ep12~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,630 INFO L290 TraceCheckUtils]: 86: Hoare triple {27362#false} assume !!(0 == ~ep32~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,630 INFO L290 TraceCheckUtils]: 87: Hoare triple {27362#false} ~newmax2~0 := main_~node2__newmax~1#1; {27362#false} is VALID [2022-02-20 18:58:14,630 INFO L290 TraceCheckUtils]: 88: Hoare triple {27362#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {27362#false} is VALID [2022-02-20 18:58:14,630 INFO L290 TraceCheckUtils]: 89: Hoare triple {27362#false} assume !(0 == ~mode3~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,631 INFO L290 TraceCheckUtils]: 90: Hoare triple {27362#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {27362#false} is VALID [2022-02-20 18:58:14,631 INFO L290 TraceCheckUtils]: 91: Hoare triple {27362#false} assume !!(0 == ~ep13~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,631 INFO L290 TraceCheckUtils]: 92: Hoare triple {27362#false} assume !!(0 == ~ep23~0 % 256); {27362#false} is VALID [2022-02-20 18:58:14,631 INFO L290 TraceCheckUtils]: 93: Hoare triple {27362#false} ~newmax3~0 := main_~node3__newmax~1#1; {27362#false} is VALID [2022-02-20 18:58:14,631 INFO L290 TraceCheckUtils]: 94: Hoare triple {27362#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; {27362#false} is VALID [2022-02-20 18:58:14,631 INFO L290 TraceCheckUtils]: 95: Hoare triple {27362#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {27362#false} is VALID [2022-02-20 18:58:14,631 INFO L290 TraceCheckUtils]: 96: Hoare triple {27362#false} assume ~st1~0 + ~nl1~0 <= 1; {27362#false} is VALID [2022-02-20 18:58:14,631 INFO L290 TraceCheckUtils]: 97: Hoare triple {27362#false} assume ~st2~0 + ~nl2~0 <= 1; {27362#false} is VALID [2022-02-20 18:58:14,631 INFO L290 TraceCheckUtils]: 98: Hoare triple {27362#false} assume ~st3~0 + ~nl3~0 <= 1; {27362#false} is VALID [2022-02-20 18:58:14,632 INFO L290 TraceCheckUtils]: 99: Hoare triple {27362#false} assume !(~r1~0 % 256 >= 2); {27362#false} is VALID [2022-02-20 18:58:14,632 INFO L290 TraceCheckUtils]: 100: Hoare triple {27362#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {27362#false} is VALID [2022-02-20 18:58:14,632 INFO L290 TraceCheckUtils]: 101: Hoare triple {27362#false} ~__return_1528~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1528~0; {27362#false} is VALID [2022-02-20 18:58:14,632 INFO L290 TraceCheckUtils]: 102: Hoare triple {27362#false} 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; {27362#false} is VALID [2022-02-20 18:58:14,632 INFO L290 TraceCheckUtils]: 103: Hoare triple {27362#false} assume 0 == main_~assert__arg~1#1 % 256; {27362#false} is VALID [2022-02-20 18:58:14,632 INFO L290 TraceCheckUtils]: 104: Hoare triple {27362#false} assume !false; {27362#false} is VALID [2022-02-20 18:58:14,633 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,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:14,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682085382] [2022-02-20 18:58:14,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682085382] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:14,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:14,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:14,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419751749] [2022-02-20 18:58:14,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:14,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:58:14,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:14,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:14,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:14,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:14,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:14,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:14,691 INFO L87 Difference]: Start difference. First operand 1180 states and 1764 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:15,702 INFO L93 Difference]: Finished difference Result 2640 states and 4114 transitions. [2022-02-20 18:58:15,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:15,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:58:15,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2022-02-20 18:58:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2022-02-20 18:58:15,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 755 transitions. [2022-02-20 18:58:16,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 755 edges. 755 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:16,247 INFO L225 Difference]: With dead ends: 2640 [2022-02-20 18:58:16,248 INFO L226 Difference]: Without dead ends: 1744 [2022-02-20 18:58:16,249 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:16,250 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 241 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 729 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:16,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 729 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:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2022-02-20 18:58:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1690. [2022-02-20 18:58:16,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:16,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1744 states. Second operand has 1690 states, 1689 states have (on average 1.5429248075784487) internal successors, (2606), 1689 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call 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,629 INFO L74 IsIncluded]: Start isIncluded. First operand 1744 states. Second operand has 1690 states, 1689 states have (on average 1.5429248075784487) internal successors, (2606), 1689 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call 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,631 INFO L87 Difference]: Start difference. First operand 1744 states. Second operand has 1690 states, 1689 states have (on average 1.5429248075784487) internal successors, (2606), 1689 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call 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,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:16,716 INFO L93 Difference]: Finished difference Result 1744 states and 2691 transitions. [2022-02-20 18:58:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2691 transitions. [2022-02-20 18:58:16,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:16,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:16,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 1690 states, 1689 states have (on average 1.5429248075784487) internal successors, (2606), 1689 states have internal predecessors, (2606), 0 states have call successors, (0), 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 1744 states. [2022-02-20 18:58:16,721 INFO L87 Difference]: Start difference. First operand has 1690 states, 1689 states have (on average 1.5429248075784487) internal successors, (2606), 1689 states have internal predecessors, (2606), 0 states have call successors, (0), 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 1744 states. [2022-02-20 18:58:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:16,807 INFO L93 Difference]: Finished difference Result 1744 states and 2691 transitions. [2022-02-20 18:58:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2691 transitions. [2022-02-20 18:58:16,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:16,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:16,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:16,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1689 states have (on average 1.5429248075784487) internal successors, (2606), 1689 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call 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,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2606 transitions. [2022-02-20 18:58:16,924 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2606 transitions. Word has length 105 [2022-02-20 18:58:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:16,925 INFO L470 AbstractCegarLoop]: Abstraction has 1690 states and 2606 transitions. [2022-02-20 18:58:16,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2606 transitions. [2022-02-20 18:58:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:58:16,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:16,926 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] [2022-02-20 18:58:16,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:58:16,926 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:16,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1850549439, now seen corresponding path program 1 times [2022-02-20 18:58:16,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:16,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773596267] [2022-02-20 18:58:16,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:16,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {36700#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_1528~0 := 0;~__return_1653~0 := 0; {36700#true} is VALID [2022-02-20 18:58:16,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {36700#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_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#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_~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; {36700#true} is VALID [2022-02-20 18:58:16,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {36700#true} assume !!(0 == main_~init__r121~0#1 % 256); {36700#true} is VALID [2022-02-20 18:58:16,974 INFO L290 TraceCheckUtils]: 3: Hoare triple {36700#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {36700#true} is VALID [2022-02-20 18:58:16,974 INFO L290 TraceCheckUtils]: 4: Hoare triple {36700#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {36700#true} is VALID [2022-02-20 18:58:16,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {36700#true} assume !!(0 == main_~init__r131~0#1 % 256); {36700#true} is VALID [2022-02-20 18:58:16,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {36700#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {36700#true} is VALID [2022-02-20 18:58:16,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {36700#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {36700#true} is VALID [2022-02-20 18:58:16,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {36700#true} assume !!(0 == main_~init__r211~0#1 % 256); {36700#true} is VALID [2022-02-20 18:58:16,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {36700#true} assume !(0 == main_~init__r231~0#1 % 256); {36700#true} is VALID [2022-02-20 18:58:16,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {36700#true} assume !(0 == ~ep31~0 % 256);main_~init__tmp___1~0#1 := 1; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~id1~0 != ~id2~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~id1~0 != ~id3~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~id2~0 != ~id3~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~id1~0 >= 0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~id2~0 >= 0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~id3~0 >= 0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~r1~0 % 256; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~r2~0 % 256; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~r3~0 % 256; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !(0 == main_~init__r122~0#1 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !(0 == main_~init__r132~0#1 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !(0 == main_~init__r212~0#1 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !(0 == main_~init__r232~0#1 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !(0 == main_~init__r312~0#1 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !(0 == main_~init__r322~0#1 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~max1~0 == ~id1~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~max2~0 == ~id2~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~max3~0 == ~id3~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~st1~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~st2~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~st3~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~nl1~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~nl2~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~nl3~0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~mode1~0 % 256; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~mode2~0 % 256; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 == ~mode3~0 % 256; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !(0 == ~newmax1~0 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !(0 == ~newmax2~0 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 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; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !!(0 == ~mode1~0 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~r1~0 % 256 < 2; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,989 INFO L290 TraceCheckUtils]: 51: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !!(0 == ~ep12~0 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !!(0 == ~ep13~0 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !!(0 == ~mode2~0 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~r2~0 % 256 < 2; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !!(0 == ~ep21~0 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !!(0 == ~ep23~0 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,991 INFO L290 TraceCheckUtils]: 59: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !!(0 == ~mode3~0 % 256); {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,991 INFO L290 TraceCheckUtils]: 60: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume ~r3~0 % 256 < 2; {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} is VALID [2022-02-20 18:58:16,992 INFO L290 TraceCheckUtils]: 61: Hoare triple {36702#(not (= (+ ~ep31~0 (* (- 256) (div ~ep31~0 256))) 0))} assume !!(0 == ~ep31~0 % 256); {36701#false} is VALID [2022-02-20 18:58:16,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {36701#false} assume !!(0 == ~ep32~0 % 256); {36701#false} is VALID [2022-02-20 18:58:16,992 INFO L290 TraceCheckUtils]: 63: Hoare triple {36701#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; {36701#false} is VALID [2022-02-20 18:58:16,992 INFO L290 TraceCheckUtils]: 64: Hoare triple {36701#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36701#false} is VALID [2022-02-20 18:58:16,992 INFO L290 TraceCheckUtils]: 65: Hoare triple {36701#false} assume ~st1~0 + ~nl1~0 <= 1; {36701#false} is VALID [2022-02-20 18:58:16,992 INFO L290 TraceCheckUtils]: 66: Hoare triple {36701#false} assume ~st2~0 + ~nl2~0 <= 1; {36701#false} is VALID [2022-02-20 18:58:16,993 INFO L290 TraceCheckUtils]: 67: Hoare triple {36701#false} assume ~st3~0 + ~nl3~0 <= 1; {36701#false} is VALID [2022-02-20 18:58:16,993 INFO L290 TraceCheckUtils]: 68: Hoare triple {36701#false} assume !(~r1~0 % 256 >= 2); {36701#false} is VALID [2022-02-20 18:58:16,993 INFO L290 TraceCheckUtils]: 69: Hoare triple {36701#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {36701#false} is VALID [2022-02-20 18:58:16,993 INFO L290 TraceCheckUtils]: 70: Hoare triple {36701#false} assume ~r1~0 % 256 < 2; {36701#false} is VALID [2022-02-20 18:58:16,993 INFO L290 TraceCheckUtils]: 71: Hoare triple {36701#false} assume !(~r1~0 % 256 >= 2); {36701#false} is VALID [2022-02-20 18:58:16,993 INFO L290 TraceCheckUtils]: 72: Hoare triple {36701#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {36701#false} is VALID [2022-02-20 18:58:16,993 INFO L290 TraceCheckUtils]: 73: Hoare triple {36701#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; {36701#false} is VALID [2022-02-20 18:58:16,993 INFO L290 TraceCheckUtils]: 74: Hoare triple {36701#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {36701#false} is VALID [2022-02-20 18:58:16,993 INFO L290 TraceCheckUtils]: 75: Hoare triple {36701#false} assume !(0 == ~mode1~0 % 256); {36701#false} is VALID [2022-02-20 18:58:16,994 INFO L290 TraceCheckUtils]: 76: Hoare triple {36701#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {36701#false} is VALID [2022-02-20 18:58:16,994 INFO L290 TraceCheckUtils]: 77: Hoare triple {36701#false} assume !!(0 == ~ep21~0 % 256); {36701#false} is VALID [2022-02-20 18:58:16,994 INFO L290 TraceCheckUtils]: 78: Hoare triple {36701#false} assume !!(0 == ~ep31~0 % 256); {36701#false} is VALID [2022-02-20 18:58:16,994 INFO L290 TraceCheckUtils]: 79: Hoare triple {36701#false} ~newmax1~0 := main_~node1__newmax~1#1; {36701#false} is VALID [2022-02-20 18:58:16,994 INFO L290 TraceCheckUtils]: 80: Hoare triple {36701#false} assume 1 == ~r1~0 % 256; {36701#false} is VALID [2022-02-20 18:58:16,994 INFO L290 TraceCheckUtils]: 81: Hoare triple {36701#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {36701#false} is VALID [2022-02-20 18:58:16,994 INFO L290 TraceCheckUtils]: 82: Hoare triple {36701#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {36701#false} is VALID [2022-02-20 18:58:16,994 INFO L290 TraceCheckUtils]: 83: Hoare triple {36701#false} assume !(0 == ~mode2~0 % 256); {36701#false} is VALID [2022-02-20 18:58:16,994 INFO L290 TraceCheckUtils]: 84: Hoare triple {36701#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {36701#false} is VALID [2022-02-20 18:58:16,995 INFO L290 TraceCheckUtils]: 85: Hoare triple {36701#false} assume !!(0 == ~ep12~0 % 256); {36701#false} is VALID [2022-02-20 18:58:16,995 INFO L290 TraceCheckUtils]: 86: Hoare triple {36701#false} assume !!(0 == ~ep32~0 % 256); {36701#false} is VALID [2022-02-20 18:58:16,995 INFO L290 TraceCheckUtils]: 87: Hoare triple {36701#false} ~newmax2~0 := main_~node2__newmax~1#1; {36701#false} is VALID [2022-02-20 18:58:16,995 INFO L290 TraceCheckUtils]: 88: Hoare triple {36701#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {36701#false} is VALID [2022-02-20 18:58:16,995 INFO L290 TraceCheckUtils]: 89: Hoare triple {36701#false} assume !(0 == ~mode3~0 % 256); {36701#false} is VALID [2022-02-20 18:58:16,995 INFO L290 TraceCheckUtils]: 90: Hoare triple {36701#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {36701#false} is VALID [2022-02-20 18:58:16,995 INFO L290 TraceCheckUtils]: 91: Hoare triple {36701#false} assume !!(0 == ~ep13~0 % 256); {36701#false} is VALID [2022-02-20 18:58:16,995 INFO L290 TraceCheckUtils]: 92: Hoare triple {36701#false} assume !!(0 == ~ep23~0 % 256); {36701#false} is VALID [2022-02-20 18:58:16,995 INFO L290 TraceCheckUtils]: 93: Hoare triple {36701#false} ~newmax3~0 := main_~node3__newmax~1#1; {36701#false} is VALID [2022-02-20 18:58:16,996 INFO L290 TraceCheckUtils]: 94: Hoare triple {36701#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; {36701#false} is VALID [2022-02-20 18:58:16,996 INFO L290 TraceCheckUtils]: 95: Hoare triple {36701#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36701#false} is VALID [2022-02-20 18:58:16,996 INFO L290 TraceCheckUtils]: 96: Hoare triple {36701#false} assume ~st1~0 + ~nl1~0 <= 1; {36701#false} is VALID [2022-02-20 18:58:16,996 INFO L290 TraceCheckUtils]: 97: Hoare triple {36701#false} assume ~st2~0 + ~nl2~0 <= 1; {36701#false} is VALID [2022-02-20 18:58:16,996 INFO L290 TraceCheckUtils]: 98: Hoare triple {36701#false} assume ~st3~0 + ~nl3~0 <= 1; {36701#false} is VALID [2022-02-20 18:58:16,996 INFO L290 TraceCheckUtils]: 99: Hoare triple {36701#false} assume !(~r1~0 % 256 >= 2); {36701#false} is VALID [2022-02-20 18:58:16,996 INFO L290 TraceCheckUtils]: 100: Hoare triple {36701#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {36701#false} is VALID [2022-02-20 18:58:16,996 INFO L290 TraceCheckUtils]: 101: Hoare triple {36701#false} ~__return_1528~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1528~0; {36701#false} is VALID [2022-02-20 18:58:16,996 INFO L290 TraceCheckUtils]: 102: Hoare triple {36701#false} 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; {36701#false} is VALID [2022-02-20 18:58:16,996 INFO L290 TraceCheckUtils]: 103: Hoare triple {36701#false} assume 0 == main_~assert__arg~1#1 % 256; {36701#false} is VALID [2022-02-20 18:58:16,997 INFO L290 TraceCheckUtils]: 104: Hoare triple {36701#false} assume !false; {36701#false} is VALID [2022-02-20 18:58:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:16,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:16,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773596267] [2022-02-20 18:58:16,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773596267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:16,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:16,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:16,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180504510] [2022-02-20 18:58:16,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:16,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:58:16,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:16,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:17,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:17,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:17,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:17,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:17,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:17,060 INFO L87 Difference]: Start difference. First operand 1690 states and 2606 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:19,014 INFO L93 Difference]: Finished difference Result 4594 states and 7162 transitions. [2022-02-20 18:58:19,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:19,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:58:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2022-02-20 18:58:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2022-02-20 18:58:19,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 906 transitions. [2022-02-20 18:58:19,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 906 edges. 906 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:19,903 INFO L225 Difference]: With dead ends: 4594 [2022-02-20 18:58:19,903 INFO L226 Difference]: Without dead ends: 3236 [2022-02-20 18:58:19,904 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:19,905 INFO L933 BasicCegarLoop]: 653 mSDtfsCounter, 280 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:19,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 980 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2022-02-20 18:58:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3234. [2022-02-20 18:58:20,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:20,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3236 states. Second operand has 3234 states, 3233 states have (on average 1.530467058459635) internal successors, (4948), 3233 states have internal predecessors, (4948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:20,595 INFO L74 IsIncluded]: Start isIncluded. First operand 3236 states. Second operand has 3234 states, 3233 states have (on average 1.530467058459635) internal successors, (4948), 3233 states have internal predecessors, (4948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:20,598 INFO L87 Difference]: Start difference. First operand 3236 states. Second operand has 3234 states, 3233 states have (on average 1.530467058459635) internal successors, (4948), 3233 states have internal predecessors, (4948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:20,911 INFO L93 Difference]: Finished difference Result 3236 states and 4949 transitions. [2022-02-20 18:58:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4949 transitions. [2022-02-20 18:58:20,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:20,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:20,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 3234 states, 3233 states have (on average 1.530467058459635) internal successors, (4948), 3233 states have internal predecessors, (4948), 0 states have call successors, (0), 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 3236 states. [2022-02-20 18:58:20,921 INFO L87 Difference]: Start difference. First operand has 3234 states, 3233 states have (on average 1.530467058459635) internal successors, (4948), 3233 states have internal predecessors, (4948), 0 states have call successors, (0), 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 3236 states. [2022-02-20 18:58:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:21,236 INFO L93 Difference]: Finished difference Result 3236 states and 4949 transitions. [2022-02-20 18:58:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4949 transitions. [2022-02-20 18:58:21,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:21,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:21,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:21,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3233 states have (on average 1.530467058459635) internal successors, (4948), 3233 states have internal predecessors, (4948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4948 transitions. [2022-02-20 18:58:21,675 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4948 transitions. Word has length 105 [2022-02-20 18:58:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:21,676 INFO L470 AbstractCegarLoop]: Abstraction has 3234 states and 4948 transitions. [2022-02-20 18:58:21,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4948 transitions. [2022-02-20 18:58:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:58:21,677 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:21,677 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] [2022-02-20 18:58:21,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:58:21,677 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash -417340030, now seen corresponding path program 1 times [2022-02-20 18:58:21,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:21,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268863504] [2022-02-20 18:58:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:21,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {53751#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_1528~0 := 0;~__return_1653~0 := 0; {53751#true} is VALID [2022-02-20 18:58:21,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {53751#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_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#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_~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; {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} is VALID [2022-02-20 18:58:21,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} is VALID [2022-02-20 18:58:21,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} is VALID [2022-02-20 18:58:21,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} is VALID [2022-02-20 18:58:21,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} is VALID [2022-02-20 18:58:21,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} is VALID [2022-02-20 18:58:21,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} is VALID [2022-02-20 18:58:21,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} is VALID [2022-02-20 18:58:21,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {53753#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 1) ~ep23~0)) 0)} assume !(0 == main_~init__r231~0#1 % 256); {53754#(and (< (* 256 (div |ULTIMATE.start_main_~init__r231~0#1| 256)) |ULTIMATE.start_main_~init__r231~0#1|) (= |ULTIMATE.start_main_~init__r231~0#1| ~ep23~0))} is VALID [2022-02-20 18:58:21,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {53754#(and (< (* 256 (div |ULTIMATE.start_main_~init__r231~0#1| 256)) |ULTIMATE.start_main_~init__r231~0#1|) (= |ULTIMATE.start_main_~init__r231~0#1| ~ep23~0))} assume !!(0 == ~ep31~0 % 256);main_~init__tmp___1~0#1 := 0; {53754#(and (< (* 256 (div |ULTIMATE.start_main_~init__r231~0#1| 256)) |ULTIMATE.start_main_~init__r231~0#1|) (= |ULTIMATE.start_main_~init__r231~0#1| ~ep23~0))} is VALID [2022-02-20 18:58:21,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {53754#(and (< (* 256 (div |ULTIMATE.start_main_~init__r231~0#1| 256)) |ULTIMATE.start_main_~init__r231~0#1|) (= |ULTIMATE.start_main_~init__r231~0#1| ~ep23~0))} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {53754#(and (< (* 256 (div |ULTIMATE.start_main_~init__r231~0#1| 256)) |ULTIMATE.start_main_~init__r231~0#1|) (= |ULTIMATE.start_main_~init__r231~0#1| ~ep23~0))} is VALID [2022-02-20 18:58:21,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {53754#(and (< (* 256 (div |ULTIMATE.start_main_~init__r231~0#1| 256)) |ULTIMATE.start_main_~init__r231~0#1|) (= |ULTIMATE.start_main_~init__r231~0#1| ~ep23~0))} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume ~id1~0 != ~id2~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume ~id1~0 != ~id3~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume ~id2~0 != ~id3~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume ~id1~0 >= 0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume ~id2~0 >= 0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume ~id3~0 >= 0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~r1~0 % 256; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~r2~0 % 256; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~r3~0 % 256; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !(0 == main_~init__r122~0#1 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !(0 == main_~init__r132~0#1 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !(0 == main_~init__r212~0#1 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !(0 == main_~init__r232~0#1 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !(0 == main_~init__r312~0#1 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !(0 == main_~init__r322~0#1 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume ~max1~0 == ~id1~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume ~max2~0 == ~id2~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume ~max3~0 == ~id3~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~st1~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~st2~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~st3~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~nl1~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~nl2~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~nl3~0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~mode1~0 % 256; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~mode2~0 % 256; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume 0 == ~mode3~0 % 256; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !(0 == ~newmax1~0 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !(0 == ~newmax2~0 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,795 INFO L290 TraceCheckUtils]: 47: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~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; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~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; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !!(0 == ~mode1~0 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume ~r1~0 % 256 < 2; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !!(0 == ~ep12~0 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,797 INFO L290 TraceCheckUtils]: 52: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !!(0 == ~ep13~0 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,798 INFO L290 TraceCheckUtils]: 53: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,798 INFO L290 TraceCheckUtils]: 54: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !!(0 == ~mode2~0 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,798 INFO L290 TraceCheckUtils]: 55: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume ~r2~0 % 256 < 2; {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,799 INFO L290 TraceCheckUtils]: 56: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !!(0 == ~ep21~0 % 256); {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} is VALID [2022-02-20 18:58:21,799 INFO L290 TraceCheckUtils]: 57: Hoare triple {53755#(<= (+ (* (div ~ep23~0 256) 256) 1) ~ep23~0)} assume !!(0 == ~ep23~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,799 INFO L290 TraceCheckUtils]: 58: Hoare triple {53752#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {53752#false} is VALID [2022-02-20 18:58:21,799 INFO L290 TraceCheckUtils]: 59: Hoare triple {53752#false} assume !!(0 == ~mode3~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,799 INFO L290 TraceCheckUtils]: 60: Hoare triple {53752#false} assume ~r3~0 % 256 < 2; {53752#false} is VALID [2022-02-20 18:58:21,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {53752#false} assume !!(0 == ~ep31~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {53752#false} assume !!(0 == ~ep32~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {53752#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; {53752#false} is VALID [2022-02-20 18:58:21,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {53752#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {53752#false} is VALID [2022-02-20 18:58:21,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {53752#false} assume ~st1~0 + ~nl1~0 <= 1; {53752#false} is VALID [2022-02-20 18:58:21,800 INFO L290 TraceCheckUtils]: 66: Hoare triple {53752#false} assume ~st2~0 + ~nl2~0 <= 1; {53752#false} is VALID [2022-02-20 18:58:21,800 INFO L290 TraceCheckUtils]: 67: Hoare triple {53752#false} assume ~st3~0 + ~nl3~0 <= 1; {53752#false} is VALID [2022-02-20 18:58:21,800 INFO L290 TraceCheckUtils]: 68: Hoare triple {53752#false} assume !(~r1~0 % 256 >= 2); {53752#false} is VALID [2022-02-20 18:58:21,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {53752#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {53752#false} is VALID [2022-02-20 18:58:21,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {53752#false} assume ~r1~0 % 256 < 2; {53752#false} is VALID [2022-02-20 18:58:21,800 INFO L290 TraceCheckUtils]: 71: Hoare triple {53752#false} assume !(~r1~0 % 256 >= 2); {53752#false} is VALID [2022-02-20 18:58:21,801 INFO L290 TraceCheckUtils]: 72: Hoare triple {53752#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {53752#false} is VALID [2022-02-20 18:58:21,801 INFO L290 TraceCheckUtils]: 73: Hoare triple {53752#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; {53752#false} is VALID [2022-02-20 18:58:21,801 INFO L290 TraceCheckUtils]: 74: Hoare triple {53752#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {53752#false} is VALID [2022-02-20 18:58:21,801 INFO L290 TraceCheckUtils]: 75: Hoare triple {53752#false} assume !(0 == ~mode1~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,801 INFO L290 TraceCheckUtils]: 76: Hoare triple {53752#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {53752#false} is VALID [2022-02-20 18:58:21,801 INFO L290 TraceCheckUtils]: 77: Hoare triple {53752#false} assume !!(0 == ~ep21~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,801 INFO L290 TraceCheckUtils]: 78: Hoare triple {53752#false} assume !!(0 == ~ep31~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,801 INFO L290 TraceCheckUtils]: 79: Hoare triple {53752#false} ~newmax1~0 := main_~node1__newmax~1#1; {53752#false} is VALID [2022-02-20 18:58:21,801 INFO L290 TraceCheckUtils]: 80: Hoare triple {53752#false} assume 1 == ~r1~0 % 256; {53752#false} is VALID [2022-02-20 18:58:21,802 INFO L290 TraceCheckUtils]: 81: Hoare triple {53752#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {53752#false} is VALID [2022-02-20 18:58:21,802 INFO L290 TraceCheckUtils]: 82: Hoare triple {53752#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {53752#false} is VALID [2022-02-20 18:58:21,802 INFO L290 TraceCheckUtils]: 83: Hoare triple {53752#false} assume !(0 == ~mode2~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,802 INFO L290 TraceCheckUtils]: 84: Hoare triple {53752#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {53752#false} is VALID [2022-02-20 18:58:21,802 INFO L290 TraceCheckUtils]: 85: Hoare triple {53752#false} assume !!(0 == ~ep12~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,802 INFO L290 TraceCheckUtils]: 86: Hoare triple {53752#false} assume !!(0 == ~ep32~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,802 INFO L290 TraceCheckUtils]: 87: Hoare triple {53752#false} ~newmax2~0 := main_~node2__newmax~1#1; {53752#false} is VALID [2022-02-20 18:58:21,802 INFO L290 TraceCheckUtils]: 88: Hoare triple {53752#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {53752#false} is VALID [2022-02-20 18:58:21,802 INFO L290 TraceCheckUtils]: 89: Hoare triple {53752#false} assume !(0 == ~mode3~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,803 INFO L290 TraceCheckUtils]: 90: Hoare triple {53752#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {53752#false} is VALID [2022-02-20 18:58:21,803 INFO L290 TraceCheckUtils]: 91: Hoare triple {53752#false} assume !!(0 == ~ep13~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,803 INFO L290 TraceCheckUtils]: 92: Hoare triple {53752#false} assume !!(0 == ~ep23~0 % 256); {53752#false} is VALID [2022-02-20 18:58:21,803 INFO L290 TraceCheckUtils]: 93: Hoare triple {53752#false} ~newmax3~0 := main_~node3__newmax~1#1; {53752#false} is VALID [2022-02-20 18:58:21,803 INFO L290 TraceCheckUtils]: 94: Hoare triple {53752#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; {53752#false} is VALID [2022-02-20 18:58:21,803 INFO L290 TraceCheckUtils]: 95: Hoare triple {53752#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {53752#false} is VALID [2022-02-20 18:58:21,803 INFO L290 TraceCheckUtils]: 96: Hoare triple {53752#false} assume ~st1~0 + ~nl1~0 <= 1; {53752#false} is VALID [2022-02-20 18:58:21,803 INFO L290 TraceCheckUtils]: 97: Hoare triple {53752#false} assume ~st2~0 + ~nl2~0 <= 1; {53752#false} is VALID [2022-02-20 18:58:21,803 INFO L290 TraceCheckUtils]: 98: Hoare triple {53752#false} assume ~st3~0 + ~nl3~0 <= 1; {53752#false} is VALID [2022-02-20 18:58:21,803 INFO L290 TraceCheckUtils]: 99: Hoare triple {53752#false} assume !(~r1~0 % 256 >= 2); {53752#false} is VALID [2022-02-20 18:58:21,804 INFO L290 TraceCheckUtils]: 100: Hoare triple {53752#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {53752#false} is VALID [2022-02-20 18:58:21,804 INFO L290 TraceCheckUtils]: 101: Hoare triple {53752#false} ~__return_1528~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1528~0; {53752#false} is VALID [2022-02-20 18:58:21,804 INFO L290 TraceCheckUtils]: 102: Hoare triple {53752#false} 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; {53752#false} is VALID [2022-02-20 18:58:21,804 INFO L290 TraceCheckUtils]: 103: Hoare triple {53752#false} assume 0 == main_~assert__arg~1#1 % 256; {53752#false} is VALID [2022-02-20 18:58:21,804 INFO L290 TraceCheckUtils]: 104: Hoare triple {53752#false} assume !false; {53752#false} is VALID [2022-02-20 18:58:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:21,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:21,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268863504] [2022-02-20 18:58:21,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268863504] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:21,805 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:21,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:58:21,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8122555] [2022-02-20 18:58:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:58:21,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:21,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:21,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:21,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:58:21,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:21,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:58:21,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:58:21,867 INFO L87 Difference]: Start difference. First operand 3234 states and 4948 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:27,186 INFO L93 Difference]: Finished difference Result 8716 states and 13341 transitions. [2022-02-20 18:58:27,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:27,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:58:27,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1014 transitions. [2022-02-20 18:58:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1014 transitions. [2022-02-20 18:58:27,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1014 transitions. [2022-02-20 18:58:27,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1014 edges. 1014 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:28,857 INFO L225 Difference]: With dead ends: 8716 [2022-02-20 18:58:28,857 INFO L226 Difference]: Without dead ends: 5519 [2022-02-20 18:58:28,859 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:28,860 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 1041 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:28,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1041 Valid, 896 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2022-02-20 18:58:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 5517. [2022-02-20 18:58:30,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:30,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5519 states. Second operand has 5517 states, 5516 states have (on average 1.5159535895576504) internal successors, (8362), 5516 states have internal predecessors, (8362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:30,594 INFO L74 IsIncluded]: Start isIncluded. First operand 5519 states. Second operand has 5517 states, 5516 states have (on average 1.5159535895576504) internal successors, (8362), 5516 states have internal predecessors, (8362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:30,599 INFO L87 Difference]: Start difference. First operand 5519 states. Second operand has 5517 states, 5516 states have (on average 1.5159535895576504) internal successors, (8362), 5516 states have internal predecessors, (8362), 0 states have call successors, (0), 0 states have call 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:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:31,430 INFO L93 Difference]: Finished difference Result 5519 states and 8363 transitions. [2022-02-20 18:58:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 8363 transitions. [2022-02-20 18:58:31,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:31,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:31,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 5517 states, 5516 states have (on average 1.5159535895576504) internal successors, (8362), 5516 states have internal predecessors, (8362), 0 states have call successors, (0), 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 5519 states. [2022-02-20 18:58:31,444 INFO L87 Difference]: Start difference. First operand has 5517 states, 5516 states have (on average 1.5159535895576504) internal successors, (8362), 5516 states have internal predecessors, (8362), 0 states have call successors, (0), 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 5519 states. [2022-02-20 18:58:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:32,295 INFO L93 Difference]: Finished difference Result 5519 states and 8363 transitions. [2022-02-20 18:58:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 8363 transitions. [2022-02-20 18:58:32,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:32,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:32,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:32,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5517 states, 5516 states have (on average 1.5159535895576504) internal successors, (8362), 5516 states have internal predecessors, (8362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5517 states to 5517 states and 8362 transitions. [2022-02-20 18:58:33,573 INFO L78 Accepts]: Start accepts. Automaton has 5517 states and 8362 transitions. Word has length 105 [2022-02-20 18:58:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:33,574 INFO L470 AbstractCegarLoop]: Abstraction has 5517 states and 8362 transitions. [2022-02-20 18:58:33,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 5517 states and 8362 transitions. [2022-02-20 18:58:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:58:33,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:33,577 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] [2022-02-20 18:58:33,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:58:33,577 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:33,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:33,577 INFO L85 PathProgramCache]: Analyzing trace with hash 540693227, now seen corresponding path program 1 times [2022-02-20 18:58:33,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:33,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999677284] [2022-02-20 18:58:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:33,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:33,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {84000#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_1528~0 := 0;~__return_1653~0 := 0; {84000#true} is VALID [2022-02-20 18:58:33,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {84000#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_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#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_~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; {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {84002#(= (+ |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; {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,653 INFO L290 TraceCheckUtils]: 4: Hoare triple {84002#(= (+ |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); {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {84002#(= (+ |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; {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {84002#(= (+ |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); {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {84002#(= (+ |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; {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {84002#(= (+ |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); {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256); {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {84002#(= (+ |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; {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {84002#(= (+ |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); {84002#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:58:33,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {84002#(= (+ |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; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {84003#(<= (+ (* 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); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {84003#(<= (+ (* 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); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id2~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id3~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 != ~id3~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 >= 0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 >= 0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id3~0 >= 0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r1~0 % 256; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r2~0 % 256; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r3~0 % 256; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r122~0#1 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r132~0#1 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r212~0#1 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r232~0#1 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r312~0#1 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r322~0#1 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max1~0 == ~id1~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max2~0 == ~id2~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max3~0 == ~id3~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st1~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st2~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st3~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl1~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl2~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl3~0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode1~0 % 256; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode2~0 % 256; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode3~0 % 256; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == ~newmax1~0 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,665 INFO L290 TraceCheckUtils]: 46: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == ~newmax2~0 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,665 INFO L290 TraceCheckUtils]: 47: Hoare triple {84003#(<= (+ (* 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; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,665 INFO L290 TraceCheckUtils]: 48: Hoare triple {84003#(<= (+ (* 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; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode1~0 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,666 INFO L290 TraceCheckUtils]: 50: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r1~0 % 256 < 2; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,666 INFO L290 TraceCheckUtils]: 51: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep12~0 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,667 INFO L290 TraceCheckUtils]: 52: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep13~0 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,667 INFO L290 TraceCheckUtils]: 53: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,667 INFO L290 TraceCheckUtils]: 54: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode2~0 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,667 INFO L290 TraceCheckUtils]: 55: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r2~0 % 256 < 2; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,668 INFO L290 TraceCheckUtils]: 56: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep21~0 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep23~0 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode3~0 % 256); {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r3~0 % 256 < 2; {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:58:33,669 INFO L290 TraceCheckUtils]: 61: Hoare triple {84003#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep31~0 % 256); {84001#false} is VALID [2022-02-20 18:58:33,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {84001#false} assume !!(0 == ~ep32~0 % 256); {84001#false} is VALID [2022-02-20 18:58:33,669 INFO L290 TraceCheckUtils]: 63: Hoare triple {84001#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; {84001#false} is VALID [2022-02-20 18:58:33,669 INFO L290 TraceCheckUtils]: 64: Hoare triple {84001#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {84001#false} is VALID [2022-02-20 18:58:33,669 INFO L290 TraceCheckUtils]: 65: Hoare triple {84001#false} assume ~st1~0 + ~nl1~0 <= 1; {84001#false} is VALID [2022-02-20 18:58:33,670 INFO L290 TraceCheckUtils]: 66: Hoare triple {84001#false} assume ~st2~0 + ~nl2~0 <= 1; {84001#false} is VALID [2022-02-20 18:58:33,670 INFO L290 TraceCheckUtils]: 67: Hoare triple {84001#false} assume ~st3~0 + ~nl3~0 <= 1; {84001#false} is VALID [2022-02-20 18:58:33,670 INFO L290 TraceCheckUtils]: 68: Hoare triple {84001#false} assume !(~r1~0 % 256 >= 2); {84001#false} is VALID [2022-02-20 18:58:33,670 INFO L290 TraceCheckUtils]: 69: Hoare triple {84001#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {84001#false} is VALID [2022-02-20 18:58:33,670 INFO L290 TraceCheckUtils]: 70: Hoare triple {84001#false} assume ~r1~0 % 256 < 2; {84001#false} is VALID [2022-02-20 18:58:33,670 INFO L290 TraceCheckUtils]: 71: Hoare triple {84001#false} assume !(~r1~0 % 256 >= 2); {84001#false} is VALID [2022-02-20 18:58:33,670 INFO L290 TraceCheckUtils]: 72: Hoare triple {84001#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {84001#false} is VALID [2022-02-20 18:58:33,670 INFO L290 TraceCheckUtils]: 73: Hoare triple {84001#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; {84001#false} is VALID [2022-02-20 18:58:33,670 INFO L290 TraceCheckUtils]: 74: Hoare triple {84001#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {84001#false} is VALID [2022-02-20 18:58:33,671 INFO L290 TraceCheckUtils]: 75: Hoare triple {84001#false} assume !(0 == ~mode1~0 % 256); {84001#false} is VALID [2022-02-20 18:58:33,671 INFO L290 TraceCheckUtils]: 76: Hoare triple {84001#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {84001#false} is VALID [2022-02-20 18:58:33,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {84001#false} assume !!(0 == ~ep21~0 % 256); {84001#false} is VALID [2022-02-20 18:58:33,671 INFO L290 TraceCheckUtils]: 78: Hoare triple {84001#false} assume !!(0 == ~ep31~0 % 256); {84001#false} is VALID [2022-02-20 18:58:33,671 INFO L290 TraceCheckUtils]: 79: Hoare triple {84001#false} ~newmax1~0 := main_~node1__newmax~1#1; {84001#false} is VALID [2022-02-20 18:58:33,671 INFO L290 TraceCheckUtils]: 80: Hoare triple {84001#false} assume 1 == ~r1~0 % 256; {84001#false} is VALID [2022-02-20 18:58:33,671 INFO L290 TraceCheckUtils]: 81: Hoare triple {84001#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {84001#false} is VALID [2022-02-20 18:58:33,671 INFO L290 TraceCheckUtils]: 82: Hoare triple {84001#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {84001#false} is VALID [2022-02-20 18:58:33,671 INFO L290 TraceCheckUtils]: 83: Hoare triple {84001#false} assume !(0 == ~mode2~0 % 256); {84001#false} is VALID [2022-02-20 18:58:33,671 INFO L290 TraceCheckUtils]: 84: Hoare triple {84001#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {84001#false} is VALID [2022-02-20 18:58:33,672 INFO L290 TraceCheckUtils]: 85: Hoare triple {84001#false} assume !!(0 == ~ep12~0 % 256); {84001#false} is VALID [2022-02-20 18:58:33,672 INFO L290 TraceCheckUtils]: 86: Hoare triple {84001#false} assume !!(0 == ~ep32~0 % 256); {84001#false} is VALID [2022-02-20 18:58:33,672 INFO L290 TraceCheckUtils]: 87: Hoare triple {84001#false} ~newmax2~0 := main_~node2__newmax~1#1; {84001#false} is VALID [2022-02-20 18:58:33,672 INFO L290 TraceCheckUtils]: 88: Hoare triple {84001#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {84001#false} is VALID [2022-02-20 18:58:33,672 INFO L290 TraceCheckUtils]: 89: Hoare triple {84001#false} assume !(0 == ~mode3~0 % 256); {84001#false} is VALID [2022-02-20 18:58:33,672 INFO L290 TraceCheckUtils]: 90: Hoare triple {84001#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {84001#false} is VALID [2022-02-20 18:58:33,672 INFO L290 TraceCheckUtils]: 91: Hoare triple {84001#false} assume !!(0 == ~ep13~0 % 256); {84001#false} is VALID [2022-02-20 18:58:33,672 INFO L290 TraceCheckUtils]: 92: Hoare triple {84001#false} assume !!(0 == ~ep23~0 % 256); {84001#false} is VALID [2022-02-20 18:58:33,672 INFO L290 TraceCheckUtils]: 93: Hoare triple {84001#false} ~newmax3~0 := main_~node3__newmax~1#1; {84001#false} is VALID [2022-02-20 18:58:33,673 INFO L290 TraceCheckUtils]: 94: Hoare triple {84001#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; {84001#false} is VALID [2022-02-20 18:58:33,673 INFO L290 TraceCheckUtils]: 95: Hoare triple {84001#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {84001#false} is VALID [2022-02-20 18:58:33,673 INFO L290 TraceCheckUtils]: 96: Hoare triple {84001#false} assume ~st1~0 + ~nl1~0 <= 1; {84001#false} is VALID [2022-02-20 18:58:33,673 INFO L290 TraceCheckUtils]: 97: Hoare triple {84001#false} assume ~st2~0 + ~nl2~0 <= 1; {84001#false} is VALID [2022-02-20 18:58:33,673 INFO L290 TraceCheckUtils]: 98: Hoare triple {84001#false} assume ~st3~0 + ~nl3~0 <= 1; {84001#false} is VALID [2022-02-20 18:58:33,673 INFO L290 TraceCheckUtils]: 99: Hoare triple {84001#false} assume !(~r1~0 % 256 >= 2); {84001#false} is VALID [2022-02-20 18:58:33,673 INFO L290 TraceCheckUtils]: 100: Hoare triple {84001#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {84001#false} is VALID [2022-02-20 18:58:33,673 INFO L290 TraceCheckUtils]: 101: Hoare triple {84001#false} ~__return_1528~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1528~0; {84001#false} is VALID [2022-02-20 18:58:33,673 INFO L290 TraceCheckUtils]: 102: Hoare triple {84001#false} 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; {84001#false} is VALID [2022-02-20 18:58:33,674 INFO L290 TraceCheckUtils]: 103: Hoare triple {84001#false} assume 0 == main_~assert__arg~1#1 % 256; {84001#false} is VALID [2022-02-20 18:58:33,674 INFO L290 TraceCheckUtils]: 104: Hoare triple {84001#false} assume !false; {84001#false} is VALID [2022-02-20 18:58:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:33,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:33,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999677284] [2022-02-20 18:58:33,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999677284] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:33,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:33,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:33,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092484932] [2022-02-20 18:58:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:33,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:58:33,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:33,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:33,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:33,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:33,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:33,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:33,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:33,743 INFO L87 Difference]: Start difference. First operand 5517 states and 8362 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:41,378 INFO L93 Difference]: Finished difference Result 11296 states and 16989 transitions. [2022-02-20 18:58:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:41,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:58:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 989 transitions. [2022-02-20 18:58:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 989 transitions. [2022-02-20 18:58:41,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 989 transitions. [2022-02-20 18:58:41,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 989 edges. 989 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:43,210 INFO L225 Difference]: With dead ends: 11296 [2022-02-20 18:58:43,211 INFO L226 Difference]: Without dead ends: 5896 [2022-02-20 18:58:43,214 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:43,215 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 698 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:43,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [698 Valid, 881 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5896 states. [2022-02-20 18:58:45,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5896 to 5741. [2022-02-20 18:58:45,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:45,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5896 states. Second operand has 5741 states, 5740 states have (on average 1.4993031358885018) internal successors, (8606), 5740 states have internal predecessors, (8606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:45,353 INFO L74 IsIncluded]: Start isIncluded. First operand 5896 states. Second operand has 5741 states, 5740 states have (on average 1.4993031358885018) internal successors, (8606), 5740 states have internal predecessors, (8606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:45,358 INFO L87 Difference]: Start difference. First operand 5896 states. Second operand has 5741 states, 5740 states have (on average 1.4993031358885018) internal successors, (8606), 5740 states have internal predecessors, (8606), 0 states have call successors, (0), 0 states have call 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:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:46,306 INFO L93 Difference]: Finished difference Result 5896 states and 8786 transitions. [2022-02-20 18:58:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 5896 states and 8786 transitions. [2022-02-20 18:58:46,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:46,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:46,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 5741 states, 5740 states have (on average 1.4993031358885018) internal successors, (8606), 5740 states have internal predecessors, (8606), 0 states have call successors, (0), 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 5896 states. [2022-02-20 18:58:46,323 INFO L87 Difference]: Start difference. First operand has 5741 states, 5740 states have (on average 1.4993031358885018) internal successors, (8606), 5740 states have internal predecessors, (8606), 0 states have call successors, (0), 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 5896 states. [2022-02-20 18:58:47,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:47,293 INFO L93 Difference]: Finished difference Result 5896 states and 8786 transitions. [2022-02-20 18:58:47,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5896 states and 8786 transitions. [2022-02-20 18:58:47,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:47,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:47,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:47,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5741 states, 5740 states have (on average 1.4993031358885018) internal successors, (8606), 5740 states have internal predecessors, (8606), 0 states have call successors, (0), 0 states have call 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:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5741 states to 5741 states and 8606 transitions. [2022-02-20 18:58:48,673 INFO L78 Accepts]: Start accepts. Automaton has 5741 states and 8606 transitions. Word has length 105 [2022-02-20 18:58:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:48,673 INFO L470 AbstractCegarLoop]: Abstraction has 5741 states and 8606 transitions. [2022-02-20 18:58:48,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call 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:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5741 states and 8606 transitions. [2022-02-20 18:58:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 18:58:48,675 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:48,675 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:48,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:58:48,676 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:48,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash 138743479, now seen corresponding path program 1 times [2022-02-20 18:58:48,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:48,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765447060] [2022-02-20 18:58:48,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:48,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:48,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {118717#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_1528~0 := 0;~__return_1653~0 := 0; {118717#true} is VALID [2022-02-20 18:58:48,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {118717#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_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#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_~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; {118717#true} is VALID [2022-02-20 18:58:48,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {118717#true} assume !!(0 == main_~init__r121~0#1 % 256); {118717#true} is VALID [2022-02-20 18:58:48,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {118717#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {118717#true} is VALID [2022-02-20 18:58:48,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {118717#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {118717#true} is VALID [2022-02-20 18:58:48,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {118717#true} assume !!(0 == main_~init__r131~0#1 % 256); {118717#true} is VALID [2022-02-20 18:58:48,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {118717#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {118717#true} is VALID [2022-02-20 18:58:48,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {118717#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {118717#true} is VALID [2022-02-20 18:58:48,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {118717#true} assume !!(0 == main_~init__r211~0#1 % 256); {118717#true} is VALID [2022-02-20 18:58:48,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {118717#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {118717#true} is VALID [2022-02-20 18:58:48,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {118717#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {118717#true} is VALID [2022-02-20 18:58:48,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {118717#true} assume !!(0 == main_~init__r231~0#1 % 256); {118717#true} is VALID [2022-02-20 18:58:48,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {118717#true} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {118717#true} is VALID [2022-02-20 18:58:48,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {118717#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {118717#true} is VALID [2022-02-20 18:58:48,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {118717#true} assume !!(0 == main_~init__r311~0#1 % 256); {118717#true} is VALID [2022-02-20 18:58:48,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {118717#true} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {118719#(= (+ |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:48,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {118719#(= (+ |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); {118719#(= (+ |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:48,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {118719#(= (+ |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; {118718#false} is VALID [2022-02-20 18:58:48,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {118718#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {118718#false} is VALID [2022-02-20 18:58:48,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {118718#false} assume ~id1~0 != ~id2~0; {118718#false} is VALID [2022-02-20 18:58:48,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {118718#false} assume ~id1~0 != ~id3~0; {118718#false} is VALID [2022-02-20 18:58:48,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {118718#false} assume ~id2~0 != ~id3~0; {118718#false} is VALID [2022-02-20 18:58:48,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {118718#false} assume ~id1~0 >= 0; {118718#false} is VALID [2022-02-20 18:58:48,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {118718#false} assume ~id2~0 >= 0; {118718#false} is VALID [2022-02-20 18:58:48,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {118718#false} assume ~id3~0 >= 0; {118718#false} is VALID [2022-02-20 18:58:48,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {118718#false} assume 0 == ~r1~0 % 256; {118718#false} is VALID [2022-02-20 18:58:48,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {118718#false} assume 0 == ~r2~0 % 256; {118718#false} is VALID [2022-02-20 18:58:48,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {118718#false} assume 0 == ~r3~0 % 256; {118718#false} is VALID [2022-02-20 18:58:48,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {118718#false} assume !(0 == main_~init__r122~0#1 % 256); {118718#false} is VALID [2022-02-20 18:58:48,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {118718#false} assume !(0 == main_~init__r132~0#1 % 256); {118718#false} is VALID [2022-02-20 18:58:48,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {118718#false} assume !(0 == main_~init__r212~0#1 % 256); {118718#false} is VALID [2022-02-20 18:58:48,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {118718#false} assume !(0 == main_~init__r232~0#1 % 256); {118718#false} is VALID [2022-02-20 18:58:48,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {118718#false} assume !(0 == main_~init__r312~0#1 % 256); {118718#false} is VALID [2022-02-20 18:58:48,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {118718#false} assume !(0 == main_~init__r322~0#1 % 256); {118718#false} is VALID [2022-02-20 18:58:48,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {118718#false} assume ~max1~0 == ~id1~0; {118718#false} is VALID [2022-02-20 18:58:48,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {118718#false} assume ~max2~0 == ~id2~0; {118718#false} is VALID [2022-02-20 18:58:48,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {118718#false} assume ~max3~0 == ~id3~0; {118718#false} is VALID [2022-02-20 18:58:48,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {118718#false} assume 0 == ~st1~0; {118718#false} is VALID [2022-02-20 18:58:48,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {118718#false} assume 0 == ~st2~0; {118718#false} is VALID [2022-02-20 18:58:48,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {118718#false} assume 0 == ~st3~0; {118718#false} is VALID [2022-02-20 18:58:48,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {118718#false} assume 0 == ~nl1~0; {118718#false} is VALID [2022-02-20 18:58:48,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {118718#false} assume 0 == ~nl2~0; {118718#false} is VALID [2022-02-20 18:58:48,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {118718#false} assume 0 == ~nl3~0; {118718#false} is VALID [2022-02-20 18:58:48,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {118718#false} assume 0 == ~mode1~0 % 256; {118718#false} is VALID [2022-02-20 18:58:48,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {118718#false} assume 0 == ~mode2~0 % 256; {118718#false} is VALID [2022-02-20 18:58:48,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {118718#false} assume 0 == ~mode3~0 % 256; {118718#false} is VALID [2022-02-20 18:58:48,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {118718#false} assume !(0 == ~newmax1~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {118718#false} assume !(0 == ~newmax2~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {118718#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; {118718#false} is VALID [2022-02-20 18:58:48,725 INFO L290 TraceCheckUtils]: 49: Hoare triple {118718#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; {118718#false} is VALID [2022-02-20 18:58:48,725 INFO L290 TraceCheckUtils]: 50: Hoare triple {118718#false} assume !!(0 == ~mode1~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {118718#false} assume ~r1~0 % 256 < 2; {118718#false} is VALID [2022-02-20 18:58:48,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {118718#false} assume !!(0 == ~ep12~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {118718#false} assume !!(0 == ~ep13~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {118718#false} ~mode1~0 := 1;havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {118718#false} is VALID [2022-02-20 18:58:48,725 INFO L290 TraceCheckUtils]: 55: Hoare triple {118718#false} assume !!(0 == ~mode2~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {118718#false} assume ~r2~0 % 256 < 2; {118718#false} is VALID [2022-02-20 18:58:48,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {118718#false} assume !!(0 == ~ep21~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,726 INFO L290 TraceCheckUtils]: 58: Hoare triple {118718#false} assume !!(0 == ~ep23~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,726 INFO L290 TraceCheckUtils]: 59: Hoare triple {118718#false} ~mode2~0 := 1;havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {118718#false} is VALID [2022-02-20 18:58:48,726 INFO L290 TraceCheckUtils]: 60: Hoare triple {118718#false} assume !!(0 == ~mode3~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,726 INFO L290 TraceCheckUtils]: 61: Hoare triple {118718#false} assume ~r3~0 % 256 < 2; {118718#false} is VALID [2022-02-20 18:58:48,726 INFO L290 TraceCheckUtils]: 62: Hoare triple {118718#false} assume !!(0 == ~ep31~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,726 INFO L290 TraceCheckUtils]: 63: Hoare triple {118718#false} assume !!(0 == ~ep32~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,726 INFO L290 TraceCheckUtils]: 64: Hoare triple {118718#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; {118718#false} is VALID [2022-02-20 18:58:48,726 INFO L290 TraceCheckUtils]: 65: Hoare triple {118718#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {118718#false} is VALID [2022-02-20 18:58:48,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {118718#false} assume ~st1~0 + ~nl1~0 <= 1; {118718#false} is VALID [2022-02-20 18:58:48,727 INFO L290 TraceCheckUtils]: 67: Hoare triple {118718#false} assume ~st2~0 + ~nl2~0 <= 1; {118718#false} is VALID [2022-02-20 18:58:48,727 INFO L290 TraceCheckUtils]: 68: Hoare triple {118718#false} assume ~st3~0 + ~nl3~0 <= 1; {118718#false} is VALID [2022-02-20 18:58:48,727 INFO L290 TraceCheckUtils]: 69: Hoare triple {118718#false} assume !(~r1~0 % 256 >= 2); {118718#false} is VALID [2022-02-20 18:58:48,727 INFO L290 TraceCheckUtils]: 70: Hoare triple {118718#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {118718#false} is VALID [2022-02-20 18:58:48,727 INFO L290 TraceCheckUtils]: 71: Hoare triple {118718#false} assume ~r1~0 % 256 < 2; {118718#false} is VALID [2022-02-20 18:58:48,727 INFO L290 TraceCheckUtils]: 72: Hoare triple {118718#false} assume !(~r1~0 % 256 >= 2); {118718#false} is VALID [2022-02-20 18:58:48,727 INFO L290 TraceCheckUtils]: 73: Hoare triple {118718#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {118718#false} is VALID [2022-02-20 18:58:48,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {118718#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; {118718#false} is VALID [2022-02-20 18:58:48,727 INFO L290 TraceCheckUtils]: 75: Hoare triple {118718#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__newmax~1#1;main_~node1__newmax~1#1 := 0; {118718#false} is VALID [2022-02-20 18:58:48,728 INFO L290 TraceCheckUtils]: 76: Hoare triple {118718#false} assume !(0 == ~mode1~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,728 INFO L290 TraceCheckUtils]: 77: Hoare triple {118718#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {118718#false} is VALID [2022-02-20 18:58:48,728 INFO L290 TraceCheckUtils]: 78: Hoare triple {118718#false} assume !!(0 == ~ep21~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,728 INFO L290 TraceCheckUtils]: 79: Hoare triple {118718#false} assume !!(0 == ~ep31~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,728 INFO L290 TraceCheckUtils]: 80: Hoare triple {118718#false} ~newmax1~0 := main_~node1__newmax~1#1; {118718#false} is VALID [2022-02-20 18:58:48,728 INFO L290 TraceCheckUtils]: 81: Hoare triple {118718#false} assume 1 == ~r1~0 % 256; {118718#false} is VALID [2022-02-20 18:58:48,728 INFO L290 TraceCheckUtils]: 82: Hoare triple {118718#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {118718#false} is VALID [2022-02-20 18:58:48,728 INFO L290 TraceCheckUtils]: 83: Hoare triple {118718#false} ~mode1~0 := 0;havoc main_~node2__newmax~1#1;main_~node2__newmax~1#1 := 0; {118718#false} is VALID [2022-02-20 18:58:48,728 INFO L290 TraceCheckUtils]: 84: Hoare triple {118718#false} assume !(0 == ~mode2~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,728 INFO L290 TraceCheckUtils]: 85: Hoare triple {118718#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {118718#false} is VALID [2022-02-20 18:58:48,729 INFO L290 TraceCheckUtils]: 86: Hoare triple {118718#false} assume !!(0 == ~ep12~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,729 INFO L290 TraceCheckUtils]: 87: Hoare triple {118718#false} assume !!(0 == ~ep32~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,729 INFO L290 TraceCheckUtils]: 88: Hoare triple {118718#false} ~newmax2~0 := main_~node2__newmax~1#1; {118718#false} is VALID [2022-02-20 18:58:48,729 INFO L290 TraceCheckUtils]: 89: Hoare triple {118718#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0;havoc main_~node3__newmax~1#1;main_~node3__newmax~1#1 := 0; {118718#false} is VALID [2022-02-20 18:58:48,729 INFO L290 TraceCheckUtils]: 90: Hoare triple {118718#false} assume !(0 == ~mode3~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,729 INFO L290 TraceCheckUtils]: 91: Hoare triple {118718#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {118718#false} is VALID [2022-02-20 18:58:48,729 INFO L290 TraceCheckUtils]: 92: Hoare triple {118718#false} assume !!(0 == ~ep13~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,729 INFO L290 TraceCheckUtils]: 93: Hoare triple {118718#false} assume !!(0 == ~ep23~0 % 256); {118718#false} is VALID [2022-02-20 18:58:48,729 INFO L290 TraceCheckUtils]: 94: Hoare triple {118718#false} ~newmax3~0 := main_~node3__newmax~1#1; {118718#false} is VALID [2022-02-20 18:58:48,730 INFO L290 TraceCheckUtils]: 95: Hoare triple {118718#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; {118718#false} is VALID [2022-02-20 18:58:48,730 INFO L290 TraceCheckUtils]: 96: Hoare triple {118718#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {118718#false} is VALID [2022-02-20 18:58:48,730 INFO L290 TraceCheckUtils]: 97: Hoare triple {118718#false} assume ~st1~0 + ~nl1~0 <= 1; {118718#false} is VALID [2022-02-20 18:58:48,730 INFO L290 TraceCheckUtils]: 98: Hoare triple {118718#false} assume ~st2~0 + ~nl2~0 <= 1; {118718#false} is VALID [2022-02-20 18:58:48,730 INFO L290 TraceCheckUtils]: 99: Hoare triple {118718#false} assume ~st3~0 + ~nl3~0 <= 1; {118718#false} is VALID [2022-02-20 18:58:48,730 INFO L290 TraceCheckUtils]: 100: Hoare triple {118718#false} assume !(~r1~0 % 256 >= 2); {118718#false} is VALID [2022-02-20 18:58:48,730 INFO L290 TraceCheckUtils]: 101: Hoare triple {118718#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {118718#false} is VALID [2022-02-20 18:58:48,730 INFO L290 TraceCheckUtils]: 102: Hoare triple {118718#false} ~__return_1528~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1528~0; {118718#false} is VALID [2022-02-20 18:58:48,730 INFO L290 TraceCheckUtils]: 103: Hoare triple {118718#false} 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; {118718#false} is VALID [2022-02-20 18:58:48,730 INFO L290 TraceCheckUtils]: 104: Hoare triple {118718#false} assume 0 == main_~assert__arg~1#1 % 256; {118718#false} is VALID [2022-02-20 18:58:48,731 INFO L290 TraceCheckUtils]: 105: Hoare triple {118718#false} assume !false; {118718#false} is VALID [2022-02-20 18:58:48,731 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:48,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:48,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765447060] [2022-02-20 18:58:48,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765447060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:48,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:48,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:48,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578897259] [2022-02-20 18:58:48,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:48,732 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:48,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:48,732 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:48,795 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:48,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:48,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:48,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:48,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:48,796 INFO L87 Difference]: Start difference. First operand 5741 states and 8606 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:59:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:59:04,623 INFO L93 Difference]: Finished difference Result 16497 states and 24904 transitions. [2022-02-20 18:59:04,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:59:04,623 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:59:04,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:59:04,623 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:59:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2022-02-20 18:59:04,626 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:59:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2022-02-20 18:59:04,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 994 transitions. [2022-02-20 18:59:05,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 994 edges. 994 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.