./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.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.2.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 c5f4858505c444657049a34bd1efbc3b1e97c5e32733a83c11ccaa8ea369cb2f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:57:44,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:57:44,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:57:44,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:57:44,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:57:44,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:57:44,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:57:44,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:57:44,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:57:44,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:57:44,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:57:44,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:57:44,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:57:44,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:57:44,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:57:44,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:57:44,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:57:44,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:57:44,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:57:44,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:57:44,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:57:44,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:57:44,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:57:44,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:57:44,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:57:44,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:57:44,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:57:44,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:57:44,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:57:44,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:57:44,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:57:44,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:57:44,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:57:44,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:57:44,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:57:44,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:57:44,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:57:44,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:57:44,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:57:44,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:57:44,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:57:44,591 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:44,618 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:57:44,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:57:44,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:57:44,619 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:57:44,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:57:44,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:57:44,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:57:44,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:57:44,621 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:57:44,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:57:44,622 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:57:44,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:57:44,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:57:44,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:57:44,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:57:44,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:57:44,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:57:44,624 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:57:44,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:57:44,624 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:57:44,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:57:44,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:57:44,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:57:44,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:57:44,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:57:44,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:57:44,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:57:44,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:57:44,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:57:44,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:57:44,626 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:57:44,626 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:57:44,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:57:44,627 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 -> c5f4858505c444657049a34bd1efbc3b1e97c5e32733a83c11ccaa8ea369cb2f [2022-02-20 18:57:44,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:57:44,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:57:44,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:57:44,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:57:44,871 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:57:44,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:57:44,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e938c65/27980d2639cb44aea732214b4640c476/FLAG1247240a0 [2022-02-20 18:57:45,333 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:57:45,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:57:45,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e938c65/27980d2639cb44aea732214b4640c476/FLAG1247240a0 [2022-02-20 18:57:45,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e938c65/27980d2639cb44aea732214b4640c476 [2022-02-20 18:57:45,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:57:45,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:57:45,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:57:45,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:57:45,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:57:45,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b75487e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45, skipping insertion in model container [2022-02-20 18:57:45,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:45,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:57:45,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:57:45,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7806,7819] [2022-02-20 18:57:45,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:57:45,762 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:57:45,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7806,7819] [2022-02-20 18:57:45,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:57:45,880 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:57:45,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45 WrapperNode [2022-02-20 18:57:45,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:57:45,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:57:45,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:57:45,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:57:45,889 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:45" (1/1) ... [2022-02-20 18:57:45,903 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:45" (1/1) ... [2022-02-20 18:57:45,952 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 633 [2022-02-20 18:57:45,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:57:45,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:57:45,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:57:45,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:57:45,961 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:45" (1/1) ... [2022-02-20 18:57:45,961 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:45" (1/1) ... [2022-02-20 18:57:45,963 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:45" (1/1) ... [2022-02-20 18:57:45,964 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:45" (1/1) ... [2022-02-20 18:57:45,971 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:45" (1/1) ... [2022-02-20 18:57:45,976 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:45" (1/1) ... [2022-02-20 18:57:45,978 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:45" (1/1) ... [2022-02-20 18:57:45,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:57:45,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:57:45,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:57:45,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:57:45,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45" (1/1) ... [2022-02-20 18:57:46,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:57:46,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:57:46,028 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:46,042 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:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:57:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:57:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:57:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:57:46,161 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:57:46,163 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:57:46,873 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:57:46,884 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:57:46,884 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:57:46,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:57:46 BoogieIcfgContainer [2022-02-20 18:57:46,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:57:46,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:57:46,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:57:46,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:57:46,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:57:45" (1/3) ... [2022-02-20 18:57:46,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6499f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:57:46, skipping insertion in model container [2022-02-20 18:57:46,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:45" (2/3) ... [2022-02-20 18:57:46,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6499f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:57:46, skipping insertion in model container [2022-02-20 18:57:46,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:57:46" (3/3) ... [2022-02-20 18:57:46,894 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:57:46,898 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:57:46,899 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:57:46,946 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:57:46,951 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:46,952 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:57:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.7619047619047619) internal successors, (259), 148 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:57:46,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:46,980 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:46,980 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1468963440, now seen corresponding path program 1 times [2022-02-20 18:57:46,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:46,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621930965] [2022-02-20 18:57:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:46,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:47,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1285~0 := 0;~__return_1434~0 := 0;~__return_1520~0 := 0; {152#true} is VALID [2022-02-20 18:57:47,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {152#true} is VALID [2022-02-20 18:57:47,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:47,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:47,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:47,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:47,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:47,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:47,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:47,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:47,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {152#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:47,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:47,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:47,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:47,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {152#true} assume ~id1~0 != ~id2~0; {152#true} is VALID [2022-02-20 18:57:47,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {152#true} assume ~id1~0 != ~id3~0; {152#true} is VALID [2022-02-20 18:57:47,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {152#true} assume ~id2~0 != ~id3~0; {152#true} is VALID [2022-02-20 18:57:47,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {152#true} assume ~id1~0 >= 0; {152#true} is VALID [2022-02-20 18:57:47,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {152#true} assume ~id2~0 >= 0; {152#true} is VALID [2022-02-20 18:57:47,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {152#true} assume ~id3~0 >= 0; {152#true} is VALID [2022-02-20 18:57:47,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {152#true} assume 0 == ~r1~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~r2~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~r3~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r122~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r132~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r212~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r232~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r312~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == main_~init__r322~0#1 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {154#(<= ~r1~0 0)} assume ~max1~0 == ~id1~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {154#(<= ~r1~0 0)} assume ~max2~0 == ~id2~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {154#(<= ~r1~0 0)} assume ~max3~0 == ~id3~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~st1~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~st2~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~st3~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~nl1~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~nl2~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~nl3~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {154#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == ~newmax1~0 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == ~newmax2~0 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {154#(<= ~r1~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1285~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1285~0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {154#(<= ~r1~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {154#(<= ~r1~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {154#(<= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256); {154#(<= ~r1~0 0)} is VALID [2022-02-20 18:57:47,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {154#(<= ~r1~0 0)} assume !(~r1~0 < 2); {153#false} is VALID [2022-02-20 18:57:47,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {153#false} ~mode1~0 := 1; {153#false} is VALID [2022-02-20 18:57:47,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {153#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {153#false} is VALID [2022-02-20 18:57:47,367 INFO L290 TraceCheckUtils]: 50: Hoare triple {153#false} assume !!(0 == ~mode2~0 % 256); {153#false} is VALID [2022-02-20 18:57:47,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {153#false} assume !(~r2~0 < 2); {153#false} is VALID [2022-02-20 18:57:47,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {153#false} ~mode2~0 := 1; {153#false} is VALID [2022-02-20 18:57:47,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {153#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {153#false} is VALID [2022-02-20 18:57:47,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {153#false} assume !!(0 == ~mode3~0 % 256); {153#false} is VALID [2022-02-20 18:57:47,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {153#false} assume !(~r3~0 < 2); {153#false} is VALID [2022-02-20 18:57:47,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {153#false} ~mode3~0 := 1; {153#false} is VALID [2022-02-20 18:57:47,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {153#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {153#false} is VALID [2022-02-20 18:57:47,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {153#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {153#false} is VALID [2022-02-20 18:57:47,370 INFO L290 TraceCheckUtils]: 59: Hoare triple {153#false} ~__return_1434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1434~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {153#false} is VALID [2022-02-20 18:57:47,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {153#false} assume 0 == main_~assert__arg~0#1 % 256; {153#false} is VALID [2022-02-20 18:57:47,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 18:57:47,372 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:47,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:47,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621930965] [2022-02-20 18:57:47,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621930965] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:47,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:47,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:47,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845223414] [2022-02-20 18:57:47,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:47,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:57:47,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:47,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:47,457 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:47,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:47,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:47,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:47,478 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.7619047619047619) internal successors, (259), 148 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:47,917 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2022-02-20 18:57:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:47,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-02-20 18:57:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2022-02-20 18:57:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2022-02-20 18:57:47,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 547 transitions. [2022-02-20 18:57:48,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:48,390 INFO L225 Difference]: With dead ends: 323 [2022-02-20 18:57:48,390 INFO L226 Difference]: Without dead ends: 225 [2022-02-20 18:57:48,393 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:48,395 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 150 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:48,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 452 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:48,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-02-20 18:57:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2022-02-20 18:57:48,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:48,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,451 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,452 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:48,462 INFO L93 Difference]: Finished difference Result 225 states and 350 transitions. [2022-02-20 18:57:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 350 transitions. [2022-02-20 18:57:48,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:48,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:48,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 225 states. [2022-02-20 18:57:48,465 INFO L87 Difference]: Start difference. First operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 225 states. [2022-02-20 18:57:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:48,474 INFO L93 Difference]: Finished difference Result 225 states and 350 transitions. [2022-02-20 18:57:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 350 transitions. [2022-02-20 18:57:48,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:48,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:48,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:48,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.572072072072072) internal successors, (349), 222 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 349 transitions. [2022-02-20 18:57:48,487 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 349 transitions. Word has length 62 [2022-02-20 18:57:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:48,487 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 349 transitions. [2022-02-20 18:57:48,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 349 transitions. [2022-02-20 18:57:48,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:57:48,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:48,489 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:48,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:57:48,490 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:48,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:48,491 INFO L85 PathProgramCache]: Analyzing trace with hash -240910223, now seen corresponding path program 1 times [2022-02-20 18:57:48,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:48,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456635156] [2022-02-20 18:57:48,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:48,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:48,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {1337#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1285~0 := 0;~__return_1434~0 := 0;~__return_1520~0 := 0; {1337#true} is VALID [2022-02-20 18:57:48,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {1337#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {1337#true} is VALID [2022-02-20 18:57:48,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {1337#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1337#true} is VALID [2022-02-20 18:57:48,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {1337#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:57:48,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {1337#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1337#true} is VALID [2022-02-20 18:57:48,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {1337#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:57:48,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {1337#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1337#true} is VALID [2022-02-20 18:57:48,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {1337#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:57:48,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {1337#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1337#true} is VALID [2022-02-20 18:57:48,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {1337#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:57:48,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {1337#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1337#true} is VALID [2022-02-20 18:57:48,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {1337#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:57:48,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {1337#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1337#true} is VALID [2022-02-20 18:57:48,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {1337#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1337#true} is VALID [2022-02-20 18:57:48,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {1337#true} assume ~id1~0 != ~id2~0; {1337#true} is VALID [2022-02-20 18:57:48,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {1337#true} assume ~id1~0 != ~id3~0; {1337#true} is VALID [2022-02-20 18:57:48,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {1337#true} assume ~id2~0 != ~id3~0; {1337#true} is VALID [2022-02-20 18:57:48,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {1337#true} assume ~id1~0 >= 0; {1337#true} is VALID [2022-02-20 18:57:48,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {1337#true} assume ~id2~0 >= 0; {1337#true} is VALID [2022-02-20 18:57:48,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {1337#true} assume ~id3~0 >= 0; {1337#true} is VALID [2022-02-20 18:57:48,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {1337#true} assume 0 == ~r1~0; {1337#true} is VALID [2022-02-20 18:57:48,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {1337#true} assume 0 == ~r2~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~r3~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r122~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r132~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r212~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r232~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r312~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == main_~init__r322~0#1 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {1339#(<= ~r2~0 0)} assume ~max1~0 == ~id1~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {1339#(<= ~r2~0 0)} assume ~max2~0 == ~id2~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {1339#(<= ~r2~0 0)} assume ~max3~0 == ~id3~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~st1~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~st2~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~st3~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~nl1~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~nl2~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~nl3~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {1339#(<= ~r2~0 0)} assume 0 == ~mode3~0 % 256; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == ~newmax1~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == ~newmax2~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {1339#(<= ~r2~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1285~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1285~0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {1339#(<= ~r2~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {1339#(<= ~r2~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {1339#(<= ~r2~0 0)} assume !!(0 == ~mode1~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {1339#(<= ~r2~0 0)} assume ~r1~0 < 2; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {1339#(<= ~r2~0 0)} assume !!(0 == ~ep12~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {1339#(<= ~r2~0 0)} assume !!(0 == ~ep13~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {1339#(<= ~r2~0 0)} ~mode1~0 := 1; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {1339#(<= ~r2~0 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {1339#(<= ~r2~0 0)} assume !!(0 == ~mode2~0 % 256); {1339#(<= ~r2~0 0)} is VALID [2022-02-20 18:57:48,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {1339#(<= ~r2~0 0)} assume !(~r2~0 < 2); {1338#false} is VALID [2022-02-20 18:57:48,609 INFO L290 TraceCheckUtils]: 54: Hoare triple {1338#false} ~mode2~0 := 1; {1338#false} is VALID [2022-02-20 18:57:48,609 INFO L290 TraceCheckUtils]: 55: Hoare triple {1338#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {1338#false} is VALID [2022-02-20 18:57:48,609 INFO L290 TraceCheckUtils]: 56: Hoare triple {1338#false} assume !!(0 == ~mode3~0 % 256); {1338#false} is VALID [2022-02-20 18:57:48,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {1338#false} assume !(~r3~0 < 2); {1338#false} is VALID [2022-02-20 18:57:48,609 INFO L290 TraceCheckUtils]: 58: Hoare triple {1338#false} ~mode3~0 := 1; {1338#false} is VALID [2022-02-20 18:57:48,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {1338#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1338#false} is VALID [2022-02-20 18:57:48,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {1338#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1338#false} is VALID [2022-02-20 18:57:48,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {1338#false} ~__return_1434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1434~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1338#false} is VALID [2022-02-20 18:57:48,610 INFO L290 TraceCheckUtils]: 62: Hoare triple {1338#false} assume 0 == main_~assert__arg~0#1 % 256; {1338#false} is VALID [2022-02-20 18:57:48,611 INFO L290 TraceCheckUtils]: 63: Hoare triple {1338#false} assume !false; {1338#false} is VALID [2022-02-20 18:57:48,611 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:48,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:48,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456635156] [2022-02-20 18:57:48,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456635156] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:48,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:48,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:48,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301858449] [2022-02-20 18:57:48,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:48,614 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:48,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:48,614 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:48,660 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:48,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:48,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:48,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:48,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:48,662 INFO L87 Difference]: Start difference. First operand 223 states and 349 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:49,003 INFO L93 Difference]: Finished difference Result 539 states and 869 transitions. [2022-02-20 18:57:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:49,004 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:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:49,005 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:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:57:49,010 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:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:57:49,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 508 transitions. [2022-02-20 18:57:49,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:49,386 INFO L225 Difference]: With dead ends: 539 [2022-02-20 18:57:49,386 INFO L226 Difference]: Without dead ends: 373 [2022-02-20 18:57:49,387 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:49,388 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 125 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:49,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 415 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-02-20 18:57:49,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2022-02-20 18:57:49,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:49,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 373 states. Second operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:49,487 INFO L74 IsIncluded]: Start isIncluded. First operand 373 states. Second operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:49,488 INFO L87 Difference]: Start difference. First operand 373 states. Second operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:49,500 INFO L93 Difference]: Finished difference Result 373 states and 593 transitions. [2022-02-20 18:57:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 593 transitions. [2022-02-20 18:57:49,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:49,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:49,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 373 states. [2022-02-20 18:57:49,504 INFO L87 Difference]: Start difference. First operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 373 states. [2022-02-20 18:57:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:49,517 INFO L93 Difference]: Finished difference Result 373 states and 593 transitions. [2022-02-20 18:57:49,517 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 593 transitions. [2022-02-20 18:57:49,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:49,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:49,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:49,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.6) internal successors, (592), 370 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 592 transitions. [2022-02-20 18:57:49,545 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 592 transitions. Word has length 64 [2022-02-20 18:57:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:49,546 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 592 transitions. [2022-02-20 18:57:49,546 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:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 592 transitions. [2022-02-20 18:57:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:57:49,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:49,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:49,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:57:49,549 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1851209774, now seen corresponding path program 1 times [2022-02-20 18:57:49,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:49,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097287776] [2022-02-20 18:57:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:49,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:49,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {3333#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1285~0 := 0;~__return_1434~0 := 0;~__return_1520~0 := 0; {3333#true} is VALID [2022-02-20 18:57:49,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {3333#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {3333#true} is VALID [2022-02-20 18:57:49,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {3333#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {3333#true} is VALID [2022-02-20 18:57:49,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {3333#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:57:49,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {3333#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {3333#true} is VALID [2022-02-20 18:57:49,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {3333#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:57:49,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {3333#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {3333#true} is VALID [2022-02-20 18:57:49,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {3333#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:57:49,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {3333#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {3333#true} is VALID [2022-02-20 18:57:49,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {3333#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:57:49,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {3333#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {3333#true} is VALID [2022-02-20 18:57:49,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {3333#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:57:49,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {3333#true} is VALID [2022-02-20 18:57:49,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {3333#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {3333#true} is VALID [2022-02-20 18:57:49,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {3333#true} assume ~id1~0 != ~id2~0; {3333#true} is VALID [2022-02-20 18:57:49,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {3333#true} assume ~id1~0 != ~id3~0; {3333#true} is VALID [2022-02-20 18:57:49,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {3333#true} assume ~id2~0 != ~id3~0; {3333#true} is VALID [2022-02-20 18:57:49,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {3333#true} assume ~id1~0 >= 0; {3333#true} is VALID [2022-02-20 18:57:49,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {3333#true} assume ~id2~0 >= 0; {3333#true} is VALID [2022-02-20 18:57:49,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {3333#true} assume ~id3~0 >= 0; {3333#true} is VALID [2022-02-20 18:57:49,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {3333#true} assume 0 == ~r1~0; {3333#true} is VALID [2022-02-20 18:57:49,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {3333#true} assume 0 == ~r2~0; {3333#true} is VALID [2022-02-20 18:57:49,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {3333#true} assume 0 == ~r3~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r122~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r132~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r212~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r232~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r312~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == main_~init__r322~0#1 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {3335#(<= ~r3~0 0)} assume ~max1~0 == ~id1~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {3335#(<= ~r3~0 0)} assume ~max2~0 == ~id2~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {3335#(<= ~r3~0 0)} assume ~max3~0 == ~id3~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~st1~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~st2~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~st3~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~nl1~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~nl2~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~nl3~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~mode1~0 % 256; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~mode2~0 % 256; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {3335#(<= ~r3~0 0)} assume 0 == ~mode3~0 % 256; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == ~newmax1~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == ~newmax2~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {3335#(<= ~r3~0 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1285~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1285~0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {3335#(<= ~r3~0 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {3335#(<= ~r3~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~mode1~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {3335#(<= ~r3~0 0)} assume ~r1~0 < 2; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~ep12~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~ep13~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {3335#(<= ~r3~0 0)} ~mode1~0 := 1; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {3335#(<= ~r3~0 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~mode2~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {3335#(<= ~r3~0 0)} assume ~r2~0 < 2; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~ep21~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~ep23~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {3335#(<= ~r3~0 0)} ~mode2~0 := 1; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,678 INFO L290 TraceCheckUtils]: 57: Hoare triple {3335#(<= ~r3~0 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {3335#(<= ~r3~0 0)} assume !!(0 == ~mode3~0 % 256); {3335#(<= ~r3~0 0)} is VALID [2022-02-20 18:57:49,679 INFO L290 TraceCheckUtils]: 59: Hoare triple {3335#(<= ~r3~0 0)} assume !(~r3~0 < 2); {3334#false} is VALID [2022-02-20 18:57:49,679 INFO L290 TraceCheckUtils]: 60: Hoare triple {3334#false} ~mode3~0 := 1; {3334#false} is VALID [2022-02-20 18:57:49,679 INFO L290 TraceCheckUtils]: 61: Hoare triple {3334#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3334#false} is VALID [2022-02-20 18:57:49,679 INFO L290 TraceCheckUtils]: 62: Hoare triple {3334#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3334#false} is VALID [2022-02-20 18:57:49,679 INFO L290 TraceCheckUtils]: 63: Hoare triple {3334#false} ~__return_1434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1434~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {3334#false} is VALID [2022-02-20 18:57:49,680 INFO L290 TraceCheckUtils]: 64: Hoare triple {3334#false} assume 0 == main_~assert__arg~0#1 % 256; {3334#false} is VALID [2022-02-20 18:57:49,680 INFO L290 TraceCheckUtils]: 65: Hoare triple {3334#false} assume !false; {3334#false} is VALID [2022-02-20 18:57:49,680 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:49,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:49,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097287776] [2022-02-20 18:57:49,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097287776] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:49,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:49,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:49,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142810029] [2022-02-20 18:57:49,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:49,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:57:49,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:49,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:49,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:49,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:49,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:49,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:49,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:49,727 INFO L87 Difference]: Start difference. First operand 371 states and 592 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:50,211 INFO L93 Difference]: Finished difference Result 967 states and 1570 transitions. [2022-02-20 18:57:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:50,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:57:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:57:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-02-20 18:57:50,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 508 transitions. [2022-02-20 18:57:50,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:50,585 INFO L225 Difference]: With dead ends: 967 [2022-02-20 18:57:50,585 INFO L226 Difference]: Without dead ends: 653 [2022-02-20 18:57:50,586 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:50,587 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 119 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:50,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 416 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-02-20 18:57:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 651. [2022-02-20 18:57:50,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:50,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 653 states. Second operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,797 INFO L74 IsIncluded]: Start isIncluded. First operand 653 states. Second operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,799 INFO L87 Difference]: Start difference. First operand 653 states. Second operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:50,831 INFO L93 Difference]: Finished difference Result 653 states and 1049 transitions. [2022-02-20 18:57:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1049 transitions. [2022-02-20 18:57:50,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:50,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:50,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 653 states. [2022-02-20 18:57:50,835 INFO L87 Difference]: Start difference. First operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 653 states. [2022-02-20 18:57:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:50,860 INFO L93 Difference]: Finished difference Result 653 states and 1049 transitions. [2022-02-20 18:57:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1049 transitions. [2022-02-20 18:57:50,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:50,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:50,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:50,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1048 transitions. [2022-02-20 18:57:50,892 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1048 transitions. Word has length 66 [2022-02-20 18:57:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:50,894 INFO L470 AbstractCegarLoop]: Abstraction has 651 states and 1048 transitions. [2022-02-20 18:57:50,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1048 transitions. [2022-02-20 18:57:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:57:50,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:50,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:50,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:57:50,900 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1666116403, now seen corresponding path program 1 times [2022-02-20 18:57:50,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:50,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205778820] [2022-02-20 18:57:50,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:50,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:51,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {6890#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1285~0 := 0;~__return_1434~0 := 0;~__return_1520~0 := 0; {6890#true} is VALID [2022-02-20 18:57:51,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {6890#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {6890#true} is VALID [2022-02-20 18:57:51,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {6890#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {6890#true} is VALID [2022-02-20 18:57:51,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {6890#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:57:51,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {6890#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {6890#true} is VALID [2022-02-20 18:57:51,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {6890#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:57:51,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {6890#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {6890#true} is VALID [2022-02-20 18:57:51,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {6890#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:57:51,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {6890#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {6890#true} is VALID [2022-02-20 18:57:51,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {6890#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:57:51,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {6890#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {6890#true} is VALID [2022-02-20 18:57:51,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {6890#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:57:51,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {6890#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {6890#true} is VALID [2022-02-20 18:57:51,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {6890#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {6890#true} is VALID [2022-02-20 18:57:51,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {6890#true} assume ~id1~0 != ~id2~0; {6890#true} is VALID [2022-02-20 18:57:51,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {6890#true} assume ~id1~0 != ~id3~0; {6890#true} is VALID [2022-02-20 18:57:51,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {6890#true} assume ~id2~0 != ~id3~0; {6890#true} is VALID [2022-02-20 18:57:51,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {6890#true} assume ~id1~0 >= 0; {6890#true} is VALID [2022-02-20 18:57:51,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {6890#true} assume ~id2~0 >= 0; {6890#true} is VALID [2022-02-20 18:57:51,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {6890#true} assume ~id3~0 >= 0; {6890#true} is VALID [2022-02-20 18:57:51,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {6890#true} assume 0 == ~r1~0; {6890#true} is VALID [2022-02-20 18:57:51,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {6890#true} assume 0 == ~r2~0; {6890#true} is VALID [2022-02-20 18:57:51,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {6890#true} assume 0 == ~r3~0; {6890#true} is VALID [2022-02-20 18:57:51,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {6890#true} assume !(0 == main_~init__r122~0#1 % 256); {6890#true} is VALID [2022-02-20 18:57:51,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {6890#true} assume !(0 == main_~init__r132~0#1 % 256); {6890#true} is VALID [2022-02-20 18:57:51,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {6890#true} assume !(0 == main_~init__r212~0#1 % 256); {6890#true} is VALID [2022-02-20 18:57:51,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {6890#true} assume !(0 == main_~init__r232~0#1 % 256); {6890#true} is VALID [2022-02-20 18:57:51,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {6890#true} assume !(0 == main_~init__r312~0#1 % 256); {6890#true} is VALID [2022-02-20 18:57:51,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {6890#true} assume !(0 == main_~init__r322~0#1 % 256); {6890#true} is VALID [2022-02-20 18:57:51,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {6890#true} assume ~max1~0 == ~id1~0; {6890#true} is VALID [2022-02-20 18:57:51,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {6890#true} assume ~max2~0 == ~id2~0; {6890#true} is VALID [2022-02-20 18:57:51,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {6890#true} assume ~max3~0 == ~id3~0; {6890#true} is VALID [2022-02-20 18:57:51,042 INFO L290 TraceCheckUtils]: 32: Hoare triple {6890#true} assume 0 == ~st1~0; {6892#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:51,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {6892#(<= ~st1~0 0)} assume 0 == ~st2~0; {6893#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {6893#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1285~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1285~0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,047 INFO L290 TraceCheckUtils]: 46: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,047 INFO L290 TraceCheckUtils]: 47: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 2; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,047 INFO L290 TraceCheckUtils]: 48: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,048 INFO L290 TraceCheckUtils]: 49: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,048 INFO L290 TraceCheckUtils]: 50: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,048 INFO L290 TraceCheckUtils]: 51: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,049 INFO L290 TraceCheckUtils]: 52: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 < 2; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,050 INFO L290 TraceCheckUtils]: 55: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,050 INFO L290 TraceCheckUtils]: 56: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,051 INFO L290 TraceCheckUtils]: 59: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 < 2; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,052 INFO L290 TraceCheckUtils]: 60: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,052 INFO L290 TraceCheckUtils]: 61: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,053 INFO L290 TraceCheckUtils]: 63: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:51,053 INFO L290 TraceCheckUtils]: 64: Hoare triple {6894#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {6891#false} is VALID [2022-02-20 18:57:51,054 INFO L290 TraceCheckUtils]: 65: Hoare triple {6891#false} ~__return_1434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1434~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {6891#false} is VALID [2022-02-20 18:57:51,054 INFO L290 TraceCheckUtils]: 66: Hoare triple {6891#false} assume 0 == main_~assert__arg~0#1 % 256; {6891#false} is VALID [2022-02-20 18:57:51,054 INFO L290 TraceCheckUtils]: 67: Hoare triple {6891#false} assume !false; {6891#false} is VALID [2022-02-20 18:57:51,055 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:51,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:51,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205778820] [2022-02-20 18:57:51,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205778820] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:51,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:51,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:57:51,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903711123] [2022-02-20 18:57:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:51,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-02-20 18:57:51,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:51,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:51,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:51,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:57:51,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:51,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:57:51,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:57:51,100 INFO L87 Difference]: Start difference. First operand 651 states and 1048 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:53,889 INFO L93 Difference]: Finished difference Result 2807 states and 4618 transitions. [2022-02-20 18:57:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:57:53,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-02-20 18:57:53,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1118 transitions. [2022-02-20 18:57:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1118 transitions. [2022-02-20 18:57:53,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1118 transitions. [2022-02-20 18:57:54,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1118 edges. 1118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:54,894 INFO L225 Difference]: With dead ends: 2807 [2022-02-20 18:57:54,894 INFO L226 Difference]: Without dead ends: 2213 [2022-02-20 18:57:54,895 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:54,896 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 857 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:54,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [857 Valid, 1617 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:57:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2022-02-20 18:57:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1170. [2022-02-20 18:57:55,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:55,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2213 states. Second operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:55,794 INFO L74 IsIncluded]: Start isIncluded. First operand 2213 states. Second operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:55,796 INFO L87 Difference]: Start difference. First operand 2213 states. Second operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:56,016 INFO L93 Difference]: Finished difference Result 2213 states and 3619 transitions. [2022-02-20 18:57:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3619 transitions. [2022-02-20 18:57:56,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:56,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:56,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2213 states. [2022-02-20 18:57:56,025 INFO L87 Difference]: Start difference. First operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2213 states. [2022-02-20 18:57:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:56,224 INFO L93 Difference]: Finished difference Result 2213 states and 3619 transitions. [2022-02-20 18:57:56,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3619 transitions. [2022-02-20 18:57:56,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:56,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:56,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:56,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 1.6236099230111207) internal successors, (1898), 1169 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1898 transitions. [2022-02-20 18:57:56,326 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1898 transitions. Word has length 68 [2022-02-20 18:57:56,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:56,327 INFO L470 AbstractCegarLoop]: Abstraction has 1170 states and 1898 transitions. [2022-02-20 18:57:56,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1898 transitions. [2022-02-20 18:57:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:57:56,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:56,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:56,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:57:56,330 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:56,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:56,331 INFO L85 PathProgramCache]: Analyzing trace with hash 47496755, now seen corresponding path program 1 times [2022-02-20 18:57:56,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:56,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705205554] [2022-02-20 18:57:56,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:56,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:56,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {16888#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1285~0 := 0;~__return_1434~0 := 0;~__return_1520~0 := 0; {16888#true} is VALID [2022-02-20 18:57:56,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {16888#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {16888#true} is VALID [2022-02-20 18:57:56,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {16888#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {16888#true} is VALID [2022-02-20 18:57:56,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {16888#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:57:56,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {16888#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {16888#true} is VALID [2022-02-20 18:57:56,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {16888#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:57:56,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {16888#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {16888#true} is VALID [2022-02-20 18:57:56,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {16888#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:57:56,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {16888#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {16888#true} is VALID [2022-02-20 18:57:56,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {16888#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:57:56,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {16888#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {16888#true} is VALID [2022-02-20 18:57:56,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {16888#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:57:56,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {16888#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {16888#true} is VALID [2022-02-20 18:57:56,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {16888#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {16888#true} is VALID [2022-02-20 18:57:56,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {16888#true} assume ~id1~0 != ~id2~0; {16888#true} is VALID [2022-02-20 18:57:56,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {16888#true} assume ~id1~0 != ~id3~0; {16888#true} is VALID [2022-02-20 18:57:56,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {16888#true} assume ~id2~0 != ~id3~0; {16888#true} is VALID [2022-02-20 18:57:56,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {16888#true} assume ~id1~0 >= 0; {16888#true} is VALID [2022-02-20 18:57:56,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {16888#true} assume ~id2~0 >= 0; {16888#true} is VALID [2022-02-20 18:57:56,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {16888#true} assume ~id3~0 >= 0; {16888#true} is VALID [2022-02-20 18:57:56,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {16888#true} assume 0 == ~r1~0; {16888#true} is VALID [2022-02-20 18:57:56,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {16888#true} assume 0 == ~r2~0; {16888#true} is VALID [2022-02-20 18:57:56,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {16888#true} assume 0 == ~r3~0; {16888#true} is VALID [2022-02-20 18:57:56,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {16888#true} assume !(0 == main_~init__r122~0#1 % 256); {16888#true} is VALID [2022-02-20 18:57:56,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {16888#true} assume !(0 == main_~init__r132~0#1 % 256); {16888#true} is VALID [2022-02-20 18:57:56,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {16888#true} assume !(0 == main_~init__r212~0#1 % 256); {16888#true} is VALID [2022-02-20 18:57:56,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {16888#true} assume !(0 == main_~init__r232~0#1 % 256); {16888#true} is VALID [2022-02-20 18:57:56,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {16888#true} assume !(0 == main_~init__r312~0#1 % 256); {16888#true} is VALID [2022-02-20 18:57:56,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {16888#true} assume !(0 == main_~init__r322~0#1 % 256); {16888#true} is VALID [2022-02-20 18:57:56,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {16888#true} assume ~max1~0 == ~id1~0; {16888#true} is VALID [2022-02-20 18:57:56,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {16888#true} assume ~max2~0 == ~id2~0; {16888#true} is VALID [2022-02-20 18:57:56,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {16888#true} assume ~max3~0 == ~id3~0; {16888#true} is VALID [2022-02-20 18:57:56,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {16888#true} assume 0 == ~st1~0; {16890#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:56,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {16890#(<= ~st1~0 0)} assume 0 == ~st2~0; {16890#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:56,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {16890#(<= ~st1~0 0)} assume 0 == ~st3~0; {16890#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:56,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {16890#(<= ~st1~0 0)} assume 0 == ~nl1~0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1285~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1285~0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,435 INFO L290 TraceCheckUtils]: 47: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 < 2; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,436 INFO L290 TraceCheckUtils]: 48: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,437 INFO L290 TraceCheckUtils]: 50: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,437 INFO L290 TraceCheckUtils]: 51: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 < 2; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,439 INFO L290 TraceCheckUtils]: 55: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,440 INFO L290 TraceCheckUtils]: 59: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 < 2; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,442 INFO L290 TraceCheckUtils]: 62: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,442 INFO L290 TraceCheckUtils]: 63: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,442 INFO L290 TraceCheckUtils]: 64: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16891#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:56,443 INFO L290 TraceCheckUtils]: 65: Hoare triple {16891#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {16889#false} is VALID [2022-02-20 18:57:56,443 INFO L290 TraceCheckUtils]: 66: Hoare triple {16889#false} ~__return_1434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1434~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {16889#false} is VALID [2022-02-20 18:57:56,443 INFO L290 TraceCheckUtils]: 67: Hoare triple {16889#false} assume 0 == main_~assert__arg~0#1 % 256; {16889#false} is VALID [2022-02-20 18:57:56,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {16889#false} assume !false; {16889#false} is VALID [2022-02-20 18:57:56,445 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:56,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:56,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705205554] [2022-02-20 18:57:56,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705205554] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:56,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:56,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:57:56,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101822344] [2022-02-20 18:57:56,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:56,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-02-20 18:57:56,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:56,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:56,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:56,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:57:56,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:56,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:57:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:57:56,497 INFO L87 Difference]: Start difference. First operand 1170 states and 1898 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:59,319 INFO L93 Difference]: Finished difference Result 3409 states and 5599 transitions. [2022-02-20 18:57:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:57:59,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-02-20 18:57:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:57:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:57:59,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 671 transitions. [2022-02-20 18:57:59,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 671 edges. 671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:59,999 INFO L225 Difference]: With dead ends: 3409 [2022-02-20 18:57:59,999 INFO L226 Difference]: Without dead ends: 2296 [2022-02-20 18:58:00,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:58:00,001 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 430 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:00,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 755 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2022-02-20 18:58:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1724. [2022-02-20 18:58:01,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:01,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2296 states. Second operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:01,290 INFO L74 IsIncluded]: Start isIncluded. First operand 2296 states. Second operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:01,293 INFO L87 Difference]: Start difference. First operand 2296 states. Second operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:01,528 INFO L93 Difference]: Finished difference Result 2296 states and 3762 transitions. [2022-02-20 18:58:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3762 transitions. [2022-02-20 18:58:01,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:01,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:01,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2296 states. [2022-02-20 18:58:01,551 INFO L87 Difference]: Start difference. First operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2296 states. [2022-02-20 18:58:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:01,703 INFO L93 Difference]: Finished difference Result 2296 states and 3762 transitions. [2022-02-20 18:58:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3762 transitions. [2022-02-20 18:58:01,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:01,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:01,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:01,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 1.6297156123041208) internal successors, (2808), 1723 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2808 transitions. [2022-02-20 18:58:01,869 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2808 transitions. Word has length 69 [2022-02-20 18:58:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:01,869 INFO L470 AbstractCegarLoop]: Abstraction has 1724 states and 2808 transitions. [2022-02-20 18:58:01,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2808 transitions. [2022-02-20 18:58:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:01,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:01,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:01,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:58:01,871 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:01,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:01,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1156873170, now seen corresponding path program 1 times [2022-02-20 18:58:01,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:01,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259885074] [2022-02-20 18:58:01,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:01,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:01,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {28674#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1285~0 := 0;~__return_1434~0 := 0;~__return_1520~0 := 0; {28674#true} is VALID [2022-02-20 18:58:01,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {28674#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {28674#true} is VALID [2022-02-20 18:58:01,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {28674#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:01,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {28674#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:01,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {28674#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:01,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {28674#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:01,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {28674#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:01,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {28674#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:01,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {28674#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:01,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {28674#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:01,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {28674#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:01,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {28674#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:01,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {28674#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {28674#true} is VALID [2022-02-20 18:58:01,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {28674#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {28674#true} is VALID [2022-02-20 18:58:01,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {28674#true} assume ~id1~0 != ~id2~0; {28674#true} is VALID [2022-02-20 18:58:01,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {28674#true} assume ~id1~0 != ~id3~0; {28674#true} is VALID [2022-02-20 18:58:01,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {28674#true} assume ~id2~0 != ~id3~0; {28674#true} is VALID [2022-02-20 18:58:01,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {28674#true} assume ~id1~0 >= 0; {28674#true} is VALID [2022-02-20 18:58:01,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {28674#true} assume ~id2~0 >= 0; {28674#true} is VALID [2022-02-20 18:58:01,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {28674#true} assume ~id3~0 >= 0; {28674#true} is VALID [2022-02-20 18:58:01,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {28674#true} assume 0 == ~r1~0; {28674#true} is VALID [2022-02-20 18:58:01,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {28674#true} assume 0 == ~r2~0; {28674#true} is VALID [2022-02-20 18:58:01,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {28674#true} assume 0 == ~r3~0; {28674#true} is VALID [2022-02-20 18:58:01,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {28674#true} assume !(0 == main_~init__r122~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:01,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {28674#true} assume !(0 == main_~init__r132~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:01,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {28674#true} assume !(0 == main_~init__r212~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:01,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {28674#true} assume !(0 == main_~init__r232~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:01,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {28674#true} assume !(0 == main_~init__r312~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:01,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {28674#true} assume !(0 == main_~init__r322~0#1 % 256); {28674#true} is VALID [2022-02-20 18:58:01,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {28674#true} assume ~max1~0 == ~id1~0; {28674#true} is VALID [2022-02-20 18:58:01,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {28674#true} assume ~max2~0 == ~id2~0; {28674#true} is VALID [2022-02-20 18:58:01,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {28674#true} assume ~max3~0 == ~id3~0; {28674#true} is VALID [2022-02-20 18:58:01,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {28674#true} assume 0 == ~st1~0; {28674#true} is VALID [2022-02-20 18:58:01,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {28674#true} assume 0 == ~st2~0; {28674#true} is VALID [2022-02-20 18:58:01,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {28674#true} assume 0 == ~st3~0; {28674#true} is VALID [2022-02-20 18:58:01,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {28674#true} assume 0 == ~nl1~0; {28674#true} is VALID [2022-02-20 18:58:01,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {28674#true} assume 0 == ~nl2~0; {28674#true} is VALID [2022-02-20 18:58:01,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {28674#true} assume 0 == ~nl3~0; {28674#true} is VALID [2022-02-20 18:58:01,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {28674#true} assume 0 == ~mode1~0 % 256; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:01,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:01,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:01,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax1~0 % 256); {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:01,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax2~0 % 256); {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:01,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1285~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1285~0; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:01,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:01,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:01,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {28676#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {28675#false} is VALID [2022-02-20 18:58:01,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {28675#false} assume !!(0 == ~ep21~0 % 256); {28675#false} is VALID [2022-02-20 18:58:01,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {28675#false} assume !!(0 == ~ep31~0 % 256); {28675#false} is VALID [2022-02-20 18:58:01,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {28675#false} ~newmax1~0 := main_~node1__newmax~0#1; {28675#false} is VALID [2022-02-20 18:58:01,943 INFO L290 TraceCheckUtils]: 50: Hoare triple {28675#false} assume 1 == ~r1~0; {28675#false} is VALID [2022-02-20 18:58:01,943 INFO L290 TraceCheckUtils]: 51: Hoare triple {28675#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {28675#false} is VALID [2022-02-20 18:58:01,943 INFO L290 TraceCheckUtils]: 52: Hoare triple {28675#false} ~mode1~0 := 0; {28675#false} is VALID [2022-02-20 18:58:01,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {28675#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {28675#false} is VALID [2022-02-20 18:58:01,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {28675#false} assume !!(0 == ~mode2~0 % 256); {28675#false} is VALID [2022-02-20 18:58:01,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {28675#false} assume ~r2~0 < 2; {28675#false} is VALID [2022-02-20 18:58:01,944 INFO L290 TraceCheckUtils]: 56: Hoare triple {28675#false} assume !!(0 == ~ep21~0 % 256); {28675#false} is VALID [2022-02-20 18:58:01,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {28675#false} assume !!(0 == ~ep23~0 % 256); {28675#false} is VALID [2022-02-20 18:58:01,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {28675#false} ~mode2~0 := 1; {28675#false} is VALID [2022-02-20 18:58:01,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {28675#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {28675#false} is VALID [2022-02-20 18:58:01,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {28675#false} assume !!(0 == ~mode3~0 % 256); {28675#false} is VALID [2022-02-20 18:58:01,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {28675#false} assume ~r3~0 < 2; {28675#false} is VALID [2022-02-20 18:58:01,945 INFO L290 TraceCheckUtils]: 62: Hoare triple {28675#false} assume !!(0 == ~ep31~0 % 256); {28675#false} is VALID [2022-02-20 18:58:01,945 INFO L290 TraceCheckUtils]: 63: Hoare triple {28675#false} assume !!(0 == ~ep32~0 % 256); {28675#false} is VALID [2022-02-20 18:58:01,945 INFO L290 TraceCheckUtils]: 64: Hoare triple {28675#false} ~mode3~0 := 1; {28675#false} is VALID [2022-02-20 18:58:01,945 INFO L290 TraceCheckUtils]: 65: Hoare triple {28675#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {28675#false} is VALID [2022-02-20 18:58:01,945 INFO L290 TraceCheckUtils]: 66: Hoare triple {28675#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {28675#false} is VALID [2022-02-20 18:58:01,945 INFO L290 TraceCheckUtils]: 67: Hoare triple {28675#false} ~__return_1434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1434~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {28675#false} is VALID [2022-02-20 18:58:01,946 INFO L290 TraceCheckUtils]: 68: Hoare triple {28675#false} assume 0 == main_~assert__arg~0#1 % 256; {28675#false} is VALID [2022-02-20 18:58:01,946 INFO L290 TraceCheckUtils]: 69: Hoare triple {28675#false} assume !false; {28675#false} is VALID [2022-02-20 18:58:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:01,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:01,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259885074] [2022-02-20 18:58:01,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259885074] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:01,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:01,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:01,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942346530] [2022-02-20 18:58:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:01,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:58:01,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:01,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:02,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:02,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:02,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:02,003 INFO L87 Difference]: Start difference. First operand 1724 states and 2808 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:04,688 INFO L93 Difference]: Finished difference Result 3779 states and 6218 transitions. [2022-02-20 18:58:04,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:04,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:58:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:04,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 485 transitions. [2022-02-20 18:58:04,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:05,263 INFO L225 Difference]: With dead ends: 3779 [2022-02-20 18:58:05,263 INFO L226 Difference]: Without dead ends: 2591 [2022-02-20 18:58:05,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:05,265 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 132 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:05,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 512 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2022-02-20 18:58:07,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2589. [2022-02-20 18:58:07,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:07,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2591 states. Second operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:07,035 INFO L74 IsIncluded]: Start isIncluded. First operand 2591 states. Second operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:07,037 INFO L87 Difference]: Start difference. First operand 2591 states. Second operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:07,212 INFO L93 Difference]: Finished difference Result 2591 states and 4228 transitions. [2022-02-20 18:58:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 4228 transitions. [2022-02-20 18:58:07,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:07,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:07,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2591 states. [2022-02-20 18:58:07,222 INFO L87 Difference]: Start difference. First operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2591 states. [2022-02-20 18:58:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:07,419 INFO L93 Difference]: Finished difference Result 2591 states and 4228 transitions. [2022-02-20 18:58:07,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 4228 transitions. [2022-02-20 18:58:07,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:07,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:07,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:07,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 2588 states have (on average 1.6333075734157652) internal successors, (4227), 2588 states have internal predecessors, (4227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4227 transitions. [2022-02-20 18:58:07,708 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 4227 transitions. Word has length 70 [2022-02-20 18:58:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:07,709 INFO L470 AbstractCegarLoop]: Abstraction has 2589 states and 4227 transitions. [2022-02-20 18:58:07,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 4227 transitions. [2022-02-20 18:58:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:07,709 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:07,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:07,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:58:07,710 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1843763252, now seen corresponding path program 1 times [2022-02-20 18:58:07,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:07,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763416755] [2022-02-20 18:58:07,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:07,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:07,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {42782#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1285~0 := 0;~__return_1434~0 := 0;~__return_1520~0 := 0; {42782#true} is VALID [2022-02-20 18:58:07,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {42782#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {42782#true} is VALID [2022-02-20 18:58:07,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {42782#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:07,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {42782#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:07,775 INFO L290 TraceCheckUtils]: 4: Hoare triple {42782#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:07,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {42782#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:07,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {42782#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:07,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {42782#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:07,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {42782#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:07,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {42782#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:07,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {42782#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:07,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {42782#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:07,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {42782#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {42782#true} is VALID [2022-02-20 18:58:07,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {42782#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {42782#true} is VALID [2022-02-20 18:58:07,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {42782#true} assume ~id1~0 != ~id2~0; {42782#true} is VALID [2022-02-20 18:58:07,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {42782#true} assume ~id1~0 != ~id3~0; {42782#true} is VALID [2022-02-20 18:58:07,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {42782#true} assume ~id2~0 != ~id3~0; {42782#true} is VALID [2022-02-20 18:58:07,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {42782#true} assume ~id1~0 >= 0; {42782#true} is VALID [2022-02-20 18:58:07,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {42782#true} assume ~id2~0 >= 0; {42782#true} is VALID [2022-02-20 18:58:07,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {42782#true} assume ~id3~0 >= 0; {42782#true} is VALID [2022-02-20 18:58:07,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {42782#true} assume 0 == ~r1~0; {42782#true} is VALID [2022-02-20 18:58:07,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {42782#true} assume 0 == ~r2~0; {42782#true} is VALID [2022-02-20 18:58:07,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {42782#true} assume 0 == ~r3~0; {42782#true} is VALID [2022-02-20 18:58:07,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {42782#true} assume !(0 == main_~init__r122~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:07,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {42782#true} assume !(0 == main_~init__r132~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:07,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {42782#true} assume !(0 == main_~init__r212~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:07,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {42782#true} assume !(0 == main_~init__r232~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:07,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {42782#true} assume !(0 == main_~init__r312~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:07,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {42782#true} assume !(0 == main_~init__r322~0#1 % 256); {42782#true} is VALID [2022-02-20 18:58:07,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {42782#true} assume ~max1~0 == ~id1~0; {42782#true} is VALID [2022-02-20 18:58:07,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {42782#true} assume ~max2~0 == ~id2~0; {42782#true} is VALID [2022-02-20 18:58:07,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {42782#true} assume ~max3~0 == ~id3~0; {42782#true} is VALID [2022-02-20 18:58:07,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {42782#true} assume 0 == ~st1~0; {42782#true} is VALID [2022-02-20 18:58:07,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {42782#true} assume 0 == ~st2~0; {42782#true} is VALID [2022-02-20 18:58:07,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {42782#true} assume 0 == ~st3~0; {42782#true} is VALID [2022-02-20 18:58:07,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {42782#true} assume 0 == ~nl1~0; {42782#true} is VALID [2022-02-20 18:58:07,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {42782#true} assume 0 == ~nl2~0; {42782#true} is VALID [2022-02-20 18:58:07,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {42782#true} assume 0 == ~nl3~0; {42782#true} is VALID [2022-02-20 18:58:07,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {42782#true} assume 0 == ~mode1~0 % 256; {42782#true} is VALID [2022-02-20 18:58:07,781 INFO L290 TraceCheckUtils]: 39: Hoare triple {42782#true} assume 0 == ~mode2~0 % 256; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,782 INFO L290 TraceCheckUtils]: 41: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax1~0 % 256); {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,783 INFO L290 TraceCheckUtils]: 42: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax2~0 % 256); {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1285~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1285~0; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,785 INFO L290 TraceCheckUtils]: 47: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 < 2; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep12~0 % 256); {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~ep13~0 % 256); {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:58:07,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {42784#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);~r2~0 := (if (1 + ~r2~0) % 256 <= 127 then (1 + ~r2~0) % 256 else (1 + ~r2~0) % 256 - 256); {42783#false} is VALID [2022-02-20 18:58:07,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {42783#false} assume !!(0 == ~ep12~0 % 256); {42783#false} is VALID [2022-02-20 18:58:07,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {42783#false} assume !!(0 == ~ep32~0 % 256); {42783#false} is VALID [2022-02-20 18:58:07,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {42783#false} ~newmax2~0 := main_~node2__newmax~0#1; {42783#false} is VALID [2022-02-20 18:58:07,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {42783#false} assume 2 == ~r2~0; {42783#false} is VALID [2022-02-20 18:58:07,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {42783#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {42783#false} is VALID [2022-02-20 18:58:07,789 INFO L290 TraceCheckUtils]: 58: Hoare triple {42783#false} ~mode2~0 := 0; {42783#false} is VALID [2022-02-20 18:58:07,789 INFO L290 TraceCheckUtils]: 59: Hoare triple {42783#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {42783#false} is VALID [2022-02-20 18:58:07,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {42783#false} assume !!(0 == ~mode3~0 % 256); {42783#false} is VALID [2022-02-20 18:58:07,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {42783#false} assume ~r3~0 < 2; {42783#false} is VALID [2022-02-20 18:58:07,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {42783#false} assume !!(0 == ~ep31~0 % 256); {42783#false} is VALID [2022-02-20 18:58:07,790 INFO L290 TraceCheckUtils]: 63: Hoare triple {42783#false} assume !!(0 == ~ep32~0 % 256); {42783#false} is VALID [2022-02-20 18:58:07,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {42783#false} ~mode3~0 := 1; {42783#false} is VALID [2022-02-20 18:58:07,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {42783#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {42783#false} is VALID [2022-02-20 18:58:07,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {42783#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {42783#false} is VALID [2022-02-20 18:58:07,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {42783#false} ~__return_1434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1434~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {42783#false} is VALID [2022-02-20 18:58:07,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {42783#false} assume 0 == main_~assert__arg~0#1 % 256; {42783#false} is VALID [2022-02-20 18:58:07,791 INFO L290 TraceCheckUtils]: 69: Hoare triple {42783#false} assume !false; {42783#false} is VALID [2022-02-20 18:58:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:07,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:07,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763416755] [2022-02-20 18:58:07,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763416755] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:07,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:07,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:07,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549573604] [2022-02-20 18:58:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:07,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:58:07,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:07,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:07,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:07,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:07,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:07,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:07,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:07,845 INFO L87 Difference]: Start difference. First operand 2589 states and 4227 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:11,363 INFO L93 Difference]: Finished difference Result 5033 states and 8246 transitions. [2022-02-20 18:58:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:11,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:58:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-02-20 18:58:11,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 485 transitions. [2022-02-20 18:58:11,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:12,231 INFO L225 Difference]: With dead ends: 5033 [2022-02-20 18:58:12,231 INFO L226 Difference]: Without dead ends: 3599 [2022-02-20 18:58:12,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:12,233 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 126 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:12,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 498 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2022-02-20 18:58:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3597. [2022-02-20 18:58:14,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:14,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3599 states. Second operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:14,782 INFO L74 IsIncluded]: Start isIncluded. First operand 3599 states. Second operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:14,785 INFO L87 Difference]: Start difference. First operand 3599 states. Second operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:15,199 INFO L93 Difference]: Finished difference Result 3599 states and 5858 transitions. [2022-02-20 18:58:15,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5858 transitions. [2022-02-20 18:58:15,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:15,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:15,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3599 states. [2022-02-20 18:58:15,213 INFO L87 Difference]: Start difference. First operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3599 states. [2022-02-20 18:58:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:15,680 INFO L93 Difference]: Finished difference Result 3599 states and 5858 transitions. [2022-02-20 18:58:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5858 transitions. [2022-02-20 18:58:15,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:15,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:15,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:15,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 3596 states have (on average 1.628754171301446) internal successors, (5857), 3596 states have internal predecessors, (5857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 5857 transitions. [2022-02-20 18:58:16,242 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 5857 transitions. Word has length 70 [2022-02-20 18:58:16,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:16,242 INFO L470 AbstractCegarLoop]: Abstraction has 3597 states and 5857 transitions. [2022-02-20 18:58:16,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 5857 transitions. [2022-02-20 18:58:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:16,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:16,243 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:16,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:58:16,244 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:16,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:16,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1414453242, now seen corresponding path program 1 times [2022-02-20 18:58:16,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:16,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966582261] [2022-02-20 18:58:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:16,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:16,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {62079#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1285~0 := 0;~__return_1434~0 := 0;~__return_1520~0 := 0; {62079#true} is VALID [2022-02-20 18:58:16,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {62079#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {62079#true} is VALID [2022-02-20 18:58:16,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {62079#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:16,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {62079#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:16,318 INFO L290 TraceCheckUtils]: 4: Hoare triple {62079#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:16,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {62079#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:16,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {62079#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:16,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {62079#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:16,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {62079#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:16,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {62079#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:16,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {62079#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:16,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {62079#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:16,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {62079#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {62079#true} is VALID [2022-02-20 18:58:16,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {62079#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {62079#true} is VALID [2022-02-20 18:58:16,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {62079#true} assume ~id1~0 != ~id2~0; {62079#true} is VALID [2022-02-20 18:58:16,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {62079#true} assume ~id1~0 != ~id3~0; {62079#true} is VALID [2022-02-20 18:58:16,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {62079#true} assume ~id2~0 != ~id3~0; {62079#true} is VALID [2022-02-20 18:58:16,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {62079#true} assume ~id1~0 >= 0; {62079#true} is VALID [2022-02-20 18:58:16,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {62079#true} assume ~id2~0 >= 0; {62079#true} is VALID [2022-02-20 18:58:16,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {62079#true} assume ~id3~0 >= 0; {62079#true} is VALID [2022-02-20 18:58:16,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {62079#true} assume 0 == ~r1~0; {62079#true} is VALID [2022-02-20 18:58:16,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {62079#true} assume 0 == ~r2~0; {62079#true} is VALID [2022-02-20 18:58:16,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {62079#true} assume 0 == ~r3~0; {62079#true} is VALID [2022-02-20 18:58:16,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {62079#true} assume !(0 == main_~init__r122~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:16,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {62079#true} assume !(0 == main_~init__r132~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:16,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {62079#true} assume !(0 == main_~init__r212~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:16,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {62079#true} assume !(0 == main_~init__r232~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:16,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {62079#true} assume !(0 == main_~init__r312~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:16,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {62079#true} assume !(0 == main_~init__r322~0#1 % 256); {62079#true} is VALID [2022-02-20 18:58:16,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {62079#true} assume ~max1~0 == ~id1~0; {62079#true} is VALID [2022-02-20 18:58:16,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {62079#true} assume ~max2~0 == ~id2~0; {62079#true} is VALID [2022-02-20 18:58:16,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {62079#true} assume ~max3~0 == ~id3~0; {62079#true} is VALID [2022-02-20 18:58:16,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {62079#true} assume 0 == ~st1~0; {62079#true} is VALID [2022-02-20 18:58:16,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {62079#true} assume 0 == ~st2~0; {62081#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:16,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {62081#(<= ~st2~0 0)} assume 0 == ~st3~0; {62081#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:16,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {62081#(<= ~st2~0 0)} assume 0 == ~nl1~0; {62081#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:16,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {62081#(<= ~st2~0 0)} assume 0 == ~nl2~0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax1~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax2~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1285~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1285~0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 < 2; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,331 INFO L290 TraceCheckUtils]: 48: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 < 2; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,333 INFO L290 TraceCheckUtils]: 54: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,334 INFO L290 TraceCheckUtils]: 56: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,334 INFO L290 TraceCheckUtils]: 57: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,335 INFO L290 TraceCheckUtils]: 59: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 < 2; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,335 INFO L290 TraceCheckUtils]: 60: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,336 INFO L290 TraceCheckUtils]: 62: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,337 INFO L290 TraceCheckUtils]: 65: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {62082#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:16,338 INFO L290 TraceCheckUtils]: 66: Hoare triple {62082#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {62080#false} is VALID [2022-02-20 18:58:16,338 INFO L290 TraceCheckUtils]: 67: Hoare triple {62080#false} ~__return_1434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1434~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {62080#false} is VALID [2022-02-20 18:58:16,338 INFO L290 TraceCheckUtils]: 68: Hoare triple {62080#false} assume 0 == main_~assert__arg~0#1 % 256; {62080#false} is VALID [2022-02-20 18:58:16,338 INFO L290 TraceCheckUtils]: 69: Hoare triple {62080#false} assume !false; {62080#false} is VALID [2022-02-20 18:58:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:16,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:16,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966582261] [2022-02-20 18:58:16,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966582261] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:16,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:16,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:16,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274893768] [2022-02-20 18:58:16,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:16,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:58:16,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:16,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:16,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:16,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:16,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:16,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:16,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:16,387 INFO L87 Difference]: Start difference. First operand 3597 states and 5857 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:28,017 INFO L93 Difference]: Finished difference Result 11303 states and 18475 transitions. [2022-02-20 18:58:28,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:28,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:58:28,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:58:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-02-20 18:58:28,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 671 transitions. [2022-02-20 18:58:28,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 671 edges. 671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:31,096 INFO L225 Difference]: With dead ends: 11303 [2022-02-20 18:58:31,096 INFO L226 Difference]: Without dead ends: 7781 [2022-02-20 18:58:31,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:58:31,101 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 429 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:31,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 747 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7781 states. [2022-02-20 18:58:36,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7781 to 5670. [2022-02-20 18:58:36,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:36,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7781 states. Second operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:36,058 INFO L74 IsIncluded]: Start isIncluded. First operand 7781 states. Second operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:36,064 INFO L87 Difference]: Start difference. First operand 7781 states. Second operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:37,746 INFO L93 Difference]: Finished difference Result 7781 states and 12668 transitions. [2022-02-20 18:58:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 7781 states and 12668 transitions. [2022-02-20 18:58:37,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:37,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:37,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 7781 states. [2022-02-20 18:58:37,766 INFO L87 Difference]: Start difference. First operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 7781 states. [2022-02-20 18:58:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:39,561 INFO L93 Difference]: Finished difference Result 7781 states and 12668 transitions. [2022-02-20 18:58:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 7781 states and 12668 transitions. [2022-02-20 18:58:39,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:39,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:39,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:39,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5670 states, 5669 states have (on average 1.6232139707179396) internal successors, (9202), 5669 states have internal predecessors, (9202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5670 states to 5670 states and 9202 transitions. [2022-02-20 18:58:40,878 INFO L78 Accepts]: Start accepts. Automaton has 5670 states and 9202 transitions. Word has length 70 [2022-02-20 18:58:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:40,878 INFO L470 AbstractCegarLoop]: Abstraction has 5670 states and 9202 transitions. [2022-02-20 18:58:40,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5670 states and 9202 transitions. [2022-02-20 18:58:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:40,879 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:40,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:40,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:58:40,880 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:40,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1510229994, now seen corresponding path program 1 times [2022-02-20 18:58:40,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:40,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771701696] [2022-02-20 18:58:40,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:40,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:40,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {101470#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1285~0 := 0;~__return_1434~0 := 0;~__return_1520~0 := 0; {101470#true} is VALID [2022-02-20 18:58:40,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {101470#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {101470#true} is VALID [2022-02-20 18:58:40,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {101470#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:40,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {101470#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:40,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {101470#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:40,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {101470#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:40,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {101470#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:40,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {101470#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:40,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {101470#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:40,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {101470#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:40,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {101470#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:40,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {101470#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:40,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {101470#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {101470#true} is VALID [2022-02-20 18:58:40,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {101470#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {101470#true} is VALID [2022-02-20 18:58:40,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {101470#true} assume ~id1~0 != ~id2~0; {101470#true} is VALID [2022-02-20 18:58:40,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {101470#true} assume ~id1~0 != ~id3~0; {101470#true} is VALID [2022-02-20 18:58:40,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {101470#true} assume ~id2~0 != ~id3~0; {101470#true} is VALID [2022-02-20 18:58:40,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {101470#true} assume ~id1~0 >= 0; {101470#true} is VALID [2022-02-20 18:58:40,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {101470#true} assume ~id2~0 >= 0; {101470#true} is VALID [2022-02-20 18:58:40,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {101470#true} assume ~id3~0 >= 0; {101470#true} is VALID [2022-02-20 18:58:40,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {101470#true} assume 0 == ~r1~0; {101470#true} is VALID [2022-02-20 18:58:40,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {101470#true} assume 0 == ~r2~0; {101470#true} is VALID [2022-02-20 18:58:40,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {101470#true} assume 0 == ~r3~0; {101470#true} is VALID [2022-02-20 18:58:40,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {101470#true} assume !(0 == main_~init__r122~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:40,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {101470#true} assume !(0 == main_~init__r132~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:40,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {101470#true} assume !(0 == main_~init__r212~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:40,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {101470#true} assume !(0 == main_~init__r232~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:40,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {101470#true} assume !(0 == main_~init__r312~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:40,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {101470#true} assume !(0 == main_~init__r322~0#1 % 256); {101470#true} is VALID [2022-02-20 18:58:40,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {101470#true} assume ~max1~0 == ~id1~0; {101470#true} is VALID [2022-02-20 18:58:40,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {101470#true} assume ~max2~0 == ~id2~0; {101470#true} is VALID [2022-02-20 18:58:40,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {101470#true} assume ~max3~0 == ~id3~0; {101470#true} is VALID [2022-02-20 18:58:40,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {101470#true} assume 0 == ~st1~0; {101470#true} is VALID [2022-02-20 18:58:40,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {101470#true} assume 0 == ~st2~0; {101470#true} is VALID [2022-02-20 18:58:40,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {101470#true} assume 0 == ~st3~0; {101470#true} is VALID [2022-02-20 18:58:40,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {101470#true} assume 0 == ~nl1~0; {101470#true} is VALID [2022-02-20 18:58:40,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {101470#true} assume 0 == ~nl2~0; {101470#true} is VALID [2022-02-20 18:58:40,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {101470#true} assume 0 == ~nl3~0; {101470#true} is VALID [2022-02-20 18:58:40,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {101470#true} assume 0 == ~mode1~0 % 256; {101470#true} is VALID [2022-02-20 18:58:40,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {101470#true} assume 0 == ~mode2~0 % 256; {101470#true} is VALID [2022-02-20 18:58:40,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {101470#true} assume 0 == ~mode3~0 % 256; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax1~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax2~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1285~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1285~0; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 < 2; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep12~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,943 INFO L290 TraceCheckUtils]: 49: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep13~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,943 INFO L290 TraceCheckUtils]: 50: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,944 INFO L290 TraceCheckUtils]: 51: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,944 INFO L290 TraceCheckUtils]: 52: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 < 2; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,945 INFO L290 TraceCheckUtils]: 54: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep21~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,946 INFO L290 TraceCheckUtils]: 55: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~ep23~0 % 256); {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,946 INFO L290 TraceCheckUtils]: 56: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,946 INFO L290 TraceCheckUtils]: 57: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:58:40,947 INFO L290 TraceCheckUtils]: 58: Hoare triple {101472#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);~r3~0 := (if (1 + ~r3~0) % 256 <= 127 then (1 + ~r3~0) % 256 else (1 + ~r3~0) % 256 - 256); {101471#false} is VALID [2022-02-20 18:58:40,947 INFO L290 TraceCheckUtils]: 59: Hoare triple {101471#false} assume !!(0 == ~ep13~0 % 256); {101471#false} is VALID [2022-02-20 18:58:40,948 INFO L290 TraceCheckUtils]: 60: Hoare triple {101471#false} assume !!(0 == ~ep23~0 % 256); {101471#false} is VALID [2022-02-20 18:58:40,948 INFO L290 TraceCheckUtils]: 61: Hoare triple {101471#false} ~newmax3~0 := main_~node3__newmax~0#1; {101471#false} is VALID [2022-02-20 18:58:40,948 INFO L290 TraceCheckUtils]: 62: Hoare triple {101471#false} assume 2 == ~r3~0; {101471#false} is VALID [2022-02-20 18:58:40,948 INFO L290 TraceCheckUtils]: 63: Hoare triple {101471#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {101471#false} is VALID [2022-02-20 18:58:40,948 INFO L290 TraceCheckUtils]: 64: Hoare triple {101471#false} ~mode3~0 := 0; {101471#false} is VALID [2022-02-20 18:58:40,948 INFO L290 TraceCheckUtils]: 65: Hoare triple {101471#false} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {101471#false} is VALID [2022-02-20 18:58:40,949 INFO L290 TraceCheckUtils]: 66: Hoare triple {101471#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {101471#false} is VALID [2022-02-20 18:58:40,949 INFO L290 TraceCheckUtils]: 67: Hoare triple {101471#false} ~__return_1434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1434~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {101471#false} is VALID [2022-02-20 18:58:40,949 INFO L290 TraceCheckUtils]: 68: Hoare triple {101471#false} assume 0 == main_~assert__arg~0#1 % 256; {101471#false} is VALID [2022-02-20 18:58:40,949 INFO L290 TraceCheckUtils]: 69: Hoare triple {101471#false} assume !false; {101471#false} is VALID [2022-02-20 18:58:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:40,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:40,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771701696] [2022-02-20 18:58:40,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771701696] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:40,950 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:40,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:40,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442082890] [2022-02-20 18:58:40,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:40,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 18:58:40,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:40,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:40,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:40,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:40,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:40,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:40,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:40,997 INFO L87 Difference]: Start difference. First operand 5670 states and 9202 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)