./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 725c5f8c833c7945922f02dcce7a19d2486080a25ed300fe3444b2b9ce738b5e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:57:01,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:57:01,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:57:01,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:57:01,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:57:01,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:57:01,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:57:01,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:57:01,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:57:01,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:57:01,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:57:01,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:57:01,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:57:01,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:57:01,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:57:01,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:57:01,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:57:01,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:57:01,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:57:01,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:57:01,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:57:01,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:57:01,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:57:01,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:57:01,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:57:01,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:57:01,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:57:01,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:57:01,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:57:01,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:57:01,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:57:01,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:57:01,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:57:01,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:57:01,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:57:01,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:57:01,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:57:01,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:57:01,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:57:01,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:57:01,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:57:01,515 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:57:01,538 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:57:01,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:57:01,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:57:01,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:57:01,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:57:01,539 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:57:01,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:57:01,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:57:01,540 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:57:01,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:57:01,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:57:01,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:57:01,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:57:01,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:57:01,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:57:01,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:57:01,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:57:01,542 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:57:01,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:57:01,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:57:01,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:57:01,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:57:01,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:57:01,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:57:01,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:57:01,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:57:01,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:57:01,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:57:01,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:57:01,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:57:01,544 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:57:01,545 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:57:01,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:57:01,545 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 -> 725c5f8c833c7945922f02dcce7a19d2486080a25ed300fe3444b2b9ce738b5e [2022-02-20 18:57:01,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:57:01,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:57:01,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:57:01,780 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:57:01,780 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:57:01,781 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.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:57:01,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/861c528a2/8a8611f356e540948cd27cf56dcce4e9/FLAGb59d2589a [2022-02-20 18:57:02,184 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:57:02,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:57:02,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/861c528a2/8a8611f356e540948cd27cf56dcce4e9/FLAGb59d2589a [2022-02-20 18:57:02,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/861c528a2/8a8611f356e540948cd27cf56dcce4e9 [2022-02-20 18:57:02,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:57:02,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:57:02,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:57:02,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:57:02,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:57:02,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:57:02" (1/1) ... [2022-02-20 18:57:02,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c64e75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:02, skipping insertion in model container [2022-02-20 18:57:02,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:57:02" (1/1) ... [2022-02-20 18:57:02,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:57:02,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:57:02,801 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.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7638,7651] [2022-02-20 18:57:02,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:57:02,833 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:57:02,867 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.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7638,7651] [2022-02-20 18:57:02,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:57:02,907 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:57:02,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:02 WrapperNode [2022-02-20 18:57:02,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:57:02,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:57:02,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:57:02,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:57:02,918 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:57:02" (1/1) ... [2022-02-20 18:57:02,927 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:57:02" (1/1) ... [2022-02-20 18:57:02,977 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 615 [2022-02-20 18:57:02,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:57:02,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:57:02,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:57:02,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:57:02,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:02" (1/1) ... [2022-02-20 18:57:02,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:02" (1/1) ... [2022-02-20 18:57:03,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:02" (1/1) ... [2022-02-20 18:57:03,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:02" (1/1) ... [2022-02-20 18:57:03,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:02" (1/1) ... [2022-02-20 18:57:03,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:02" (1/1) ... [2022-02-20 18:57:03,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:02" (1/1) ... [2022-02-20 18:57:03,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:57:03,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:57:03,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:57:03,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:57:03,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:02" (1/1) ... [2022-02-20 18:57:03,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:57:03,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:57:03,049 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:57:03,050 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:57:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:57:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:57:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:57:03,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:57:03,194 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:57:03,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:57:03,822 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:57:03,827 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:57:03,829 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:57:03,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:57:03 BoogieIcfgContainer [2022-02-20 18:57:03,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:57:03,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:57:03,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:57:03,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:57:03,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:57:02" (1/3) ... [2022-02-20 18:57:03,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245c6498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:57:03, skipping insertion in model container [2022-02-20 18:57:03,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:02" (2/3) ... [2022-02-20 18:57:03,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245c6498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:57:03, skipping insertion in model container [2022-02-20 18:57:03,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:57:03" (3/3) ... [2022-02-20 18:57:03,838 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:57:03,842 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:57:03,843 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:57:03,887 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:57:03,892 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:57:03,892 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:57:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 141 states have (on average 1.75177304964539) internal successors, (247), 142 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:57:03,921 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:03,921 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] [2022-02-20 18:57:03,922 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:03,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:03,927 INFO L85 PathProgramCache]: Analyzing trace with hash -463597657, now seen corresponding path program 1 times [2022-02-20 18:57:03,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:03,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952482706] [2022-02-20 18:57:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:04,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#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_1911~0 := 0;~__return_2060~0 := 0;~__return_2167~0 := 0; {146#true} is VALID [2022-02-20 18:57:04,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {146#true} is VALID [2022-02-20 18:57:04,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {146#true} is VALID [2022-02-20 18:57:04,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {146#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:57:04,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {146#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {146#true} is VALID [2022-02-20 18:57:04,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:57:04,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {146#true} is VALID [2022-02-20 18:57:04,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:57:04,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {146#true} is VALID [2022-02-20 18:57:04,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:57:04,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {146#true} is VALID [2022-02-20 18:57:04,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:57:04,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {146#true} is VALID [2022-02-20 18:57:04,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {146#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {146#true} is VALID [2022-02-20 18:57:04,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {146#true} assume ~id1~0 != ~id2~0; {146#true} is VALID [2022-02-20 18:57:04,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {146#true} assume ~id1~0 != ~id3~0; {146#true} is VALID [2022-02-20 18:57:04,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {146#true} assume ~id2~0 != ~id3~0; {146#true} is VALID [2022-02-20 18:57:04,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {146#true} assume ~id1~0 >= 0; {146#true} is VALID [2022-02-20 18:57:04,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {146#true} assume ~id2~0 >= 0; {146#true} is VALID [2022-02-20 18:57:04,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {146#true} assume ~id3~0 >= 0; {146#true} is VALID [2022-02-20 18:57:04,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {146#true} assume 0 == ~r1~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {148#(<= ~r1~0 0)} assume 0 == ~r2~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {148#(<= ~r1~0 0)} assume 0 == ~r3~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {148#(<= ~r1~0 0)} assume ~max1~0 == ~id1~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {148#(<= ~r1~0 0)} assume ~max2~0 == ~id2~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {148#(<= ~r1~0 0)} assume ~max3~0 == ~id3~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {148#(<= ~r1~0 0)} assume 0 == ~st1~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {148#(<= ~r1~0 0)} assume 0 == ~st2~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {148#(<= ~r1~0 0)} assume 0 == ~st3~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {148#(<= ~r1~0 0)} assume 0 == ~nl1~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {148#(<= ~r1~0 0)} assume 0 == ~nl2~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {148#(<= ~r1~0 0)} assume 0 == ~nl3~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {148#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {148#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {148#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {148#(<= ~r1~0 0)} assume !(0 == ~newmax1~0 % 256); {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {148#(<= ~r1~0 0)} assume !(0 == ~newmax2~0 % 256); {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {148#(<= ~r1~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1911~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1911~0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {148#(<= ~r1~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {148#(<= ~r1~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {148#(<= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256); {148#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:04,253 INFO L290 TraceCheckUtils]: 41: Hoare triple {148#(<= ~r1~0 0)} assume !(~r1~0 < 2); {147#false} is VALID [2022-02-20 18:57:04,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {147#false} ~mode1~0 := 1; {147#false} is VALID [2022-02-20 18:57:04,254 INFO L290 TraceCheckUtils]: 43: Hoare triple {147#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {147#false} is VALID [2022-02-20 18:57:04,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {147#false} assume !!(0 == ~mode2~0 % 256); {147#false} is VALID [2022-02-20 18:57:04,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {147#false} assume !(~r2~0 < 2); {147#false} is VALID [2022-02-20 18:57:04,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {147#false} ~mode2~0 := 1; {147#false} is VALID [2022-02-20 18:57:04,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {147#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {147#false} is VALID [2022-02-20 18:57:04,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {147#false} assume !!(0 == ~mode3~0 % 256); {147#false} is VALID [2022-02-20 18:57:04,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {147#false} assume !(~r3~0 < 2); {147#false} is VALID [2022-02-20 18:57:04,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {147#false} ~mode3~0 := 1; {147#false} is VALID [2022-02-20 18:57:04,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {147#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {147#false} is VALID [2022-02-20 18:57:04,259 INFO L290 TraceCheckUtils]: 52: Hoare triple {147#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {147#false} is VALID [2022-02-20 18:57:04,259 INFO L290 TraceCheckUtils]: 53: Hoare triple {147#false} ~__return_2060~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2060~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; {147#false} is VALID [2022-02-20 18:57:04,259 INFO L290 TraceCheckUtils]: 54: Hoare triple {147#false} assume 0 == main_~assert__arg~0#1 % 256; {147#false} is VALID [2022-02-20 18:57:04,260 INFO L290 TraceCheckUtils]: 55: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-02-20 18:57:04,261 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:57:04,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:04,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952482706] [2022-02-20 18:57:04,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952482706] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:04,263 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:04,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:04,264 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632922428] [2022-02-20 18:57:04,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:04,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:57:04,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:04,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:04,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:04,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:04,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:04,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:04,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:04,348 INFO L87 Difference]: Start difference. First operand has 143 states, 141 states have (on average 1.75177304964539) internal successors, (247), 142 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:04,732 INFO L93 Difference]: Finished difference Result 317 states and 535 transitions. [2022-02-20 18:57:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:04,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:57:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-02-20 18:57:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-02-20 18:57:04,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 535 transitions. [2022-02-20 18:57:05,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:05,125 INFO L225 Difference]: With dead ends: 317 [2022-02-20 18:57:05,125 INFO L226 Difference]: Without dead ends: 219 [2022-02-20 18:57:05,128 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:57:05,130 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 144 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:05,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 440 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-02-20 18:57:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2022-02-20 18:57:05,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:05,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 217 states, 216 states have (on average 1.587962962962963) internal successors, (343), 216 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:05,189 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 217 states, 216 states have (on average 1.587962962962963) internal successors, (343), 216 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:05,190 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 217 states, 216 states have (on average 1.587962962962963) internal successors, (343), 216 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:05,197 INFO L93 Difference]: Finished difference Result 219 states and 344 transitions. [2022-02-20 18:57:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 344 transitions. [2022-02-20 18:57:05,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:05,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:05,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 216 states have (on average 1.587962962962963) internal successors, (343), 216 states have internal predecessors, (343), 0 states have call successors, (0), 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 219 states. [2022-02-20 18:57:05,199 INFO L87 Difference]: Start difference. First operand has 217 states, 216 states have (on average 1.587962962962963) internal successors, (343), 216 states have internal predecessors, (343), 0 states have call successors, (0), 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 219 states. [2022-02-20 18:57:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:05,206 INFO L93 Difference]: Finished difference Result 219 states and 344 transitions. [2022-02-20 18:57:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 344 transitions. [2022-02-20 18:57:05,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:05,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:05,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:05,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.587962962962963) internal successors, (343), 216 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 343 transitions. [2022-02-20 18:57:05,217 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 343 transitions. Word has length 56 [2022-02-20 18:57:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:05,217 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 343 transitions. [2022-02-20 18:57:05,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 343 transitions. [2022-02-20 18:57:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:57:05,231 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:05,231 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] [2022-02-20 18:57:05,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:57:05,232 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:05,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash -452034936, now seen corresponding path program 1 times [2022-02-20 18:57:05,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:05,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346609691] [2022-02-20 18:57:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:05,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:05,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {1307#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_1911~0 := 0;~__return_2060~0 := 0;~__return_2167~0 := 0; {1307#true} is VALID [2022-02-20 18:57:05,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {1307#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {1307#true} is VALID [2022-02-20 18:57:05,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {1307#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1307#true} is VALID [2022-02-20 18:57:05,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {1307#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1307#true} is VALID [2022-02-20 18:57:05,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {1307#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1307#true} is VALID [2022-02-20 18:57:05,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {1307#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1307#true} is VALID [2022-02-20 18:57:05,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {1307#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1307#true} is VALID [2022-02-20 18:57:05,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {1307#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1307#true} is VALID [2022-02-20 18:57:05,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {1307#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1307#true} is VALID [2022-02-20 18:57:05,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {1307#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1307#true} is VALID [2022-02-20 18:57:05,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {1307#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1307#true} is VALID [2022-02-20 18:57:05,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {1307#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1307#true} is VALID [2022-02-20 18:57:05,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {1307#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1307#true} is VALID [2022-02-20 18:57:05,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {1307#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1307#true} is VALID [2022-02-20 18:57:05,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {1307#true} assume ~id1~0 != ~id2~0; {1307#true} is VALID [2022-02-20 18:57:05,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {1307#true} assume ~id1~0 != ~id3~0; {1307#true} is VALID [2022-02-20 18:57:05,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {1307#true} assume ~id2~0 != ~id3~0; {1307#true} is VALID [2022-02-20 18:57:05,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {1307#true} assume ~id1~0 >= 0; {1307#true} is VALID [2022-02-20 18:57:05,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {1307#true} assume ~id2~0 >= 0; {1307#true} is VALID [2022-02-20 18:57:05,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {1307#true} assume ~id3~0 >= 0; {1307#true} is VALID [2022-02-20 18:57:05,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {1307#true} assume 0 == ~r1~0; {1307#true} is VALID [2022-02-20 18:57:05,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {1307#true} assume 0 == ~r2~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {1309#(<= ~r2~0 0)} assume 0 == ~r3~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {1309#(<= ~r2~0 0)} assume ~max1~0 == ~id1~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {1309#(<= ~r2~0 0)} assume ~max2~0 == ~id2~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {1309#(<= ~r2~0 0)} assume ~max3~0 == ~id3~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {1309#(<= ~r2~0 0)} assume 0 == ~st1~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {1309#(<= ~r2~0 0)} assume 0 == ~st2~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {1309#(<= ~r2~0 0)} assume 0 == ~st3~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {1309#(<= ~r2~0 0)} assume 0 == ~nl1~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {1309#(<= ~r2~0 0)} assume 0 == ~nl2~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {1309#(<= ~r2~0 0)} assume 0 == ~nl3~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {1309#(<= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {1309#(<= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {1309#(<= ~r2~0 0)} assume 0 == ~mode3~0 % 256; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {1309#(<= ~r2~0 0)} assume !(0 == ~newmax1~0 % 256); {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {1309#(<= ~r2~0 0)} assume !(0 == ~newmax2~0 % 256); {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {1309#(<= ~r2~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1911~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1911~0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {1309#(<= ~r2~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {1309#(<= ~r2~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {1309#(<= ~r2~0 0)} assume !!(0 == ~mode1~0 % 256); {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {1309#(<= ~r2~0 0)} assume ~r1~0 < 2; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {1309#(<= ~r2~0 0)} assume !!(0 == ~ep12~0 % 256); {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {1309#(<= ~r2~0 0)} assume !!(0 == ~ep13~0 % 256); {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {1309#(<= ~r2~0 0)} ~mode1~0 := 1; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {1309#(<= ~r2~0 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {1309#(<= ~r2~0 0)} assume !!(0 == ~mode2~0 % 256); {1309#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:05,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {1309#(<= ~r2~0 0)} assume !(~r2~0 < 2); {1308#false} is VALID [2022-02-20 18:57:05,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {1308#false} ~mode2~0 := 1; {1308#false} is VALID [2022-02-20 18:57:05,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {1308#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {1308#false} is VALID [2022-02-20 18:57:05,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {1308#false} assume !!(0 == ~mode3~0 % 256); {1308#false} is VALID [2022-02-20 18:57:05,367 INFO L290 TraceCheckUtils]: 51: Hoare triple {1308#false} assume !(~r3~0 < 2); {1308#false} is VALID [2022-02-20 18:57:05,367 INFO L290 TraceCheckUtils]: 52: Hoare triple {1308#false} ~mode3~0 := 1; {1308#false} is VALID [2022-02-20 18:57:05,367 INFO L290 TraceCheckUtils]: 53: Hoare triple {1308#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1308#false} is VALID [2022-02-20 18:57:05,367 INFO L290 TraceCheckUtils]: 54: Hoare triple {1308#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1308#false} is VALID [2022-02-20 18:57:05,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {1308#false} ~__return_2060~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2060~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; {1308#false} is VALID [2022-02-20 18:57:05,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {1308#false} assume 0 == main_~assert__arg~0#1 % 256; {1308#false} is VALID [2022-02-20 18:57:05,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {1308#false} assume !false; {1308#false} is VALID [2022-02-20 18:57:05,370 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:57:05,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:05,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346609691] [2022-02-20 18:57:05,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346609691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:05,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:05,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:05,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902413223] [2022-02-20 18:57:05,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:05,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:57:05,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:05,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:05,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:05,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:05,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:05,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:05,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:05,406 INFO L87 Difference]: Start difference. First operand 217 states and 343 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:05,706 INFO L93 Difference]: Finished difference Result 533 states and 863 transitions. [2022-02-20 18:57:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:05,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:57:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-02-20 18:57:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-02-20 18:57:05,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 502 transitions. [2022-02-20 18:57:06,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:06,053 INFO L225 Difference]: With dead ends: 533 [2022-02-20 18:57:06,054 INFO L226 Difference]: Without dead ends: 367 [2022-02-20 18:57:06,054 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:57:06,055 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 125 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:06,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 409 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:06,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-02-20 18:57:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2022-02-20 18:57:06,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:06,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand has 365 states, 364 states have (on average 1.60989010989011) internal successors, (586), 364 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:06,142 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand has 365 states, 364 states have (on average 1.60989010989011) internal successors, (586), 364 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:06,143 INFO L87 Difference]: Start difference. First operand 367 states. Second operand has 365 states, 364 states have (on average 1.60989010989011) internal successors, (586), 364 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:06,154 INFO L93 Difference]: Finished difference Result 367 states and 587 transitions. [2022-02-20 18:57:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2022-02-20 18:57:06,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:06,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:06,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 364 states have (on average 1.60989010989011) internal successors, (586), 364 states have internal predecessors, (586), 0 states have call successors, (0), 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 367 states. [2022-02-20 18:57:06,157 INFO L87 Difference]: Start difference. First operand has 365 states, 364 states have (on average 1.60989010989011) internal successors, (586), 364 states have internal predecessors, (586), 0 states have call successors, (0), 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 367 states. [2022-02-20 18:57:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:06,169 INFO L93 Difference]: Finished difference Result 367 states and 587 transitions. [2022-02-20 18:57:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2022-02-20 18:57:06,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:06,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:06,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:06,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.60989010989011) internal successors, (586), 364 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 586 transitions. [2022-02-20 18:57:06,184 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 586 transitions. Word has length 58 [2022-02-20 18:57:06,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:06,185 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 586 transitions. [2022-02-20 18:57:06,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 586 transitions. [2022-02-20 18:57:06,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:57:06,188 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:06,188 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] [2022-02-20 18:57:06,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:57:06,189 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:06,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1416370665, now seen corresponding path program 1 times [2022-02-20 18:57:06,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:06,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953778759] [2022-02-20 18:57:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:06,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {3279#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_1911~0 := 0;~__return_2060~0 := 0;~__return_2167~0 := 0; {3279#true} is VALID [2022-02-20 18:57:06,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {3279#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {3279#true} is VALID [2022-02-20 18:57:06,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {3279#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {3279#true} is VALID [2022-02-20 18:57:06,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {3279#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {3279#true} is VALID [2022-02-20 18:57:06,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {3279#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {3279#true} is VALID [2022-02-20 18:57:06,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {3279#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {3279#true} is VALID [2022-02-20 18:57:06,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {3279#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {3279#true} is VALID [2022-02-20 18:57:06,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {3279#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {3279#true} is VALID [2022-02-20 18:57:06,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {3279#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {3279#true} is VALID [2022-02-20 18:57:06,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {3279#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {3279#true} is VALID [2022-02-20 18:57:06,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {3279#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {3279#true} is VALID [2022-02-20 18:57:06,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {3279#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {3279#true} is VALID [2022-02-20 18:57:06,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {3279#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {3279#true} is VALID [2022-02-20 18:57:06,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {3279#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {3279#true} is VALID [2022-02-20 18:57:06,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {3279#true} assume ~id1~0 != ~id2~0; {3279#true} is VALID [2022-02-20 18:57:06,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {3279#true} assume ~id1~0 != ~id3~0; {3279#true} is VALID [2022-02-20 18:57:06,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {3279#true} assume ~id2~0 != ~id3~0; {3279#true} is VALID [2022-02-20 18:57:06,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {3279#true} assume ~id1~0 >= 0; {3279#true} is VALID [2022-02-20 18:57:06,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {3279#true} assume ~id2~0 >= 0; {3279#true} is VALID [2022-02-20 18:57:06,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {3279#true} assume ~id3~0 >= 0; {3279#true} is VALID [2022-02-20 18:57:06,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {3279#true} assume 0 == ~r1~0; {3279#true} is VALID [2022-02-20 18:57:06,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {3279#true} assume 0 == ~r2~0; {3279#true} is VALID [2022-02-20 18:57:06,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {3279#true} assume 0 == ~r3~0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {3281#(<= ~r3~0 0)} assume ~max1~0 == ~id1~0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {3281#(<= ~r3~0 0)} assume ~max2~0 == ~id2~0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {3281#(<= ~r3~0 0)} assume ~max3~0 == ~id3~0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {3281#(<= ~r3~0 0)} assume 0 == ~st1~0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {3281#(<= ~r3~0 0)} assume 0 == ~st2~0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {3281#(<= ~r3~0 0)} assume 0 == ~st3~0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {3281#(<= ~r3~0 0)} assume 0 == ~nl1~0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {3281#(<= ~r3~0 0)} assume 0 == ~nl2~0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {3281#(<= ~r3~0 0)} assume 0 == ~nl3~0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {3281#(<= ~r3~0 0)} assume 0 == ~mode1~0 % 256; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {3281#(<= ~r3~0 0)} assume 0 == ~mode2~0 % 256; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {3281#(<= ~r3~0 0)} assume 0 == ~mode3~0 % 256; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {3281#(<= ~r3~0 0)} assume !(0 == ~newmax1~0 % 256); {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {3281#(<= ~r3~0 0)} assume !(0 == ~newmax2~0 % 256); {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {3281#(<= ~r3~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1911~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1911~0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {3281#(<= ~r3~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {3281#(<= ~r3~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {3281#(<= ~r3~0 0)} assume !!(0 == ~mode1~0 % 256); {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {3281#(<= ~r3~0 0)} assume ~r1~0 < 2; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {3281#(<= ~r3~0 0)} assume !!(0 == ~ep12~0 % 256); {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {3281#(<= ~r3~0 0)} assume !!(0 == ~ep13~0 % 256); {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {3281#(<= ~r3~0 0)} ~mode1~0 := 1; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {3281#(<= ~r3~0 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {3281#(<= ~r3~0 0)} assume !!(0 == ~mode2~0 % 256); {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {3281#(<= ~r3~0 0)} assume ~r2~0 < 2; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {3281#(<= ~r3~0 0)} assume !!(0 == ~ep21~0 % 256); {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {3281#(<= ~r3~0 0)} assume !!(0 == ~ep23~0 % 256); {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {3281#(<= ~r3~0 0)} ~mode2~0 := 1; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {3281#(<= ~r3~0 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {3281#(<= ~r3~0 0)} assume !!(0 == ~mode3~0 % 256); {3281#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:06,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {3281#(<= ~r3~0 0)} assume !(~r3~0 < 2); {3280#false} is VALID [2022-02-20 18:57:06,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {3280#false} ~mode3~0 := 1; {3280#false} is VALID [2022-02-20 18:57:06,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {3280#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3280#false} is VALID [2022-02-20 18:57:06,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {3280#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3280#false} is VALID [2022-02-20 18:57:06,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {3280#false} ~__return_2060~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2060~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; {3280#false} is VALID [2022-02-20 18:57:06,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {3280#false} assume 0 == main_~assert__arg~0#1 % 256; {3280#false} is VALID [2022-02-20 18:57:06,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {3280#false} assume !false; {3280#false} is VALID [2022-02-20 18:57:06,322 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:57:06,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:06,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953778759] [2022-02-20 18:57:06,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953778759] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:06,323 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:06,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:06,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712769210] [2022-02-20 18:57:06,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:06,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:57:06,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:06,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:06,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:06,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:06,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:06,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:06,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:06,356 INFO L87 Difference]: Start difference. First operand 365 states and 586 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:06,779 INFO L93 Difference]: Finished difference Result 961 states and 1564 transitions. [2022-02-20 18:57:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:06,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:57:06,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-02-20 18:57:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-02-20 18:57:06,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 502 transitions. [2022-02-20 18:57:07,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:07,142 INFO L225 Difference]: With dead ends: 961 [2022-02-20 18:57:07,142 INFO L226 Difference]: Without dead ends: 647 [2022-02-20 18:57:07,143 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:57:07,144 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 119 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:07,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 410 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-02-20 18:57:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2022-02-20 18:57:07,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:07,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 647 states. Second operand has 645 states, 644 states have (on average 1.6180124223602483) internal successors, (1042), 644 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,337 INFO L74 IsIncluded]: Start isIncluded. First operand 647 states. Second operand has 645 states, 644 states have (on average 1.6180124223602483) internal successors, (1042), 644 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,338 INFO L87 Difference]: Start difference. First operand 647 states. Second operand has 645 states, 644 states have (on average 1.6180124223602483) internal successors, (1042), 644 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:07,356 INFO L93 Difference]: Finished difference Result 647 states and 1043 transitions. [2022-02-20 18:57:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1043 transitions. [2022-02-20 18:57:07,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:07,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:07,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 645 states, 644 states have (on average 1.6180124223602483) internal successors, (1042), 644 states have internal predecessors, (1042), 0 states have call successors, (0), 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 647 states. [2022-02-20 18:57:07,360 INFO L87 Difference]: Start difference. First operand has 645 states, 644 states have (on average 1.6180124223602483) internal successors, (1042), 644 states have internal predecessors, (1042), 0 states have call successors, (0), 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 647 states. [2022-02-20 18:57:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:07,378 INFO L93 Difference]: Finished difference Result 647 states and 1043 transitions. [2022-02-20 18:57:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1043 transitions. [2022-02-20 18:57:07,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:07,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:07,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:07,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.6180124223602483) internal successors, (1042), 644 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1042 transitions. [2022-02-20 18:57:07,402 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1042 transitions. Word has length 60 [2022-02-20 18:57:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:07,403 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 1042 transitions. [2022-02-20 18:57:07,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1042 transitions. [2022-02-20 18:57:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:57:07,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:07,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:07,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:57:07,405 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:07,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:07,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2105142966, now seen corresponding path program 1 times [2022-02-20 18:57:07,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:07,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175660953] [2022-02-20 18:57:07,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:07,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:07,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {6812#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_1911~0 := 0;~__return_2060~0 := 0;~__return_2167~0 := 0; {6812#true} is VALID [2022-02-20 18:57:07,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {6812#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {6812#true} is VALID [2022-02-20 18:57:07,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {6812#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {6812#true} is VALID [2022-02-20 18:57:07,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {6812#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {6812#true} is VALID [2022-02-20 18:57:07,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {6812#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {6812#true} is VALID [2022-02-20 18:57:07,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {6812#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {6812#true} is VALID [2022-02-20 18:57:07,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {6812#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {6812#true} is VALID [2022-02-20 18:57:07,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {6812#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {6812#true} is VALID [2022-02-20 18:57:07,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {6812#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {6812#true} is VALID [2022-02-20 18:57:07,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {6812#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {6812#true} is VALID [2022-02-20 18:57:07,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {6812#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {6812#true} is VALID [2022-02-20 18:57:07,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {6812#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {6812#true} is VALID [2022-02-20 18:57:07,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {6812#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {6812#true} is VALID [2022-02-20 18:57:07,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {6812#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {6812#true} is VALID [2022-02-20 18:57:07,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {6812#true} assume ~id1~0 != ~id2~0; {6812#true} is VALID [2022-02-20 18:57:07,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {6812#true} assume ~id1~0 != ~id3~0; {6812#true} is VALID [2022-02-20 18:57:07,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {6812#true} assume ~id2~0 != ~id3~0; {6812#true} is VALID [2022-02-20 18:57:07,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {6812#true} assume ~id1~0 >= 0; {6812#true} is VALID [2022-02-20 18:57:07,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {6812#true} assume ~id2~0 >= 0; {6812#true} is VALID [2022-02-20 18:57:07,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {6812#true} assume ~id3~0 >= 0; {6812#true} is VALID [2022-02-20 18:57:07,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {6812#true} assume 0 == ~r1~0; {6812#true} is VALID [2022-02-20 18:57:07,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {6812#true} assume 0 == ~r2~0; {6812#true} is VALID [2022-02-20 18:57:07,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {6812#true} assume 0 == ~r3~0; {6812#true} is VALID [2022-02-20 18:57:07,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {6812#true} assume ~max1~0 == ~id1~0; {6812#true} is VALID [2022-02-20 18:57:07,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {6812#true} assume ~max2~0 == ~id2~0; {6812#true} is VALID [2022-02-20 18:57:07,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {6812#true} assume ~max3~0 == ~id3~0; {6812#true} is VALID [2022-02-20 18:57:07,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {6812#true} assume 0 == ~st1~0; {6814#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:07,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {6814#(<= ~st1~0 0)} assume 0 == ~st2~0; {6815#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {6815#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,489 INFO L290 TraceCheckUtils]: 36: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1911~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1911~0; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,491 INFO L290 TraceCheckUtils]: 39: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,491 INFO L290 TraceCheckUtils]: 40: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,491 INFO L290 TraceCheckUtils]: 41: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 2; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,493 INFO L290 TraceCheckUtils]: 47: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 < 2; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,494 INFO L290 TraceCheckUtils]: 50: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,495 INFO L290 TraceCheckUtils]: 51: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 < 2; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,496 INFO L290 TraceCheckUtils]: 54: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:07,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {6816#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {6813#false} is VALID [2022-02-20 18:57:07,497 INFO L290 TraceCheckUtils]: 59: Hoare triple {6813#false} ~__return_2060~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2060~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; {6813#false} is VALID [2022-02-20 18:57:07,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {6813#false} assume 0 == main_~assert__arg~0#1 % 256; {6813#false} is VALID [2022-02-20 18:57:07,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {6813#false} assume !false; {6813#false} is VALID [2022-02-20 18:57:07,498 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:57:07,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:07,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175660953] [2022-02-20 18:57:07,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175660953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:07,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:07,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:57:07,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071964580] [2022-02-20 18:57:07,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:07,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:57:07,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:07,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:07,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:07,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:57:07,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:07,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:57:07,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:57:07,558 INFO L87 Difference]: Start difference. First operand 645 states and 1042 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:10,010 INFO L93 Difference]: Finished difference Result 2801 states and 4612 transitions. [2022-02-20 18:57:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:57:10,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:57:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1112 transitions. [2022-02-20 18:57:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1112 transitions. [2022-02-20 18:57:10,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1112 transitions. [2022-02-20 18:57:10,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1112 edges. 1112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:10,934 INFO L225 Difference]: With dead ends: 2801 [2022-02-20 18:57:10,934 INFO L226 Difference]: Without dead ends: 2207 [2022-02-20 18:57:10,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:57:10,937 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 856 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:10,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [856 Valid, 1594 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:57:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2022-02-20 18:57:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 1164. [2022-02-20 18:57:11,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:11,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2207 states. Second operand has 1164 states, 1163 states have (on average 1.6268271711092004) internal successors, (1892), 1163 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:11,677 INFO L74 IsIncluded]: Start isIncluded. First operand 2207 states. Second operand has 1164 states, 1163 states have (on average 1.6268271711092004) internal successors, (1892), 1163 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:11,678 INFO L87 Difference]: Start difference. First operand 2207 states. Second operand has 1164 states, 1163 states have (on average 1.6268271711092004) internal successors, (1892), 1163 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:11,823 INFO L93 Difference]: Finished difference Result 2207 states and 3613 transitions. [2022-02-20 18:57:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3613 transitions. [2022-02-20 18:57:11,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:11,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:11,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 1164 states, 1163 states have (on average 1.6268271711092004) internal successors, (1892), 1163 states have internal predecessors, (1892), 0 states have call successors, (0), 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 2207 states. [2022-02-20 18:57:11,830 INFO L87 Difference]: Start difference. First operand has 1164 states, 1163 states have (on average 1.6268271711092004) internal successors, (1892), 1163 states have internal predecessors, (1892), 0 states have call successors, (0), 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 2207 states. [2022-02-20 18:57:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:11,972 INFO L93 Difference]: Finished difference Result 2207 states and 3613 transitions. [2022-02-20 18:57:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3613 transitions. [2022-02-20 18:57:11,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:11,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:11,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:11,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.6268271711092004) internal successors, (1892), 1163 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1892 transitions. [2022-02-20 18:57:12,038 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1892 transitions. Word has length 62 [2022-02-20 18:57:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:12,038 INFO L470 AbstractCegarLoop]: Abstraction has 1164 states and 1892 transitions. [2022-02-20 18:57:12,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1892 transitions. [2022-02-20 18:57:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:57:12,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:12,041 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] [2022-02-20 18:57:12,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:57:12,041 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash -897426710, now seen corresponding path program 1 times [2022-02-20 18:57:12,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:12,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007593954] [2022-02-20 18:57:12,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:12,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:12,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {16786#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_1911~0 := 0;~__return_2060~0 := 0;~__return_2167~0 := 0; {16786#true} is VALID [2022-02-20 18:57:12,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {16786#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {16786#true} is VALID [2022-02-20 18:57:12,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {16786#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {16786#true} is VALID [2022-02-20 18:57:12,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {16786#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {16786#true} is VALID [2022-02-20 18:57:12,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {16786#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {16786#true} is VALID [2022-02-20 18:57:12,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {16786#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {16786#true} is VALID [2022-02-20 18:57:12,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {16786#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {16786#true} is VALID [2022-02-20 18:57:12,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {16786#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {16786#true} is VALID [2022-02-20 18:57:12,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {16786#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {16786#true} is VALID [2022-02-20 18:57:12,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {16786#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {16786#true} is VALID [2022-02-20 18:57:12,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {16786#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {16786#true} is VALID [2022-02-20 18:57:12,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {16786#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {16786#true} is VALID [2022-02-20 18:57:12,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {16786#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {16786#true} is VALID [2022-02-20 18:57:12,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {16786#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {16786#true} is VALID [2022-02-20 18:57:12,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {16786#true} assume ~id1~0 != ~id2~0; {16786#true} is VALID [2022-02-20 18:57:12,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {16786#true} assume ~id1~0 != ~id3~0; {16786#true} is VALID [2022-02-20 18:57:12,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {16786#true} assume ~id2~0 != ~id3~0; {16786#true} is VALID [2022-02-20 18:57:12,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {16786#true} assume ~id1~0 >= 0; {16786#true} is VALID [2022-02-20 18:57:12,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {16786#true} assume ~id2~0 >= 0; {16786#true} is VALID [2022-02-20 18:57:12,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {16786#true} assume ~id3~0 >= 0; {16786#true} is VALID [2022-02-20 18:57:12,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {16786#true} assume 0 == ~r1~0; {16786#true} is VALID [2022-02-20 18:57:12,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {16786#true} assume 0 == ~r2~0; {16786#true} is VALID [2022-02-20 18:57:12,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {16786#true} assume 0 == ~r3~0; {16786#true} is VALID [2022-02-20 18:57:12,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {16786#true} assume ~max1~0 == ~id1~0; {16786#true} is VALID [2022-02-20 18:57:12,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {16786#true} assume ~max2~0 == ~id2~0; {16786#true} is VALID [2022-02-20 18:57:12,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {16786#true} assume ~max3~0 == ~id3~0; {16786#true} is VALID [2022-02-20 18:57:12,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {16786#true} assume 0 == ~st1~0; {16788#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:12,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {16788#(<= ~st1~0 0)} assume 0 == ~st2~0; {16788#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:12,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {16788#(<= ~st1~0 0)} assume 0 == ~st3~0; {16788#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:12,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {16788#(<= ~st1~0 0)} assume 0 == ~nl1~0; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1911~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1911~0; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 < 2; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 < 2; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,168 INFO L290 TraceCheckUtils]: 51: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 < 2; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,169 INFO L290 TraceCheckUtils]: 55: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,170 INFO L290 TraceCheckUtils]: 57: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,170 INFO L290 TraceCheckUtils]: 58: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16789#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:12,171 INFO L290 TraceCheckUtils]: 59: Hoare triple {16789#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {16787#false} is VALID [2022-02-20 18:57:12,171 INFO L290 TraceCheckUtils]: 60: Hoare triple {16787#false} ~__return_2060~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2060~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; {16787#false} is VALID [2022-02-20 18:57:12,171 INFO L290 TraceCheckUtils]: 61: Hoare triple {16787#false} assume 0 == main_~assert__arg~0#1 % 256; {16787#false} is VALID [2022-02-20 18:57:12,171 INFO L290 TraceCheckUtils]: 62: Hoare triple {16787#false} assume !false; {16787#false} is VALID [2022-02-20 18:57:12,174 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:57:12,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:12,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007593954] [2022-02-20 18:57:12,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007593954] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:12,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:12,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:57:12,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675699496] [2022-02-20 18:57:12,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:12,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:57:12,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:12,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:12,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:12,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:57:12,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:57:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:57:12,217 INFO L87 Difference]: Start difference. First operand 1164 states and 1892 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:14,607 INFO L93 Difference]: Finished difference Result 3403 states and 5593 transitions. [2022-02-20 18:57:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:57:14,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:57:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2022-02-20 18:57:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2022-02-20 18:57:14,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 665 transitions. [2022-02-20 18:57:15,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 665 edges. 665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:15,241 INFO L225 Difference]: With dead ends: 3403 [2022-02-20 18:57:15,241 INFO L226 Difference]: Without dead ends: 2290 [2022-02-20 18:57:15,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:57:15,243 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 430 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:15,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 737 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2022-02-20 18:57:16,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 1718. [2022-02-20 18:57:16,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:16,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2290 states. Second operand has 1718 states, 1717 states have (on average 1.6319161327897496) internal successors, (2802), 1717 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:16,469 INFO L74 IsIncluded]: Start isIncluded. First operand 2290 states. Second operand has 1718 states, 1717 states have (on average 1.6319161327897496) internal successors, (2802), 1717 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:16,471 INFO L87 Difference]: Start difference. First operand 2290 states. Second operand has 1718 states, 1717 states have (on average 1.6319161327897496) internal successors, (2802), 1717 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:16,627 INFO L93 Difference]: Finished difference Result 2290 states and 3756 transitions. [2022-02-20 18:57:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3756 transitions. [2022-02-20 18:57:16,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:16,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:16,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 1718 states, 1717 states have (on average 1.6319161327897496) internal successors, (2802), 1717 states have internal predecessors, (2802), 0 states have call successors, (0), 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 2290 states. [2022-02-20 18:57:16,635 INFO L87 Difference]: Start difference. First operand has 1718 states, 1717 states have (on average 1.6319161327897496) internal successors, (2802), 1717 states have internal predecessors, (2802), 0 states have call successors, (0), 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 2290 states. [2022-02-20 18:57:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:16,792 INFO L93 Difference]: Finished difference Result 2290 states and 3756 transitions. [2022-02-20 18:57:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3756 transitions. [2022-02-20 18:57:16,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:16,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:16,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:16,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1717 states have (on average 1.6319161327897496) internal successors, (2802), 1717 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2802 transitions. [2022-02-20 18:57:16,924 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2802 transitions. Word has length 63 [2022-02-20 18:57:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:16,924 INFO L470 AbstractCegarLoop]: Abstraction has 1718 states and 2802 transitions. [2022-02-20 18:57:16,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2802 transitions. [2022-02-20 18:57:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:57:16,925 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57: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] [2022-02-20 18:57:16,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:57:16,926 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash -384729531, now seen corresponding path program 1 times [2022-02-20 18:57:16,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:16,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114822333] [2022-02-20 18:57:16,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:16,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {28548#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_1911~0 := 0;~__return_2060~0 := 0;~__return_2167~0 := 0; {28548#true} is VALID [2022-02-20 18:57:16,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {28548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {28548#true} is VALID [2022-02-20 18:57:16,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {28548#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {28548#true} is VALID [2022-02-20 18:57:16,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {28548#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {28548#true} is VALID [2022-02-20 18:57:16,999 INFO L290 TraceCheckUtils]: 4: Hoare triple {28548#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {28548#true} is VALID [2022-02-20 18:57:16,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {28548#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {28548#true} is VALID [2022-02-20 18:57:17,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {28548#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {28548#true} is VALID [2022-02-20 18:57:17,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {28548#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {28548#true} is VALID [2022-02-20 18:57:17,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {28548#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {28548#true} is VALID [2022-02-20 18:57:17,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {28548#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {28548#true} is VALID [2022-02-20 18:57:17,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {28548#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {28548#true} is VALID [2022-02-20 18:57:17,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {28548#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {28548#true} is VALID [2022-02-20 18:57:17,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {28548#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {28548#true} is VALID [2022-02-20 18:57:17,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {28548#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {28548#true} is VALID [2022-02-20 18:57:17,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {28548#true} assume ~id1~0 != ~id2~0; {28548#true} is VALID [2022-02-20 18:57:17,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {28548#true} assume ~id1~0 != ~id3~0; {28548#true} is VALID [2022-02-20 18:57:17,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {28548#true} assume ~id2~0 != ~id3~0; {28548#true} is VALID [2022-02-20 18:57:17,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {28548#true} assume ~id1~0 >= 0; {28548#true} is VALID [2022-02-20 18:57:17,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {28548#true} assume ~id2~0 >= 0; {28548#true} is VALID [2022-02-20 18:57:17,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {28548#true} assume ~id3~0 >= 0; {28548#true} is VALID [2022-02-20 18:57:17,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {28548#true} assume 0 == ~r1~0; {28548#true} is VALID [2022-02-20 18:57:17,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {28548#true} assume 0 == ~r2~0; {28548#true} is VALID [2022-02-20 18:57:17,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {28548#true} assume 0 == ~r3~0; {28548#true} is VALID [2022-02-20 18:57:17,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {28548#true} assume ~max1~0 == ~id1~0; {28548#true} is VALID [2022-02-20 18:57:17,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {28548#true} assume ~max2~0 == ~id2~0; {28548#true} is VALID [2022-02-20 18:57:17,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {28548#true} assume ~max3~0 == ~id3~0; {28548#true} is VALID [2022-02-20 18:57:17,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {28548#true} assume 0 == ~st1~0; {28548#true} is VALID [2022-02-20 18:57:17,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {28548#true} assume 0 == ~st2~0; {28548#true} is VALID [2022-02-20 18:57:17,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {28548#true} assume 0 == ~st3~0; {28548#true} is VALID [2022-02-20 18:57:17,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {28548#true} assume 0 == ~nl1~0; {28548#true} is VALID [2022-02-20 18:57:17,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {28548#true} assume 0 == ~nl2~0; {28548#true} is VALID [2022-02-20 18:57:17,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {28548#true} assume 0 == ~nl3~0; {28548#true} is VALID [2022-02-20 18:57:17,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {28548#true} assume 0 == ~mode1~0 % 256; {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:57:17,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:57:17,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:57:17,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax1~0 % 256); {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:57:17,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax2~0 % 256); {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:57:17,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1911~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1911~0; {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:57:17,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:57:17,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:57:17,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {28550#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {28549#false} is VALID [2022-02-20 18:57:17,009 INFO L290 TraceCheckUtils]: 41: Hoare triple {28549#false} assume !!(0 == ~ep21~0 % 256); {28549#false} is VALID [2022-02-20 18:57:17,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {28549#false} assume !!(0 == ~ep31~0 % 256); {28549#false} is VALID [2022-02-20 18:57:17,009 INFO L290 TraceCheckUtils]: 43: Hoare triple {28549#false} ~newmax1~0 := main_~node1__newmax~0#1; {28549#false} is VALID [2022-02-20 18:57:17,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {28549#false} assume 2 == ~r1~0; {28549#false} is VALID [2022-02-20 18:57:17,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {28549#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {28549#false} is VALID [2022-02-20 18:57:17,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {28549#false} ~mode1~0 := 0; {28549#false} is VALID [2022-02-20 18:57:17,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {28549#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {28549#false} is VALID [2022-02-20 18:57:17,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {28549#false} assume !!(0 == ~mode2~0 % 256); {28549#false} is VALID [2022-02-20 18:57:17,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {28549#false} assume ~r2~0 < 2; {28549#false} is VALID [2022-02-20 18:57:17,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {28549#false} assume !!(0 == ~ep21~0 % 256); {28549#false} is VALID [2022-02-20 18:57:17,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {28549#false} assume !!(0 == ~ep23~0 % 256); {28549#false} is VALID [2022-02-20 18:57:17,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {28549#false} ~mode2~0 := 1; {28549#false} is VALID [2022-02-20 18:57:17,010 INFO L290 TraceCheckUtils]: 53: Hoare triple {28549#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {28549#false} is VALID [2022-02-20 18:57:17,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {28549#false} assume !!(0 == ~mode3~0 % 256); {28549#false} is VALID [2022-02-20 18:57:17,011 INFO L290 TraceCheckUtils]: 55: Hoare triple {28549#false} assume ~r3~0 < 2; {28549#false} is VALID [2022-02-20 18:57:17,011 INFO L290 TraceCheckUtils]: 56: Hoare triple {28549#false} assume !!(0 == ~ep31~0 % 256); {28549#false} is VALID [2022-02-20 18:57:17,011 INFO L290 TraceCheckUtils]: 57: Hoare triple {28549#false} assume !!(0 == ~ep32~0 % 256); {28549#false} is VALID [2022-02-20 18:57:17,011 INFO L290 TraceCheckUtils]: 58: Hoare triple {28549#false} ~mode3~0 := 1; {28549#false} is VALID [2022-02-20 18:57:17,011 INFO L290 TraceCheckUtils]: 59: Hoare triple {28549#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {28549#false} is VALID [2022-02-20 18:57:17,011 INFO L290 TraceCheckUtils]: 60: Hoare triple {28549#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {28549#false} is VALID [2022-02-20 18:57:17,011 INFO L290 TraceCheckUtils]: 61: Hoare triple {28549#false} ~__return_2060~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2060~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; {28549#false} is VALID [2022-02-20 18:57:17,012 INFO L290 TraceCheckUtils]: 62: Hoare triple {28549#false} assume 0 == main_~assert__arg~0#1 % 256; {28549#false} is VALID [2022-02-20 18:57:17,012 INFO L290 TraceCheckUtils]: 63: Hoare triple {28549#false} assume !false; {28549#false} is VALID [2022-02-20 18:57:17,012 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:57:17,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:17,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114822333] [2022-02-20 18:57:17,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114822333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:17,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:17,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:17,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557376890] [2022-02-20 18:57:17,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:17,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:57:17,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:17,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:17,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:17,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:17,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:17,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:17,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:17,048 INFO L87 Difference]: Start difference. First operand 1718 states and 2802 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:19,564 INFO L93 Difference]: Finished difference Result 3773 states and 6212 transitions. [2022-02-20 18:57:19,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:19,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:57:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:57:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:57:19,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 479 transitions. [2022-02-20 18:57:19,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:20,117 INFO L225 Difference]: With dead ends: 3773 [2022-02-20 18:57:20,117 INFO L226 Difference]: Without dead ends: 2585 [2022-02-20 18:57:20,118 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:57:20,119 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 132 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:20,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 500 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2022-02-20 18:57:21,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2583. [2022-02-20 18:57:21,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:21,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2585 states. Second operand has 2583 states, 2582 states have (on average 1.6347792408985282) internal successors, (4221), 2582 states have internal predecessors, (4221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:21,748 INFO L74 IsIncluded]: Start isIncluded. First operand 2585 states. Second operand has 2583 states, 2582 states have (on average 1.6347792408985282) internal successors, (4221), 2582 states have internal predecessors, (4221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:21,750 INFO L87 Difference]: Start difference. First operand 2585 states. Second operand has 2583 states, 2582 states have (on average 1.6347792408985282) internal successors, (4221), 2582 states have internal predecessors, (4221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:21,932 INFO L93 Difference]: Finished difference Result 2585 states and 4222 transitions. [2022-02-20 18:57:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 4222 transitions. [2022-02-20 18:57:21,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:21,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:21,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 2583 states, 2582 states have (on average 1.6347792408985282) internal successors, (4221), 2582 states have internal predecessors, (4221), 0 states have call successors, (0), 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 2585 states. [2022-02-20 18:57:21,940 INFO L87 Difference]: Start difference. First operand has 2583 states, 2582 states have (on average 1.6347792408985282) internal successors, (4221), 2582 states have internal predecessors, (4221), 0 states have call successors, (0), 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 2585 states. [2022-02-20 18:57:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:22,141 INFO L93 Difference]: Finished difference Result 2585 states and 4222 transitions. [2022-02-20 18:57:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 4222 transitions. [2022-02-20 18:57:22,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:22,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:22,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:22,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 2582 states have (on average 1.6347792408985282) internal successors, (4221), 2582 states have internal predecessors, (4221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4221 transitions. [2022-02-20 18:57:22,416 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4221 transitions. Word has length 64 [2022-02-20 18:57:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:22,416 INFO L470 AbstractCegarLoop]: Abstraction has 2583 states and 4221 transitions. [2022-02-20 18:57:22,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4221 transitions. [2022-02-20 18:57:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:57:22,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:22,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:22,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:57:22,417 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:22,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:22,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1071619613, now seen corresponding path program 1 times [2022-02-20 18:57:22,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:22,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115295352] [2022-02-20 18:57:22,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:22,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {42632#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_1911~0 := 0;~__return_2060~0 := 0;~__return_2167~0 := 0; {42632#true} is VALID [2022-02-20 18:57:22,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {42632#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {42632#true} is VALID [2022-02-20 18:57:22,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {42632#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {42632#true} is VALID [2022-02-20 18:57:22,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {42632#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {42632#true} is VALID [2022-02-20 18:57:22,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {42632#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {42632#true} is VALID [2022-02-20 18:57:22,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {42632#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {42632#true} is VALID [2022-02-20 18:57:22,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {42632#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {42632#true} is VALID [2022-02-20 18:57:22,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {42632#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {42632#true} is VALID [2022-02-20 18:57:22,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {42632#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {42632#true} is VALID [2022-02-20 18:57:22,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {42632#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {42632#true} is VALID [2022-02-20 18:57:22,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {42632#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {42632#true} is VALID [2022-02-20 18:57:22,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {42632#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {42632#true} is VALID [2022-02-20 18:57:22,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {42632#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {42632#true} is VALID [2022-02-20 18:57:22,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {42632#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {42632#true} is VALID [2022-02-20 18:57:22,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {42632#true} assume ~id1~0 != ~id2~0; {42632#true} is VALID [2022-02-20 18:57:22,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {42632#true} assume ~id1~0 != ~id3~0; {42632#true} is VALID [2022-02-20 18:57:22,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {42632#true} assume ~id2~0 != ~id3~0; {42632#true} is VALID [2022-02-20 18:57:22,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {42632#true} assume ~id1~0 >= 0; {42632#true} is VALID [2022-02-20 18:57:22,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {42632#true} assume ~id2~0 >= 0; {42632#true} is VALID [2022-02-20 18:57:22,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {42632#true} assume ~id3~0 >= 0; {42632#true} is VALID [2022-02-20 18:57:22,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {42632#true} assume 0 == ~r1~0; {42632#true} is VALID [2022-02-20 18:57:22,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {42632#true} assume 0 == ~r2~0; {42632#true} is VALID [2022-02-20 18:57:22,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {42632#true} assume 0 == ~r3~0; {42632#true} is VALID [2022-02-20 18:57:22,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {42632#true} assume ~max1~0 == ~id1~0; {42632#true} is VALID [2022-02-20 18:57:22,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {42632#true} assume ~max2~0 == ~id2~0; {42632#true} is VALID [2022-02-20 18:57:22,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {42632#true} assume ~max3~0 == ~id3~0; {42632#true} is VALID [2022-02-20 18:57:22,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {42632#true} assume 0 == ~st1~0; {42632#true} is VALID [2022-02-20 18:57:22,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {42632#true} assume 0 == ~st2~0; {42632#true} is VALID [2022-02-20 18:57:22,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {42632#true} assume 0 == ~st3~0; {42632#true} is VALID [2022-02-20 18:57:22,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {42632#true} assume 0 == ~nl1~0; {42632#true} is VALID [2022-02-20 18:57:22,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {42632#true} assume 0 == ~nl2~0; {42632#true} is VALID [2022-02-20 18:57:22,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {42632#true} assume 0 == ~nl3~0; {42632#true} is VALID [2022-02-20 18:57:22,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {42632#true} assume 0 == ~mode1~0 % 256; {42632#true} is VALID [2022-02-20 18:57:22,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {42632#true} assume 0 == ~mode2~0 % 256; {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax1~0 % 256); {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax2~0 % 256); {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1911~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1911~0; {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 < 2; {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep12~0 % 256); {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,476 INFO L290 TraceCheckUtils]: 43: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep13~0 % 256); {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,476 INFO L290 TraceCheckUtils]: 44: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:57:22,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {42634#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {42633#false} is VALID [2022-02-20 18:57:22,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {42633#false} assume !!(0 == ~ep12~0 % 256); {42633#false} is VALID [2022-02-20 18:57:22,478 INFO L290 TraceCheckUtils]: 48: Hoare triple {42633#false} assume !!(0 == ~ep32~0 % 256); {42633#false} is VALID [2022-02-20 18:57:22,478 INFO L290 TraceCheckUtils]: 49: Hoare triple {42633#false} ~newmax2~0 := main_~node2__newmax~0#1; {42633#false} is VALID [2022-02-20 18:57:22,478 INFO L290 TraceCheckUtils]: 50: Hoare triple {42633#false} assume 2 == ~r2~0; {42633#false} is VALID [2022-02-20 18:57:22,478 INFO L290 TraceCheckUtils]: 51: Hoare triple {42633#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {42633#false} is VALID [2022-02-20 18:57:22,478 INFO L290 TraceCheckUtils]: 52: Hoare triple {42633#false} ~mode2~0 := 0; {42633#false} is VALID [2022-02-20 18:57:22,478 INFO L290 TraceCheckUtils]: 53: Hoare triple {42633#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {42633#false} is VALID [2022-02-20 18:57:22,478 INFO L290 TraceCheckUtils]: 54: Hoare triple {42633#false} assume !!(0 == ~mode3~0 % 256); {42633#false} is VALID [2022-02-20 18:57:22,478 INFO L290 TraceCheckUtils]: 55: Hoare triple {42633#false} assume ~r3~0 < 2; {42633#false} is VALID [2022-02-20 18:57:22,479 INFO L290 TraceCheckUtils]: 56: Hoare triple {42633#false} assume !!(0 == ~ep31~0 % 256); {42633#false} is VALID [2022-02-20 18:57:22,479 INFO L290 TraceCheckUtils]: 57: Hoare triple {42633#false} assume !!(0 == ~ep32~0 % 256); {42633#false} is VALID [2022-02-20 18:57:22,479 INFO L290 TraceCheckUtils]: 58: Hoare triple {42633#false} ~mode3~0 := 1; {42633#false} is VALID [2022-02-20 18:57:22,479 INFO L290 TraceCheckUtils]: 59: Hoare triple {42633#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {42633#false} is VALID [2022-02-20 18:57:22,479 INFO L290 TraceCheckUtils]: 60: Hoare triple {42633#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {42633#false} is VALID [2022-02-20 18:57:22,479 INFO L290 TraceCheckUtils]: 61: Hoare triple {42633#false} ~__return_2060~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2060~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; {42633#false} is VALID [2022-02-20 18:57:22,479 INFO L290 TraceCheckUtils]: 62: Hoare triple {42633#false} assume 0 == main_~assert__arg~0#1 % 256; {42633#false} is VALID [2022-02-20 18:57:22,479 INFO L290 TraceCheckUtils]: 63: Hoare triple {42633#false} assume !false; {42633#false} is VALID [2022-02-20 18:57:22,480 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:57:22,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:22,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115295352] [2022-02-20 18:57:22,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115295352] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:22,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:22,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:22,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901674501] [2022-02-20 18:57:22,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:22,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:57:22,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:22,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:22,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:22,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:22,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:22,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:22,513 INFO L87 Difference]: Start difference. First operand 2583 states and 4221 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:25,826 INFO L93 Difference]: Finished difference Result 5027 states and 8240 transitions. [2022-02-20 18:57:25,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:25,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:57:25,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:57:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:57:25,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 479 transitions. [2022-02-20 18:57:26,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:26,642 INFO L225 Difference]: With dead ends: 5027 [2022-02-20 18:57:26,642 INFO L226 Difference]: Without dead ends: 3593 [2022-02-20 18:57:26,643 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:57:26,644 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 126 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:26,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 486 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2022-02-20 18:57:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3591. [2022-02-20 18:57:28,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:28,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3593 states. Second operand has 3591 states, 3590 states have (on average 1.6298050139275766) internal successors, (5851), 3590 states have internal predecessors, (5851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:28,819 INFO L74 IsIncluded]: Start isIncluded. First operand 3593 states. Second operand has 3591 states, 3590 states have (on average 1.6298050139275766) internal successors, (5851), 3590 states have internal predecessors, (5851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:28,823 INFO L87 Difference]: Start difference. First operand 3593 states. Second operand has 3591 states, 3590 states have (on average 1.6298050139275766) internal successors, (5851), 3590 states have internal predecessors, (5851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:29,201 INFO L93 Difference]: Finished difference Result 3593 states and 5852 transitions. [2022-02-20 18:57:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5852 transitions. [2022-02-20 18:57:29,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:29,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:29,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 3591 states, 3590 states have (on average 1.6298050139275766) internal successors, (5851), 3590 states have internal predecessors, (5851), 0 states have call successors, (0), 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 3593 states. [2022-02-20 18:57:29,213 INFO L87 Difference]: Start difference. First operand has 3591 states, 3590 states have (on average 1.6298050139275766) internal successors, (5851), 3590 states have internal predecessors, (5851), 0 states have call successors, (0), 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 3593 states. [2022-02-20 18:57:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:29,594 INFO L93 Difference]: Finished difference Result 3593 states and 5852 transitions. [2022-02-20 18:57:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5852 transitions. [2022-02-20 18:57:29,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:29,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:29,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:29,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3591 states, 3590 states have (on average 1.6298050139275766) internal successors, (5851), 3590 states have internal predecessors, (5851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 3591 states and 5851 transitions. [2022-02-20 18:57:30,189 INFO L78 Accepts]: Start accepts. Automaton has 3591 states and 5851 transitions. Word has length 64 [2022-02-20 18:57:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:30,189 INFO L470 AbstractCegarLoop]: Abstraction has 3591 states and 5851 transitions. [2022-02-20 18:57:30,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3591 states and 5851 transitions. [2022-02-20 18:57:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:57:30,190 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:30,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:30,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:57:30,190 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:30,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:30,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2108370415, now seen corresponding path program 1 times [2022-02-20 18:57:30,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:30,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263737475] [2022-02-20 18:57:30,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:30,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:30,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {61905#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_1911~0 := 0;~__return_2060~0 := 0;~__return_2167~0 := 0; {61905#true} is VALID [2022-02-20 18:57:30,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {61905#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {61905#true} is VALID [2022-02-20 18:57:30,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {61905#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {61905#true} is VALID [2022-02-20 18:57:30,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {61905#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {61905#true} is VALID [2022-02-20 18:57:30,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {61905#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {61905#true} is VALID [2022-02-20 18:57:30,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {61905#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {61905#true} is VALID [2022-02-20 18:57:30,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {61905#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {61905#true} is VALID [2022-02-20 18:57:30,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {61905#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {61905#true} is VALID [2022-02-20 18:57:30,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {61905#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {61905#true} is VALID [2022-02-20 18:57:30,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {61905#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {61905#true} is VALID [2022-02-20 18:57:30,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {61905#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {61905#true} is VALID [2022-02-20 18:57:30,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {61905#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {61905#true} is VALID [2022-02-20 18:57:30,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {61905#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {61905#true} is VALID [2022-02-20 18:57:30,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {61905#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {61905#true} is VALID [2022-02-20 18:57:30,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {61905#true} assume ~id1~0 != ~id2~0; {61905#true} is VALID [2022-02-20 18:57:30,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {61905#true} assume ~id1~0 != ~id3~0; {61905#true} is VALID [2022-02-20 18:57:30,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {61905#true} assume ~id2~0 != ~id3~0; {61905#true} is VALID [2022-02-20 18:57:30,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {61905#true} assume ~id1~0 >= 0; {61905#true} is VALID [2022-02-20 18:57:30,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {61905#true} assume ~id2~0 >= 0; {61905#true} is VALID [2022-02-20 18:57:30,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {61905#true} assume ~id3~0 >= 0; {61905#true} is VALID [2022-02-20 18:57:30,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {61905#true} assume 0 == ~r1~0; {61905#true} is VALID [2022-02-20 18:57:30,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {61905#true} assume 0 == ~r2~0; {61905#true} is VALID [2022-02-20 18:57:30,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {61905#true} assume 0 == ~r3~0; {61905#true} is VALID [2022-02-20 18:57:30,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {61905#true} assume ~max1~0 == ~id1~0; {61905#true} is VALID [2022-02-20 18:57:30,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {61905#true} assume ~max2~0 == ~id2~0; {61905#true} is VALID [2022-02-20 18:57:30,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {61905#true} assume ~max3~0 == ~id3~0; {61905#true} is VALID [2022-02-20 18:57:30,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {61905#true} assume 0 == ~st1~0; {61905#true} is VALID [2022-02-20 18:57:30,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {61905#true} assume 0 == ~st2~0; {61907#(<= ~st2~0 0)} is VALID [2022-02-20 18:57:30,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {61907#(<= ~st2~0 0)} assume 0 == ~st3~0; {61907#(<= ~st2~0 0)} is VALID [2022-02-20 18:57:30,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {61907#(<= ~st2~0 0)} assume 0 == ~nl1~0; {61907#(<= ~st2~0 0)} is VALID [2022-02-20 18:57:30,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {61907#(<= ~st2~0 0)} assume 0 == ~nl2~0; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax1~0 % 256); {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax2~0 % 256); {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1911~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1911~0; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 < 2; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 < 2; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,244 INFO L290 TraceCheckUtils]: 48: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,245 INFO L290 TraceCheckUtils]: 50: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,245 INFO L290 TraceCheckUtils]: 51: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 < 2; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,248 INFO L290 TraceCheckUtils]: 59: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {61908#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:30,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {61908#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {61906#false} is VALID [2022-02-20 18:57:30,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {61906#false} ~__return_2060~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2060~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; {61906#false} is VALID [2022-02-20 18:57:30,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {61906#false} assume 0 == main_~assert__arg~0#1 % 256; {61906#false} is VALID [2022-02-20 18:57:30,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {61906#false} assume !false; {61906#false} is VALID [2022-02-20 18:57:30,249 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:57:30,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:30,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263737475] [2022-02-20 18:57:30,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263737475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:30,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:30,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:57:30,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479217707] [2022-02-20 18:57:30,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:57:30,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:30,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:30,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:30,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:57:30,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:30,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:57:30,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:57:30,285 INFO L87 Difference]: Start difference. First operand 3591 states and 5851 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:41,446 INFO L93 Difference]: Finished difference Result 11297 states and 18469 transitions. [2022-02-20 18:57:41,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:57:41,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:57:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2022-02-20 18:57:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2022-02-20 18:57:41,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 665 transitions. [2022-02-20 18:57:41,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 665 edges. 665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:44,467 INFO L225 Difference]: With dead ends: 11297 [2022-02-20 18:57:44,467 INFO L226 Difference]: Without dead ends: 7775 [2022-02-20 18:57:44,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:57:44,472 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 429 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:44,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 729 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7775 states. [2022-02-20 18:57:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7775 to 5664. [2022-02-20 18:57:48,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:48,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7775 states. Second operand has 5664 states, 5663 states have (on average 1.6238742715874979) internal successors, (9196), 5663 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,912 INFO L74 IsIncluded]: Start isIncluded. First operand 7775 states. Second operand has 5664 states, 5663 states have (on average 1.6238742715874979) internal successors, (9196), 5663 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,916 INFO L87 Difference]: Start difference. First operand 7775 states. Second operand has 5664 states, 5663 states have (on average 1.6238742715874979) internal successors, (9196), 5663 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:50,657 INFO L93 Difference]: Finished difference Result 7775 states and 12662 transitions. [2022-02-20 18:57:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 7775 states and 12662 transitions. [2022-02-20 18:57:50,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:50,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:50,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 5664 states, 5663 states have (on average 1.6238742715874979) internal successors, (9196), 5663 states have internal predecessors, (9196), 0 states have call successors, (0), 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 7775 states. [2022-02-20 18:57:50,675 INFO L87 Difference]: Start difference. First operand has 5664 states, 5663 states have (on average 1.6238742715874979) internal successors, (9196), 5663 states have internal predecessors, (9196), 0 states have call successors, (0), 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 7775 states. [2022-02-20 18:57:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:52,456 INFO L93 Difference]: Finished difference Result 7775 states and 12662 transitions. [2022-02-20 18:57:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 7775 states and 12662 transitions. [2022-02-20 18:57:52,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:52,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:52,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:52,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5664 states, 5663 states have (on average 1.6238742715874979) internal successors, (9196), 5663 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5664 states to 5664 states and 9196 transitions. [2022-02-20 18:57:53,833 INFO L78 Accepts]: Start accepts. Automaton has 5664 states and 9196 transitions. Word has length 64 [2022-02-20 18:57:53,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:53,833 INFO L470 AbstractCegarLoop]: Abstraction has 5664 states and 9196 transitions. [2022-02-20 18:57:53,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 5664 states and 9196 transitions. [2022-02-20 18:57:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:57:53,834 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:53,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:53,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:57:53,834 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2012593663, now seen corresponding path program 1 times [2022-02-20 18:57:53,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:53,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289992135] [2022-02-20 18:57:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:53,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:53,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {101272#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_1911~0 := 0;~__return_2060~0 := 0;~__return_2167~0 := 0; {101272#true} is VALID [2022-02-20 18:57:53,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {101272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {101272#true} is VALID [2022-02-20 18:57:53,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {101272#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {101272#true} is VALID [2022-02-20 18:57:53,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {101272#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {101272#true} is VALID [2022-02-20 18:57:53,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {101272#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {101272#true} is VALID [2022-02-20 18:57:53,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {101272#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {101272#true} is VALID [2022-02-20 18:57:53,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {101272#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {101272#true} is VALID [2022-02-20 18:57:53,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {101272#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {101272#true} is VALID [2022-02-20 18:57:53,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {101272#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {101272#true} is VALID [2022-02-20 18:57:53,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {101272#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {101272#true} is VALID [2022-02-20 18:57:53,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {101272#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {101272#true} is VALID [2022-02-20 18:57:53,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {101272#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {101272#true} is VALID [2022-02-20 18:57:53,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {101272#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {101272#true} is VALID [2022-02-20 18:57:53,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {101272#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {101272#true} is VALID [2022-02-20 18:57:53,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {101272#true} assume ~id1~0 != ~id2~0; {101272#true} is VALID [2022-02-20 18:57:53,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {101272#true} assume ~id1~0 != ~id3~0; {101272#true} is VALID [2022-02-20 18:57:53,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {101272#true} assume ~id2~0 != ~id3~0; {101272#true} is VALID [2022-02-20 18:57:53,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {101272#true} assume ~id1~0 >= 0; {101272#true} is VALID [2022-02-20 18:57:53,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {101272#true} assume ~id2~0 >= 0; {101272#true} is VALID [2022-02-20 18:57:53,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {101272#true} assume ~id3~0 >= 0; {101272#true} is VALID [2022-02-20 18:57:53,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {101272#true} assume 0 == ~r1~0; {101272#true} is VALID [2022-02-20 18:57:53,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {101272#true} assume 0 == ~r2~0; {101272#true} is VALID [2022-02-20 18:57:53,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {101272#true} assume 0 == ~r3~0; {101272#true} is VALID [2022-02-20 18:57:53,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {101272#true} assume ~max1~0 == ~id1~0; {101272#true} is VALID [2022-02-20 18:57:53,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {101272#true} assume ~max2~0 == ~id2~0; {101272#true} is VALID [2022-02-20 18:57:53,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {101272#true} assume ~max3~0 == ~id3~0; {101272#true} is VALID [2022-02-20 18:57:53,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {101272#true} assume 0 == ~st1~0; {101272#true} is VALID [2022-02-20 18:57:53,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {101272#true} assume 0 == ~st2~0; {101272#true} is VALID [2022-02-20 18:57:53,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {101272#true} assume 0 == ~st3~0; {101272#true} is VALID [2022-02-20 18:57:53,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {101272#true} assume 0 == ~nl1~0; {101272#true} is VALID [2022-02-20 18:57:53,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {101272#true} assume 0 == ~nl2~0; {101272#true} is VALID [2022-02-20 18:57:53,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {101272#true} assume 0 == ~nl3~0; {101272#true} is VALID [2022-02-20 18:57:53,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {101272#true} assume 0 == ~mode1~0 % 256; {101272#true} is VALID [2022-02-20 18:57:53,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {101272#true} assume 0 == ~mode2~0 % 256; {101272#true} is VALID [2022-02-20 18:57:53,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {101272#true} assume 0 == ~mode3~0 % 256; {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax1~0 % 256); {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax2~0 % 256); {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1911~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1911~0; {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 < 2; {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep12~0 % 256); {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep13~0 % 256); {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 < 2; {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,880 INFO L290 TraceCheckUtils]: 48: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep21~0 % 256); {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep23~0 % 256); {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,881 INFO L290 TraceCheckUtils]: 51: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:57:53,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {101274#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {101273#false} is VALID [2022-02-20 18:57:53,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {101273#false} assume !!(0 == ~ep13~0 % 256); {101273#false} is VALID [2022-02-20 18:57:53,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {101273#false} assume !!(0 == ~ep23~0 % 256); {101273#false} is VALID [2022-02-20 18:57:53,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {101273#false} ~newmax3~0 := main_~node3__newmax~0#1; {101273#false} is VALID [2022-02-20 18:57:53,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {101273#false} assume 2 == ~r3~0; {101273#false} is VALID [2022-02-20 18:57:53,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {101273#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {101273#false} is VALID [2022-02-20 18:57:53,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {101273#false} ~mode3~0 := 0; {101273#false} is VALID [2022-02-20 18:57:53,883 INFO L290 TraceCheckUtils]: 59: Hoare triple {101273#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {101273#false} is VALID [2022-02-20 18:57:53,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {101273#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {101273#false} is VALID [2022-02-20 18:57:53,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {101273#false} ~__return_2060~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2060~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; {101273#false} is VALID [2022-02-20 18:57:53,883 INFO L290 TraceCheckUtils]: 62: Hoare triple {101273#false} assume 0 == main_~assert__arg~0#1 % 256; {101273#false} is VALID [2022-02-20 18:57:53,883 INFO L290 TraceCheckUtils]: 63: Hoare triple {101273#false} assume !false; {101273#false} is VALID [2022-02-20 18:57:53,884 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:57:53,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:53,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289992135] [2022-02-20 18:57:53,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289992135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:53,884 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:53,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:53,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148363947] [2022-02-20 18:57:53,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:53,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:57:53,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:53,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:53,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:53,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:53,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:53,919 INFO L87 Difference]: Start difference. First operand 5664 states and 9196 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:05,108 INFO L93 Difference]: Finished difference Result 11084 states and 18033 transitions. [2022-02-20 18:58:05,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:05,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:58:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:58:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-02-20 18:58:05,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 479 transitions. [2022-02-20 18:58:05,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.