./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+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.UNBOUNDED.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 4086756fe326e2f90904c763827ae3d38d44a78a9eb1422e3198b9e38a459658 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:57:50,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:57:50,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:57:50,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:57:50,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:57:50,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:57:50,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:57:50,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:57:50,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:57:50,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:57:50,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:57:50,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:57:50,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:57:50,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:57:50,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:57:50,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:57:50,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:57:50,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:57:50,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:57:50,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:57:50,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:57:50,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:57:50,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:57:50,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:57:50,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:57:50,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:57:50,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:57:50,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:57:50,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:57:50,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:57:50,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:57:50,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:57:50,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:57:50,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:57:50,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:57:50,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:57:50,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:57:50,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:57:50,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:57:50,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:57:50,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:57:50,256 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:50,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:57:50,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:57:50,286 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:57:50,286 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:57:50,287 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:57:50,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:57:50,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:57:50,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:57:50,288 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:57:50,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:57:50,289 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:57:50,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:57:50,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:57:50,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:57:50,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:57:50,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:57:50,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:57:50,290 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:57:50,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:57:50,290 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:57:50,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:57:50,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:57:50,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:57:50,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:57:50,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:57:50,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:57:50,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:57:50,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:57:50,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:57:50,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:57:50,292 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:57:50,292 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:57:50,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:57:50,293 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 -> 4086756fe326e2f90904c763827ae3d38d44a78a9eb1422e3198b9e38a459658 [2022-02-20 18:57:50,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:57:50,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:57:50,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:57:50,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:57:50,564 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:57:50,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:57:50,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63ce984a/c2298a543a024574bd6ec766b5745108/FLAGcf6efddf2 [2022-02-20 18:57:51,040 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:57:51,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:57:51,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63ce984a/c2298a543a024574bd6ec766b5745108/FLAGcf6efddf2 [2022-02-20 18:57:51,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63ce984a/c2298a543a024574bd6ec766b5745108 [2022-02-20 18:57:51,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:57:51,412 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:57:51,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:57:51,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:57:51,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:57:51,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:57:51" (1/1) ... [2022-02-20 18:57:51,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e16e8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:51, skipping insertion in model container [2022-02-20 18:57:51,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:57:51" (1/1) ... [2022-02-20 18:57:51,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:57:51,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:57:51,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7920,7933] [2022-02-20 18:57:51,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:57:51,694 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:57:51,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7920,7933] [2022-02-20 18:57:51,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:57:51,794 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:57:51,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:51 WrapperNode [2022-02-20 18:57:51,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:57:51,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:57:51,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:57:51,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:57:51,803 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:51" (1/1) ... [2022-02-20 18:57:51,813 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:51" (1/1) ... [2022-02-20 18:57:51,854 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 635 [2022-02-20 18:57:51,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:57:51,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:57:51,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:57:51,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:57:51,862 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:51" (1/1) ... [2022-02-20 18:57:51,862 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:51" (1/1) ... [2022-02-20 18:57:51,866 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:51" (1/1) ... [2022-02-20 18:57:51,866 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:51" (1/1) ... [2022-02-20 18:57:51,874 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:51" (1/1) ... [2022-02-20 18:57:51,879 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:51" (1/1) ... [2022-02-20 18:57:51,881 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:51" (1/1) ... [2022-02-20 18:57:51,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:57:51,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:57:51,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:57:51,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:57:51,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:51" (1/1) ... [2022-02-20 18:57:51,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:57:51,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:57:51,928 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:51,942 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:51,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:57:51,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:57:51,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:57:51,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:57:52,095 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:57:52,096 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:57:52,675 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:57:52,683 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:57:52,683 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:57:52,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:57:52 BoogieIcfgContainer [2022-02-20 18:57:52,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:57:52,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:57:52,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:57:52,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:57:52,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:57:51" (1/3) ... [2022-02-20 18:57:52,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d9442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:57:52, skipping insertion in model container [2022-02-20 18:57:52,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:51" (2/3) ... [2022-02-20 18:57:52,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d9442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:57:52, skipping insertion in model container [2022-02-20 18:57:52,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:57:52" (3/3) ... [2022-02-20 18:57:52,693 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:57:52,697 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:57:52,698 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:57:52,740 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:57:52,746 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:52,747 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:57:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 153 states have (on average 1.7450980392156863) internal successors, (267), 154 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call 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:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:57:52,785 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:52,785 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:52,786 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:52,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1975649421, now seen corresponding path program 1 times [2022-02-20 18:57:52,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:52,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185130366] [2022-02-20 18:57:52,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:53,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {158#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_1296~0 := 0;~__return_1445~0 := 0; {158#true} is VALID [2022-02-20 18:57:53,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {158#true} is VALID [2022-02-20 18:57:53,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {158#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {158#true} is VALID [2022-02-20 18:57:53,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {158#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:57:53,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {158#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {158#true} is VALID [2022-02-20 18:57:53,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:57:53,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {158#true} is VALID [2022-02-20 18:57:53,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:57:53,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {158#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {158#true} is VALID [2022-02-20 18:57:53,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {158#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:57:53,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {158#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {158#true} is VALID [2022-02-20 18:57:53,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {158#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:57:53,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {158#true} is VALID [2022-02-20 18:57:53,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {158#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {158#true} is VALID [2022-02-20 18:57:53,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {158#true} assume ~id1~0 != ~id2~0; {158#true} is VALID [2022-02-20 18:57:53,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {158#true} assume ~id1~0 != ~id3~0; {158#true} is VALID [2022-02-20 18:57:53,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {158#true} assume ~id2~0 != ~id3~0; {158#true} is VALID [2022-02-20 18:57:53,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {158#true} assume ~id1~0 >= 0; {158#true} is VALID [2022-02-20 18:57:53,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {158#true} assume ~id2~0 >= 0; {158#true} is VALID [2022-02-20 18:57:53,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {158#true} assume ~id3~0 >= 0; {158#true} is VALID [2022-02-20 18:57:53,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {158#true} assume 0 == ~r1~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r122~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r132~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r212~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r232~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r312~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == main_~init__r322~0#1 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~newmax1~0 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~newmax2~0 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1296~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1296~0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256); {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:53,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {160#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {159#false} is VALID [2022-02-20 18:57:53,242 INFO L290 TraceCheckUtils]: 48: Hoare triple {159#false} ~mode1~0 := 1; {159#false} is VALID [2022-02-20 18:57:53,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {159#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {159#false} is VALID [2022-02-20 18:57:53,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {159#false} assume !!(0 == ~mode2~0 % 256); {159#false} is VALID [2022-02-20 18:57:53,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {159#false} assume !(~r2~0 % 256 < 2); {159#false} is VALID [2022-02-20 18:57:53,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {159#false} ~mode2~0 := 1; {159#false} is VALID [2022-02-20 18:57:53,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {159#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {159#false} is VALID [2022-02-20 18:57:53,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {159#false} assume !!(0 == ~mode3~0 % 256); {159#false} is VALID [2022-02-20 18:57:53,250 INFO L290 TraceCheckUtils]: 55: Hoare triple {159#false} assume !(~r3~0 % 256 < 2); {159#false} is VALID [2022-02-20 18:57:53,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {159#false} ~mode3~0 := 1; {159#false} is VALID [2022-02-20 18:57:53,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {159#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; {159#false} is VALID [2022-02-20 18:57:53,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {159#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {159#false} is VALID [2022-02-20 18:57:53,253 INFO L290 TraceCheckUtils]: 59: Hoare triple {159#false} ~__return_1445~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1445~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; {159#false} is VALID [2022-02-20 18:57:53,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {159#false} assume 0 == main_~assert__arg~0#1 % 256; {159#false} is VALID [2022-02-20 18:57:53,253 INFO L290 TraceCheckUtils]: 61: Hoare triple {159#false} assume !false; {159#false} is VALID [2022-02-20 18:57:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:57:53,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:53,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185130366] [2022-02-20 18:57:53,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185130366] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:53,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:53,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:53,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536578039] [2022-02-20 18:57:53,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:53,265 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:53,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:53,272 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:53,336 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:53,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:53,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:53,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:53,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:53,362 INFO L87 Difference]: Start difference. First operand has 155 states, 153 states have (on average 1.7450980392156863) internal successors, (267), 154 states have internal predecessors, (267), 0 states have call successors, (0), 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:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:53,875 INFO L93 Difference]: Finished difference Result 341 states and 571 transitions. [2022-02-20 18:57:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:53,876 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:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:53,878 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:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2022-02-20 18:57:53,890 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:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2022-02-20 18:57:53,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 571 transitions. [2022-02-20 18:57:54,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 571 edges. 571 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:54,412 INFO L225 Difference]: With dead ends: 341 [2022-02-20 18:57:54,412 INFO L226 Difference]: Without dead ends: 237 [2022-02-20 18:57:54,416 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:54,420 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 157 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:54,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 460 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-20 18:57:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2022-02-20 18:57:54,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:54,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 234 states, 233 states have (on average 1.5665236051502145) internal successors, (365), 233 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call 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:54,514 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 234 states, 233 states have (on average 1.5665236051502145) internal successors, (365), 233 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call 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:54,515 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 234 states, 233 states have (on average 1.5665236051502145) internal successors, (365), 233 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call 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:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:54,528 INFO L93 Difference]: Finished difference Result 237 states and 367 transitions. [2022-02-20 18:57:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 367 transitions. [2022-02-20 18:57:54,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:54,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:54,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 233 states have (on average 1.5665236051502145) internal successors, (365), 233 states have internal predecessors, (365), 0 states have call successors, (0), 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 237 states. [2022-02-20 18:57:54,542 INFO L87 Difference]: Start difference. First operand has 234 states, 233 states have (on average 1.5665236051502145) internal successors, (365), 233 states have internal predecessors, (365), 0 states have call successors, (0), 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 237 states. [2022-02-20 18:57:54,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:54,553 INFO L93 Difference]: Finished difference Result 237 states and 367 transitions. [2022-02-20 18:57:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 367 transitions. [2022-02-20 18:57:54,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:54,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:54,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:54,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.5665236051502145) internal successors, (365), 233 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call 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:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 365 transitions. [2022-02-20 18:57:54,566 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 365 transitions. Word has length 62 [2022-02-20 18:57:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:54,566 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 365 transitions. [2022-02-20 18:57:54,567 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:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 365 transitions. [2022-02-20 18:57:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:57:54,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:54,571 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:54,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:57:54,572 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1826541876, now seen corresponding path program 1 times [2022-02-20 18:57:54,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:54,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041016212] [2022-02-20 18:57:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:54,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {1410#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_1296~0 := 0;~__return_1445~0 := 0; {1410#true} is VALID [2022-02-20 18:57:54,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {1410#true} is VALID [2022-02-20 18:57:54,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {1410#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1410#true} is VALID [2022-02-20 18:57:54,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {1410#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1410#true} is VALID [2022-02-20 18:57:54,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {1410#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1410#true} is VALID [2022-02-20 18:57:54,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {1410#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1410#true} is VALID [2022-02-20 18:57:54,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1410#true} is VALID [2022-02-20 18:57:54,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1410#true} is VALID [2022-02-20 18:57:54,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {1410#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1410#true} is VALID [2022-02-20 18:57:54,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {1410#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1410#true} is VALID [2022-02-20 18:57:54,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {1410#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1410#true} is VALID [2022-02-20 18:57:54,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {1410#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1410#true} is VALID [2022-02-20 18:57:54,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {1410#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1410#true} is VALID [2022-02-20 18:57:54,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {1410#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1410#true} is VALID [2022-02-20 18:57:54,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {1410#true} assume ~id1~0 != ~id2~0; {1410#true} is VALID [2022-02-20 18:57:54,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {1410#true} assume ~id1~0 != ~id3~0; {1410#true} is VALID [2022-02-20 18:57:54,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {1410#true} assume ~id2~0 != ~id3~0; {1410#true} is VALID [2022-02-20 18:57:54,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {1410#true} assume ~id1~0 >= 0; {1410#true} is VALID [2022-02-20 18:57:54,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {1410#true} assume ~id2~0 >= 0; {1410#true} is VALID [2022-02-20 18:57:54,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {1410#true} assume ~id3~0 >= 0; {1410#true} is VALID [2022-02-20 18:57:54,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {1410#true} assume 0 == ~r1~0 % 256; {1410#true} is VALID [2022-02-20 18:57:54,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {1410#true} assume 0 == ~r2~0 % 256; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r122~0#1 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r132~0#1 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r212~0#1 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r232~0#1 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r312~0#1 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == main_~init__r322~0#1 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == ~newmax1~0 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == ~newmax2~0 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1296~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1296~0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} 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; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode1~0 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep12~0 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep13~0 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,718 INFO L290 TraceCheckUtils]: 51: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,718 INFO L290 TraceCheckUtils]: 52: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode2~0 % 256); {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:54,719 INFO L290 TraceCheckUtils]: 53: Hoare triple {1412#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {1411#false} is VALID [2022-02-20 18:57:54,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {1411#false} ~mode2~0 := 1; {1411#false} is VALID [2022-02-20 18:57:54,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {1411#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {1411#false} is VALID [2022-02-20 18:57:54,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {1411#false} assume !!(0 == ~mode3~0 % 256); {1411#false} is VALID [2022-02-20 18:57:54,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {1411#false} assume !(~r3~0 % 256 < 2); {1411#false} is VALID [2022-02-20 18:57:54,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {1411#false} ~mode3~0 := 1; {1411#false} is VALID [2022-02-20 18:57:54,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {1411#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; {1411#false} is VALID [2022-02-20 18:57:54,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {1411#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1411#false} is VALID [2022-02-20 18:57:54,720 INFO L290 TraceCheckUtils]: 61: Hoare triple {1411#false} ~__return_1445~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1445~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; {1411#false} is VALID [2022-02-20 18:57:54,721 INFO L290 TraceCheckUtils]: 62: Hoare triple {1411#false} assume 0 == main_~assert__arg~0#1 % 256; {1411#false} is VALID [2022-02-20 18:57:54,721 INFO L290 TraceCheckUtils]: 63: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-02-20 18:57:54,721 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:54,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:54,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041016212] [2022-02-20 18:57:54,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041016212] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:54,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:54,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:54,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542281117] [2022-02-20 18:57:54,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:54,724 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:54,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:54,725 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:54,777 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:54,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:54,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:54,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:54,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:54,779 INFO L87 Difference]: Start difference. First operand 234 states and 365 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:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:55,211 INFO L93 Difference]: Finished difference Result 572 states and 917 transitions. [2022-02-20 18:57:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:55,211 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:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:55,211 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:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-02-20 18:57:55,216 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:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-02-20 18:57:55,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 535 transitions. [2022-02-20 18:57:55,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:55,612 INFO L225 Difference]: With dead ends: 572 [2022-02-20 18:57:55,612 INFO L226 Difference]: Without dead ends: 395 [2022-02-20 18:57:55,613 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:55,614 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 133 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:55,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 430 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-02-20 18:57:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2022-02-20 18:57:55,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:55,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 391 states, 390 states have (on average 1.5897435897435896) internal successors, (620), 390 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call 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,713 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 391 states, 390 states have (on average 1.5897435897435896) internal successors, (620), 390 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call 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,714 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 391 states, 390 states have (on average 1.5897435897435896) internal successors, (620), 390 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call 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,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:55,727 INFO L93 Difference]: Finished difference Result 395 states and 623 transitions. [2022-02-20 18:57:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 623 transitions. [2022-02-20 18:57:55,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:55,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:55,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 390 states have (on average 1.5897435897435896) internal successors, (620), 390 states have internal predecessors, (620), 0 states have call successors, (0), 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 395 states. [2022-02-20 18:57:55,731 INFO L87 Difference]: Start difference. First operand has 391 states, 390 states have (on average 1.5897435897435896) internal successors, (620), 390 states have internal predecessors, (620), 0 states have call successors, (0), 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 395 states. [2022-02-20 18:57:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:55,744 INFO L93 Difference]: Finished difference Result 395 states and 623 transitions. [2022-02-20 18:57:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 623 transitions. [2022-02-20 18:57:55,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:55,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:55,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:55,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 1.5897435897435896) internal successors, (620), 390 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call 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,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 620 transitions. [2022-02-20 18:57:55,761 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 620 transitions. Word has length 64 [2022-02-20 18:57:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:55,762 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 620 transitions. [2022-02-20 18:57:55,762 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:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 620 transitions. [2022-02-20 18:57:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:57:55,767 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:55,768 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:55,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:57:55,768 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:55,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1385775307, now seen corresponding path program 1 times [2022-02-20 18:57:55,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:55,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764578024] [2022-02-20 18:57:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:55,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:55,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {3526#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_1296~0 := 0;~__return_1445~0 := 0; {3526#true} is VALID [2022-02-20 18:57:55,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {3526#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {3526#true} is VALID [2022-02-20 18:57:55,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {3526#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {3526#true} is VALID [2022-02-20 18:57:55,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {3526#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {3526#true} is VALID [2022-02-20 18:57:55,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {3526#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {3526#true} is VALID [2022-02-20 18:57:55,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {3526#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {3526#true} is VALID [2022-02-20 18:57:55,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {3526#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {3526#true} is VALID [2022-02-20 18:57:55,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {3526#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {3526#true} is VALID [2022-02-20 18:57:55,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {3526#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {3526#true} is VALID [2022-02-20 18:57:55,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {3526#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {3526#true} is VALID [2022-02-20 18:57:55,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {3526#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {3526#true} is VALID [2022-02-20 18:57:55,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {3526#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {3526#true} is VALID [2022-02-20 18:57:55,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {3526#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {3526#true} is VALID [2022-02-20 18:57:55,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {3526#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {3526#true} is VALID [2022-02-20 18:57:55,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {3526#true} assume ~id1~0 != ~id2~0; {3526#true} is VALID [2022-02-20 18:57:55,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {3526#true} assume ~id1~0 != ~id3~0; {3526#true} is VALID [2022-02-20 18:57:55,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {3526#true} assume ~id2~0 != ~id3~0; {3526#true} is VALID [2022-02-20 18:57:55,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {3526#true} assume ~id1~0 >= 0; {3526#true} is VALID [2022-02-20 18:57:55,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {3526#true} assume ~id2~0 >= 0; {3526#true} is VALID [2022-02-20 18:57:55,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {3526#true} assume ~id3~0 >= 0; {3526#true} is VALID [2022-02-20 18:57:55,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {3526#true} assume 0 == ~r1~0 % 256; {3526#true} is VALID [2022-02-20 18:57:55,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {3526#true} assume 0 == ~r2~0 % 256; {3526#true} is VALID [2022-02-20 18:57:55,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {3526#true} assume 0 == ~r3~0 % 256; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r122~0#1 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r132~0#1 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r212~0#1 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r232~0#1 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r312~0#1 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == main_~init__r322~0#1 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == ~newmax1~0 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,907 INFO L290 TraceCheckUtils]: 42: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == ~newmax2~0 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1296~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1296~0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} 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; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode1~0 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep12~0 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep13~0 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,910 INFO L290 TraceCheckUtils]: 51: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode2~0 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep21~0 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,912 INFO L290 TraceCheckUtils]: 55: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep23~0 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,912 INFO L290 TraceCheckUtils]: 56: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,912 INFO L290 TraceCheckUtils]: 57: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,913 INFO L290 TraceCheckUtils]: 58: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode3~0 % 256); {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:55,913 INFO L290 TraceCheckUtils]: 59: Hoare triple {3528#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {3527#false} is VALID [2022-02-20 18:57:55,914 INFO L290 TraceCheckUtils]: 60: Hoare triple {3527#false} ~mode3~0 := 1; {3527#false} is VALID [2022-02-20 18:57:55,914 INFO L290 TraceCheckUtils]: 61: Hoare triple {3527#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; {3527#false} is VALID [2022-02-20 18:57:55,914 INFO L290 TraceCheckUtils]: 62: Hoare triple {3527#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3527#false} is VALID [2022-02-20 18:57:55,914 INFO L290 TraceCheckUtils]: 63: Hoare triple {3527#false} ~__return_1445~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1445~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; {3527#false} is VALID [2022-02-20 18:57:55,914 INFO L290 TraceCheckUtils]: 64: Hoare triple {3527#false} assume 0 == main_~assert__arg~0#1 % 256; {3527#false} is VALID [2022-02-20 18:57:55,914 INFO L290 TraceCheckUtils]: 65: Hoare triple {3527#false} assume !false; {3527#false} is VALID [2022-02-20 18:57:55,915 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:55,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:55,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764578024] [2022-02-20 18:57:55,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764578024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:55,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:55,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:55,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745154873] [2022-02-20 18:57:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:55,917 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:55,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:55,917 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:55,967 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:55,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:55,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:55,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:55,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:55,969 INFO L87 Difference]: Start difference. First operand 391 states and 620 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:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:56,558 INFO L93 Difference]: Finished difference Result 1027 states and 1654 transitions. [2022-02-20 18:57:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:56,558 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:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:56,559 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:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-02-20 18:57:56,569 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:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-02-20 18:57:56,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 535 transitions. [2022-02-20 18:57:56,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:56,995 INFO L225 Difference]: With dead ends: 1027 [2022-02-20 18:57:56,996 INFO L226 Difference]: Without dead ends: 693 [2022-02-20 18:57:56,999 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:57,006 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 127 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:57,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 431 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-02-20 18:57:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 687. [2022-02-20 18:57:57,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:57,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 693 states. Second operand has 687 states, 686 states have (on average 1.597667638483965) internal successors, (1096), 686 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call 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:57,244 INFO L74 IsIncluded]: Start isIncluded. First operand 693 states. Second operand has 687 states, 686 states have (on average 1.597667638483965) internal successors, (1096), 686 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call 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:57,245 INFO L87 Difference]: Start difference. First operand 693 states. Second operand has 687 states, 686 states have (on average 1.597667638483965) internal successors, (1096), 686 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call 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:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:57,270 INFO L93 Difference]: Finished difference Result 693 states and 1101 transitions. [2022-02-20 18:57:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1101 transitions. [2022-02-20 18:57:57,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:57,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:57,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 687 states, 686 states have (on average 1.597667638483965) internal successors, (1096), 686 states have internal predecessors, (1096), 0 states have call successors, (0), 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 693 states. [2022-02-20 18:57:57,275 INFO L87 Difference]: Start difference. First operand has 687 states, 686 states have (on average 1.597667638483965) internal successors, (1096), 686 states have internal predecessors, (1096), 0 states have call successors, (0), 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 693 states. [2022-02-20 18:57:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:57,301 INFO L93 Difference]: Finished difference Result 693 states and 1101 transitions. [2022-02-20 18:57:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1101 transitions. [2022-02-20 18:57:57,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:57,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:57,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:57,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 1.597667638483965) internal successors, (1096), 686 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call 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:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1096 transitions. [2022-02-20 18:57:57,334 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1096 transitions. Word has length 66 [2022-02-20 18:57:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:57,335 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 1096 transitions. [2022-02-20 18:57:57,335 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:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1096 transitions. [2022-02-20 18:57:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:57:57,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:57,336 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:57,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:57:57,337 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash -190660810, now seen corresponding path program 1 times [2022-02-20 18:57:57,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:57,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68541686] [2022-02-20 18:57:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:57,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {7295#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_1296~0 := 0;~__return_1445~0 := 0; {7295#true} is VALID [2022-02-20 18:57:57,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {7295#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {7295#true} is VALID [2022-02-20 18:57:57,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {7295#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {7295#true} is VALID [2022-02-20 18:57:57,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {7295#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {7295#true} is VALID [2022-02-20 18:57:57,494 INFO L290 TraceCheckUtils]: 4: Hoare triple {7295#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {7295#true} is VALID [2022-02-20 18:57:57,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {7295#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {7295#true} is VALID [2022-02-20 18:57:57,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {7295#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {7295#true} is VALID [2022-02-20 18:57:57,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {7295#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {7295#true} is VALID [2022-02-20 18:57:57,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {7295#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {7295#true} is VALID [2022-02-20 18:57:57,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {7295#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {7295#true} is VALID [2022-02-20 18:57:57,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {7295#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {7295#true} is VALID [2022-02-20 18:57:57,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {7295#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {7295#true} is VALID [2022-02-20 18:57:57,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {7295#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {7295#true} is VALID [2022-02-20 18:57:57,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {7295#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {7295#true} is VALID [2022-02-20 18:57:57,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {7295#true} assume ~id1~0 != ~id2~0; {7295#true} is VALID [2022-02-20 18:57:57,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {7295#true} assume ~id1~0 != ~id3~0; {7295#true} is VALID [2022-02-20 18:57:57,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {7295#true} assume ~id2~0 != ~id3~0; {7295#true} is VALID [2022-02-20 18:57:57,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {7295#true} assume ~id1~0 >= 0; {7295#true} is VALID [2022-02-20 18:57:57,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {7295#true} assume ~id2~0 >= 0; {7295#true} is VALID [2022-02-20 18:57:57,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {7295#true} assume ~id3~0 >= 0; {7295#true} is VALID [2022-02-20 18:57:57,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {7295#true} assume 0 == ~r1~0 % 256; {7295#true} is VALID [2022-02-20 18:57:57,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {7295#true} assume 0 == ~r2~0 % 256; {7295#true} is VALID [2022-02-20 18:57:57,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {7295#true} assume 0 == ~r3~0 % 256; {7295#true} is VALID [2022-02-20 18:57:57,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {7295#true} assume !(0 == main_~init__r122~0#1 % 256); {7295#true} is VALID [2022-02-20 18:57:57,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {7295#true} assume !(0 == main_~init__r132~0#1 % 256); {7295#true} is VALID [2022-02-20 18:57:57,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {7295#true} assume !(0 == main_~init__r212~0#1 % 256); {7295#true} is VALID [2022-02-20 18:57:57,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {7295#true} assume !(0 == main_~init__r232~0#1 % 256); {7295#true} is VALID [2022-02-20 18:57:57,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {7295#true} assume !(0 == main_~init__r312~0#1 % 256); {7295#true} is VALID [2022-02-20 18:57:57,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {7295#true} assume !(0 == main_~init__r322~0#1 % 256); {7295#true} is VALID [2022-02-20 18:57:57,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {7295#true} assume ~max1~0 == ~id1~0; {7295#true} is VALID [2022-02-20 18:57:57,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {7295#true} assume ~max2~0 == ~id2~0; {7295#true} is VALID [2022-02-20 18:57:57,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {7295#true} assume ~max3~0 == ~id3~0; {7295#true} is VALID [2022-02-20 18:57:57,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {7295#true} assume 0 == ~st1~0; {7297#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:57,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {7297#(<= ~st1~0 0)} assume 0 == ~st2~0; {7298#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {7298#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,504 INFO L290 TraceCheckUtils]: 43: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1296~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1296~0; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {7299#(<= (+ ~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; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,506 INFO L290 TraceCheckUtils]: 50: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,509 INFO L290 TraceCheckUtils]: 58: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,510 INFO L290 TraceCheckUtils]: 59: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,510 INFO L290 TraceCheckUtils]: 60: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,510 INFO L290 TraceCheckUtils]: 61: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {7299#(<= (+ ~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; {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:57,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {7299#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {7296#false} is VALID [2022-02-20 18:57:57,512 INFO L290 TraceCheckUtils]: 65: Hoare triple {7296#false} ~__return_1445~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1445~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; {7296#false} is VALID [2022-02-20 18:57:57,512 INFO L290 TraceCheckUtils]: 66: Hoare triple {7296#false} assume 0 == main_~assert__arg~0#1 % 256; {7296#false} is VALID [2022-02-20 18:57:57,512 INFO L290 TraceCheckUtils]: 67: Hoare triple {7296#false} assume !false; {7296#false} is VALID [2022-02-20 18:57:57,513 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:57,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:57,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68541686] [2022-02-20 18:57:57,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68541686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:57,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:57,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:57:57,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046324337] [2022-02-20 18:57:57,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:57,514 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:57,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:57,515 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:57,561 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:57,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:57:57,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:57,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:57:57,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:57:57,562 INFO L87 Difference]: Start difference. First operand 687 states and 1096 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:58:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:00,689 INFO L93 Difference]: Finished difference Result 2979 states and 4854 transitions. [2022-02-20 18:58:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:58:00,689 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:58:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:00,690 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:58:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1181 transitions. [2022-02-20 18:58:00,696 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:58:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1181 transitions. [2022-02-20 18:58:00,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1181 transitions. [2022-02-20 18:58:01,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1181 edges. 1181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:01,762 INFO L225 Difference]: With dead ends: 2979 [2022-02-20 18:58:01,762 INFO L226 Difference]: Without dead ends: 2349 [2022-02-20 18:58:01,763 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:58:01,763 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 1026 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:01,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1026 Valid, 1596 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:58:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-02-20 18:58:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1239. [2022-02-20 18:58:02,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:02,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2349 states. Second operand has 1239 states, 1238 states have (on average 1.6082390953150243) internal successors, (1991), 1238 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call 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,583 INFO L74 IsIncluded]: Start isIncluded. First operand 2349 states. Second operand has 1239 states, 1238 states have (on average 1.6082390953150243) internal successors, (1991), 1238 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call 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,586 INFO L87 Difference]: Start difference. First operand 2349 states. Second operand has 1239 states, 1238 states have (on average 1.6082390953150243) internal successors, (1991), 1238 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call 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,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:02,811 INFO L93 Difference]: Finished difference Result 2349 states and 3807 transitions. [2022-02-20 18:58:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3807 transitions. [2022-02-20 18:58:02,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:02,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:02,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 1239 states, 1238 states have (on average 1.6082390953150243) internal successors, (1991), 1238 states have internal predecessors, (1991), 0 states have call successors, (0), 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 2349 states. [2022-02-20 18:58:02,821 INFO L87 Difference]: Start difference. First operand has 1239 states, 1238 states have (on average 1.6082390953150243) internal successors, (1991), 1238 states have internal predecessors, (1991), 0 states have call successors, (0), 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 2349 states. [2022-02-20 18:58:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:03,063 INFO L93 Difference]: Finished difference Result 2349 states and 3807 transitions. [2022-02-20 18:58:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3807 transitions. [2022-02-20 18:58:03,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:03,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:03,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:03,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.6082390953150243) internal successors, (1991), 1238 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1991 transitions. [2022-02-20 18:58:03,165 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1991 transitions. Word has length 68 [2022-02-20 18:58:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:03,166 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 1991 transitions. [2022-02-20 18:58:03,166 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:58:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1991 transitions. [2022-02-20 18:58:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:58:03,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:03,168 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:58:03,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:58:03,169 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:03,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1678021987, now seen corresponding path program 1 times [2022-02-20 18:58:03,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:03,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605978861] [2022-02-20 18:58:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:03,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {17894#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_1296~0 := 0;~__return_1445~0 := 0; {17894#true} is VALID [2022-02-20 18:58:03,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {17894#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {17894#true} is VALID [2022-02-20 18:58:03,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {17894#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {17894#true} is VALID [2022-02-20 18:58:03,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {17894#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {17894#true} is VALID [2022-02-20 18:58:03,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {17894#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {17894#true} is VALID [2022-02-20 18:58:03,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {17894#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {17894#true} is VALID [2022-02-20 18:58:03,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {17894#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {17894#true} is VALID [2022-02-20 18:58:03,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {17894#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {17894#true} is VALID [2022-02-20 18:58:03,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {17894#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {17894#true} is VALID [2022-02-20 18:58:03,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {17894#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {17894#true} is VALID [2022-02-20 18:58:03,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {17894#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {17894#true} is VALID [2022-02-20 18:58:03,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {17894#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {17894#true} is VALID [2022-02-20 18:58:03,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {17894#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {17894#true} is VALID [2022-02-20 18:58:03,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {17894#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {17894#true} is VALID [2022-02-20 18:58:03,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {17894#true} assume ~id1~0 != ~id2~0; {17894#true} is VALID [2022-02-20 18:58:03,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {17894#true} assume ~id1~0 != ~id3~0; {17894#true} is VALID [2022-02-20 18:58:03,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {17894#true} assume ~id2~0 != ~id3~0; {17894#true} is VALID [2022-02-20 18:58:03,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {17894#true} assume ~id1~0 >= 0; {17894#true} is VALID [2022-02-20 18:58:03,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {17894#true} assume ~id2~0 >= 0; {17894#true} is VALID [2022-02-20 18:58:03,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {17894#true} assume ~id3~0 >= 0; {17894#true} is VALID [2022-02-20 18:58:03,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {17894#true} assume 0 == ~r1~0 % 256; {17894#true} is VALID [2022-02-20 18:58:03,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {17894#true} assume 0 == ~r2~0 % 256; {17894#true} is VALID [2022-02-20 18:58:03,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {17894#true} assume 0 == ~r3~0 % 256; {17894#true} is VALID [2022-02-20 18:58:03,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {17894#true} assume !(0 == main_~init__r122~0#1 % 256); {17894#true} is VALID [2022-02-20 18:58:03,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {17894#true} assume !(0 == main_~init__r132~0#1 % 256); {17894#true} is VALID [2022-02-20 18:58:03,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {17894#true} assume !(0 == main_~init__r212~0#1 % 256); {17894#true} is VALID [2022-02-20 18:58:03,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {17894#true} assume !(0 == main_~init__r232~0#1 % 256); {17894#true} is VALID [2022-02-20 18:58:03,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {17894#true} assume !(0 == main_~init__r312~0#1 % 256); {17894#true} is VALID [2022-02-20 18:58:03,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {17894#true} assume !(0 == main_~init__r322~0#1 % 256); {17894#true} is VALID [2022-02-20 18:58:03,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {17894#true} assume ~max1~0 == ~id1~0; {17894#true} is VALID [2022-02-20 18:58:03,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {17894#true} assume ~max2~0 == ~id2~0; {17894#true} is VALID [2022-02-20 18:58:03,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {17894#true} assume ~max3~0 == ~id3~0; {17894#true} is VALID [2022-02-20 18:58:03,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {17894#true} assume 0 == ~st1~0; {17896#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:03,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {17896#(<= ~st1~0 0)} assume 0 == ~st2~0; {17896#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:03,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {17896#(<= ~st1~0 0)} assume 0 == ~st3~0; {17896#(<= ~st1~0 0)} is VALID [2022-02-20 18:58:03,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {17896#(<= ~st1~0 0)} assume 0 == ~nl1~0; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,290 INFO L290 TraceCheckUtils]: 43: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1296~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1296~0; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {17897#(<= (+ ~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; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,292 INFO L290 TraceCheckUtils]: 46: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,292 INFO L290 TraceCheckUtils]: 47: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,292 INFO L290 TraceCheckUtils]: 48: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,293 INFO L290 TraceCheckUtils]: 51: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,294 INFO L290 TraceCheckUtils]: 52: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,294 INFO L290 TraceCheckUtils]: 53: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,295 INFO L290 TraceCheckUtils]: 56: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,296 INFO L290 TraceCheckUtils]: 58: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,296 INFO L290 TraceCheckUtils]: 59: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,296 INFO L290 TraceCheckUtils]: 60: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,297 INFO L290 TraceCheckUtils]: 61: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,297 INFO L290 TraceCheckUtils]: 62: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,298 INFO L290 TraceCheckUtils]: 63: Hoare triple {17897#(<= (+ ~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; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,298 INFO L290 TraceCheckUtils]: 64: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17897#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:58:03,298 INFO L290 TraceCheckUtils]: 65: Hoare triple {17897#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {17895#false} is VALID [2022-02-20 18:58:03,299 INFO L290 TraceCheckUtils]: 66: Hoare triple {17895#false} ~__return_1445~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1445~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; {17895#false} is VALID [2022-02-20 18:58:03,299 INFO L290 TraceCheckUtils]: 67: Hoare triple {17895#false} assume 0 == main_~assert__arg~0#1 % 256; {17895#false} is VALID [2022-02-20 18:58:03,299 INFO L290 TraceCheckUtils]: 68: Hoare triple {17895#false} assume !false; {17895#false} is VALID [2022-02-20 18:58:03,300 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:03,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:03,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605978861] [2022-02-20 18:58:03,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605978861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:03,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:03,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:03,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764296149] [2022-02-20 18:58:03,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:03,302 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:58:03,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:03,302 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:58:03,349 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:58:03,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:03,349 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:03,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:03,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:03,350 INFO L87 Difference]: Start difference. First operand 1239 states and 1991 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:58:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:06,267 INFO L93 Difference]: Finished difference Result 3619 states and 5887 transitions. [2022-02-20 18:58:06,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:06,267 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:58:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:06,268 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:58:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:58:06,271 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:58:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:58:06,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 707 transitions. [2022-02-20 18:58:06,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 707 edges. 707 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:06,943 INFO L225 Difference]: With dead ends: 3619 [2022-02-20 18:58:06,943 INFO L226 Difference]: Without dead ends: 2437 [2022-02-20 18:58:06,945 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:06,945 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 456 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 787 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:06,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 787 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:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-02-20 18:58:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1829. [2022-02-20 18:58:08,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:08,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2437 states. Second operand has 1829 states, 1828 states have (on average 1.6148796498905909) internal successors, (2952), 1828 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,317 INFO L74 IsIncluded]: Start isIncluded. First operand 2437 states. Second operand has 1829 states, 1828 states have (on average 1.6148796498905909) internal successors, (2952), 1828 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,320 INFO L87 Difference]: Start difference. First operand 2437 states. Second operand has 1829 states, 1828 states have (on average 1.6148796498905909) internal successors, (2952), 1828 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:08,491 INFO L93 Difference]: Finished difference Result 2437 states and 3957 transitions. [2022-02-20 18:58:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3957 transitions. [2022-02-20 18:58:08,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:08,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:08,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 1829 states, 1828 states have (on average 1.6148796498905909) internal successors, (2952), 1828 states have internal predecessors, (2952), 0 states have call successors, (0), 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 2437 states. [2022-02-20 18:58:08,503 INFO L87 Difference]: Start difference. First operand has 1829 states, 1828 states have (on average 1.6148796498905909) internal successors, (2952), 1828 states have internal predecessors, (2952), 0 states have call successors, (0), 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 2437 states. [2022-02-20 18:58:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:08,715 INFO L93 Difference]: Finished difference Result 2437 states and 3957 transitions. [2022-02-20 18:58:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3957 transitions. [2022-02-20 18:58:08,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:08,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:08,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:08,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.6148796498905909) internal successors, (2952), 1828 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2952 transitions. [2022-02-20 18:58:08,885 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2952 transitions. Word has length 69 [2022-02-20 18:58:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:08,885 INFO L470 AbstractCegarLoop]: Abstraction has 1829 states and 2952 transitions. [2022-02-20 18:58:08,886 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:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2952 transitions. [2022-02-20 18:58:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:58:08,887 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:08,887 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:08,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:58:08,887 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash -537020195, now seen corresponding path program 1 times [2022-02-20 18:58:08,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:08,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935681586] [2022-02-20 18:58:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:08,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:08,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {30394#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_1296~0 := 0;~__return_1445~0 := 0; {30394#true} is VALID [2022-02-20 18:58:08,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {30394#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {30394#true} is VALID [2022-02-20 18:58:08,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {30394#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {30394#true} is VALID [2022-02-20 18:58:08,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {30394#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {30394#true} is VALID [2022-02-20 18:58:08,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {30394#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {30394#true} is VALID [2022-02-20 18:58:08,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {30394#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {30394#true} is VALID [2022-02-20 18:58:08,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {30394#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {30394#true} is VALID [2022-02-20 18:58:08,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {30394#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {30394#true} is VALID [2022-02-20 18:58:08,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {30394#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {30394#true} is VALID [2022-02-20 18:58:08,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {30394#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {30394#true} is VALID [2022-02-20 18:58:08,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {30394#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {30394#true} is VALID [2022-02-20 18:58:08,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {30394#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {30394#true} is VALID [2022-02-20 18:58:08,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {30394#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {30394#true} is VALID [2022-02-20 18:58:08,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {30394#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {30394#true} is VALID [2022-02-20 18:58:08,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {30394#true} assume ~id1~0 != ~id2~0; {30394#true} is VALID [2022-02-20 18:58:08,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {30394#true} assume ~id1~0 != ~id3~0; {30394#true} is VALID [2022-02-20 18:58:08,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {30394#true} assume ~id2~0 != ~id3~0; {30394#true} is VALID [2022-02-20 18:58:08,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {30394#true} assume ~id1~0 >= 0; {30394#true} is VALID [2022-02-20 18:58:08,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {30394#true} assume ~id2~0 >= 0; {30394#true} is VALID [2022-02-20 18:58:08,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {30394#true} assume ~id3~0 >= 0; {30394#true} is VALID [2022-02-20 18:58:08,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {30394#true} assume 0 == ~r1~0 % 256; {30394#true} is VALID [2022-02-20 18:58:08,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {30394#true} assume 0 == ~r2~0 % 256; {30394#true} is VALID [2022-02-20 18:58:08,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {30394#true} assume 0 == ~r3~0 % 256; {30394#true} is VALID [2022-02-20 18:58:08,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {30394#true} assume !(0 == main_~init__r122~0#1 % 256); {30394#true} is VALID [2022-02-20 18:58:08,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {30394#true} assume !(0 == main_~init__r132~0#1 % 256); {30394#true} is VALID [2022-02-20 18:58:08,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {30394#true} assume !(0 == main_~init__r212~0#1 % 256); {30394#true} is VALID [2022-02-20 18:58:08,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {30394#true} assume !(0 == main_~init__r232~0#1 % 256); {30394#true} is VALID [2022-02-20 18:58:08,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {30394#true} assume !(0 == main_~init__r312~0#1 % 256); {30394#true} is VALID [2022-02-20 18:58:08,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {30394#true} assume !(0 == main_~init__r322~0#1 % 256); {30394#true} is VALID [2022-02-20 18:58:08,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {30394#true} assume ~max1~0 == ~id1~0; {30394#true} is VALID [2022-02-20 18:58:08,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {30394#true} assume ~max2~0 == ~id2~0; {30394#true} is VALID [2022-02-20 18:58:08,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {30394#true} assume ~max3~0 == ~id3~0; {30394#true} is VALID [2022-02-20 18:58:08,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {30394#true} assume 0 == ~st1~0; {30394#true} is VALID [2022-02-20 18:58:08,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {30394#true} assume 0 == ~st2~0; {30396#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:08,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {30396#(<= ~st2~0 0)} assume 0 == ~st3~0; {30396#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:08,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {30396#(<= ~st2~0 0)} assume 0 == ~nl1~0; {30396#(<= ~st2~0 0)} is VALID [2022-02-20 18:58:08,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {30396#(<= ~st2~0 0)} assume 0 == ~nl2~0; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax1~0 % 256); {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax2~0 % 256); {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1296~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1296~0; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {30397#(<= (+ ~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; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,978 INFO L290 TraceCheckUtils]: 45: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,983 INFO L290 TraceCheckUtils]: 54: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,984 INFO L290 TraceCheckUtils]: 56: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,984 INFO L290 TraceCheckUtils]: 57: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,985 INFO L290 TraceCheckUtils]: 59: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,985 INFO L290 TraceCheckUtils]: 60: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,986 INFO L290 TraceCheckUtils]: 61: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,986 INFO L290 TraceCheckUtils]: 63: Hoare triple {30397#(<= (+ ~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; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,987 INFO L290 TraceCheckUtils]: 64: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,987 INFO L290 TraceCheckUtils]: 65: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {30397#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:58:08,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {30397#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {30395#false} is VALID [2022-02-20 18:58:08,988 INFO L290 TraceCheckUtils]: 67: Hoare triple {30395#false} ~__return_1445~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1445~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; {30395#false} is VALID [2022-02-20 18:58:08,988 INFO L290 TraceCheckUtils]: 68: Hoare triple {30395#false} assume 0 == main_~assert__arg~0#1 % 256; {30395#false} is VALID [2022-02-20 18:58:08,988 INFO L290 TraceCheckUtils]: 69: Hoare triple {30395#false} assume !false; {30395#false} is VALID [2022-02-20 18:58:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:08,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:08,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935681586] [2022-02-20 18:58:08,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935681586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:08,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:08,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:08,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673808576] [2022-02-20 18:58:08,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:08,990 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:08,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:08,991 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:09,041 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:09,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:09,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:09,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:09,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:09,042 INFO L87 Difference]: Start difference. First operand 1829 states and 2952 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:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:13,891 INFO L93 Difference]: Finished difference Result 5313 states and 8631 transitions. [2022-02-20 18:58:13,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:13,891 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:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:13,891 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:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:58:13,893 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:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:58:13,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 707 transitions. [2022-02-20 18:58:14,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 707 edges. 707 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:14,842 INFO L225 Difference]: With dead ends: 5313 [2022-02-20 18:58:14,842 INFO L226 Difference]: Without dead ends: 3541 [2022-02-20 18:58:14,845 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:14,846 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 456 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:14,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 729 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2022-02-20 18:58:17,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 2673. [2022-02-20 18:58:17,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:17,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3541 states. Second operand has 2673 states, 2672 states have (on average 1.6137724550898203) internal successors, (4312), 2672 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:17,581 INFO L74 IsIncluded]: Start isIncluded. First operand 3541 states. Second operand has 2673 states, 2672 states have (on average 1.6137724550898203) internal successors, (4312), 2672 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:17,583 INFO L87 Difference]: Start difference. First operand 3541 states. Second operand has 2673 states, 2672 states have (on average 1.6137724550898203) internal successors, (4312), 2672 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:17,950 INFO L93 Difference]: Finished difference Result 3541 states and 5734 transitions. [2022-02-20 18:58:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 5734 transitions. [2022-02-20 18:58:17,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:17,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:17,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 2673 states, 2672 states have (on average 1.6137724550898203) internal successors, (4312), 2672 states have internal predecessors, (4312), 0 states have call successors, (0), 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 3541 states. [2022-02-20 18:58:17,962 INFO L87 Difference]: Start difference. First operand has 2673 states, 2672 states have (on average 1.6137724550898203) internal successors, (4312), 2672 states have internal predecessors, (4312), 0 states have call successors, (0), 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 3541 states. [2022-02-20 18:58:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:18,430 INFO L93 Difference]: Finished difference Result 3541 states and 5734 transitions. [2022-02-20 18:58:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 5734 transitions. [2022-02-20 18:58:18,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:18,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:18,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:18,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.6137724550898203) internal successors, (4312), 2672 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4312 transitions. [2022-02-20 18:58:18,797 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4312 transitions. Word has length 70 [2022-02-20 18:58:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:18,797 INFO L470 AbstractCegarLoop]: Abstraction has 2673 states and 4312 transitions. [2022-02-20 18:58:18,798 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:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4312 transitions. [2022-02-20 18:58:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 18:58:18,799 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:18,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:18,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:58:18,799 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:18,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash 478855012, now seen corresponding path program 1 times [2022-02-20 18:58:18,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:18,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478533972] [2022-02-20 18:58:18,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:18,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:18,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {48687#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_1296~0 := 0;~__return_1445~0 := 0; {48687#true} is VALID [2022-02-20 18:58:18,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {48687#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {48687#true} is VALID [2022-02-20 18:58:18,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {48687#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {48687#true} is VALID [2022-02-20 18:58:18,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {48687#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {48687#true} is VALID [2022-02-20 18:58:18,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {48687#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {48687#true} is VALID [2022-02-20 18:58:18,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {48687#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {48687#true} is VALID [2022-02-20 18:58:18,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {48687#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {48687#true} is VALID [2022-02-20 18:58:18,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {48687#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {48687#true} is VALID [2022-02-20 18:58:18,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {48687#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {48687#true} is VALID [2022-02-20 18:58:18,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {48687#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {48687#true} is VALID [2022-02-20 18:58:18,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {48687#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {48687#true} is VALID [2022-02-20 18:58:18,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {48687#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {48687#true} is VALID [2022-02-20 18:58:18,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {48687#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {48687#true} is VALID [2022-02-20 18:58:18,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {48687#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {48687#true} is VALID [2022-02-20 18:58:18,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {48687#true} assume ~id1~0 != ~id2~0; {48687#true} is VALID [2022-02-20 18:58:18,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {48687#true} assume ~id1~0 != ~id3~0; {48687#true} is VALID [2022-02-20 18:58:18,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {48687#true} assume ~id2~0 != ~id3~0; {48687#true} is VALID [2022-02-20 18:58:18,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {48687#true} assume ~id1~0 >= 0; {48687#true} is VALID [2022-02-20 18:58:18,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {48687#true} assume ~id2~0 >= 0; {48687#true} is VALID [2022-02-20 18:58:18,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {48687#true} assume ~id3~0 >= 0; {48687#true} is VALID [2022-02-20 18:58:18,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {48687#true} assume 0 == ~r1~0 % 256; {48687#true} is VALID [2022-02-20 18:58:18,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {48687#true} assume 0 == ~r2~0 % 256; {48687#true} is VALID [2022-02-20 18:58:18,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {48687#true} assume 0 == ~r3~0 % 256; {48687#true} is VALID [2022-02-20 18:58:18,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {48687#true} assume !(0 == main_~init__r122~0#1 % 256); {48687#true} is VALID [2022-02-20 18:58:18,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {48687#true} assume !(0 == main_~init__r132~0#1 % 256); {48687#true} is VALID [2022-02-20 18:58:18,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {48687#true} assume !(0 == main_~init__r212~0#1 % 256); {48687#true} is VALID [2022-02-20 18:58:18,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {48687#true} assume !(0 == main_~init__r232~0#1 % 256); {48687#true} is VALID [2022-02-20 18:58:18,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {48687#true} assume !(0 == main_~init__r312~0#1 % 256); {48687#true} is VALID [2022-02-20 18:58:18,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {48687#true} assume !(0 == main_~init__r322~0#1 % 256); {48687#true} is VALID [2022-02-20 18:58:18,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {48687#true} assume ~max1~0 == ~id1~0; {48687#true} is VALID [2022-02-20 18:58:18,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {48687#true} assume ~max2~0 == ~id2~0; {48687#true} is VALID [2022-02-20 18:58:18,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {48687#true} assume ~max3~0 == ~id3~0; {48687#true} is VALID [2022-02-20 18:58:18,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {48687#true} assume 0 == ~st1~0; {48687#true} is VALID [2022-02-20 18:58:18,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {48687#true} assume 0 == ~st2~0; {48687#true} is VALID [2022-02-20 18:58:18,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {48687#true} assume 0 == ~st3~0; {48689#(<= ~st3~0 0)} is VALID [2022-02-20 18:58:18,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {48689#(<= ~st3~0 0)} assume 0 == ~nl1~0; {48689#(<= ~st3~0 0)} is VALID [2022-02-20 18:58:18,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {48689#(<= ~st3~0 0)} assume 0 == ~nl2~0; {48689#(<= ~st3~0 0)} is VALID [2022-02-20 18:58:18,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {48689#(<= ~st3~0 0)} assume 0 == ~nl3~0; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax1~0 % 256); {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax2~0 % 256); {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1296~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1296~0; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~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; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode1~0 % 256); {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,877 INFO L290 TraceCheckUtils]: 47: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,877 INFO L290 TraceCheckUtils]: 48: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep12~0 % 256); {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep13~0 % 256); {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,879 INFO L290 TraceCheckUtils]: 51: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode2~0 % 256); {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep21~0 % 256); {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep23~0 % 256); {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,881 INFO L290 TraceCheckUtils]: 56: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,881 INFO L290 TraceCheckUtils]: 57: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,881 INFO L290 TraceCheckUtils]: 58: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode3~0 % 256); {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep31~0 % 256); {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep32~0 % 256); {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,883 INFO L290 TraceCheckUtils]: 62: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,883 INFO L290 TraceCheckUtils]: 63: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~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; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,884 INFO L290 TraceCheckUtils]: 64: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,884 INFO L290 TraceCheckUtils]: 65: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,884 INFO L290 TraceCheckUtils]: 66: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {48690#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:58:18,885 INFO L290 TraceCheckUtils]: 67: Hoare triple {48690#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);main_~check__tmp~0#1 := 0; {48688#false} is VALID [2022-02-20 18:58:18,885 INFO L290 TraceCheckUtils]: 68: Hoare triple {48688#false} ~__return_1445~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1445~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; {48688#false} is VALID [2022-02-20 18:58:18,885 INFO L290 TraceCheckUtils]: 69: Hoare triple {48688#false} assume 0 == main_~assert__arg~0#1 % 256; {48688#false} is VALID [2022-02-20 18:58:18,885 INFO L290 TraceCheckUtils]: 70: Hoare triple {48688#false} assume !false; {48688#false} is VALID [2022-02-20 18:58:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:58:18,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:18,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478533972] [2022-02-20 18:58:18,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478533972] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:18,887 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:18,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:58:18,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994694422] [2022-02-20 18:58:18,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:18,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:58:18,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:18,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:18,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:18,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:58:18,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:58:18,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:58:18,935 INFO L87 Difference]: Start difference. First operand 2673 states and 4312 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:27,415 INFO L93 Difference]: Finished difference Result 7713 states and 12507 transitions. [2022-02-20 18:58:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:58:27,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-20 18:58:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:58:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 707 transitions. [2022-02-20 18:58:27,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 707 transitions. [2022-02-20 18:58:27,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 707 edges. 707 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:29,042 INFO L225 Difference]: With dead ends: 7713 [2022-02-20 18:58:29,042 INFO L226 Difference]: Without dead ends: 5097 [2022-02-20 18:58:29,045 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:29,046 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 454 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:58:29,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 772 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2022-02-20 18:58:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 3869. [2022-02-20 18:58:33,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:58:33,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5097 states. Second operand has 3869 states, 3868 states have (on average 1.6116856256463288) internal successors, (6234), 3868 states have internal predecessors, (6234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:33,735 INFO L74 IsIncluded]: Start isIncluded. First operand 5097 states. Second operand has 3869 states, 3868 states have (on average 1.6116856256463288) internal successors, (6234), 3868 states have internal predecessors, (6234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:33,737 INFO L87 Difference]: Start difference. First operand 5097 states. Second operand has 3869 states, 3868 states have (on average 1.6116856256463288) internal successors, (6234), 3868 states have internal predecessors, (6234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:34,426 INFO L93 Difference]: Finished difference Result 5097 states and 8242 transitions. [2022-02-20 18:58:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 5097 states and 8242 transitions. [2022-02-20 18:58:34,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:34,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:34,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 3869 states, 3868 states have (on average 1.6116856256463288) internal successors, (6234), 3868 states have internal predecessors, (6234), 0 states have call successors, (0), 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 5097 states. [2022-02-20 18:58:34,438 INFO L87 Difference]: Start difference. First operand has 3869 states, 3868 states have (on average 1.6116856256463288) internal successors, (6234), 3868 states have internal predecessors, (6234), 0 states have call successors, (0), 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 5097 states. [2022-02-20 18:58:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:35,159 INFO L93 Difference]: Finished difference Result 5097 states and 8242 transitions. [2022-02-20 18:58:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 5097 states and 8242 transitions. [2022-02-20 18:58:35,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:35,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:35,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:35,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3869 states, 3868 states have (on average 1.6116856256463288) internal successors, (6234), 3868 states have internal predecessors, (6234), 0 states have call successors, (0), 0 states have call 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:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 6234 transitions. [2022-02-20 18:58:35,810 INFO L78 Accepts]: Start accepts. Automaton has 3869 states and 6234 transitions. Word has length 71 [2022-02-20 18:58:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:35,811 INFO L470 AbstractCegarLoop]: Abstraction has 3869 states and 6234 transitions. [2022-02-20 18:58:35,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call 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:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3869 states and 6234 transitions. [2022-02-20 18:58:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:58:35,812 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:35,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:58:35,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:58:35,812 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1637619353, now seen corresponding path program 1 times [2022-02-20 18:58:35,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:35,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402629021] [2022-02-20 18:58:35,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:35,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {75179#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_1296~0 := 0;~__return_1445~0 := 0; {75179#true} is VALID [2022-02-20 18:58:35,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {75179#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {75179#true} is VALID [2022-02-20 18:58:35,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {75179#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {75179#true} is VALID [2022-02-20 18:58:35,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {75179#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {75179#true} is VALID [2022-02-20 18:58:35,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {75179#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {75179#true} is VALID [2022-02-20 18:58:35,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {75179#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {75179#true} is VALID [2022-02-20 18:58:35,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {75179#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {75179#true} is VALID [2022-02-20 18:58:35,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {75179#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {75179#true} is VALID [2022-02-20 18:58:35,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {75179#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {75179#true} is VALID [2022-02-20 18:58:35,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {75179#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {75179#true} is VALID [2022-02-20 18:58:35,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {75179#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {75179#true} is VALID [2022-02-20 18:58:35,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {75179#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {75179#true} is VALID [2022-02-20 18:58:35,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {75179#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {75179#true} is VALID [2022-02-20 18:58:35,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {75179#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {75179#true} is VALID [2022-02-20 18:58:35,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {75179#true} assume ~id1~0 != ~id2~0; {75179#true} is VALID [2022-02-20 18:58:35,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {75179#true} assume ~id1~0 != ~id3~0; {75179#true} is VALID [2022-02-20 18:58:35,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {75179#true} assume ~id2~0 != ~id3~0; {75179#true} is VALID [2022-02-20 18:58:35,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {75179#true} assume ~id1~0 >= 0; {75179#true} is VALID [2022-02-20 18:58:35,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {75179#true} assume ~id2~0 >= 0; {75179#true} is VALID [2022-02-20 18:58:35,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {75179#true} assume ~id3~0 >= 0; {75179#true} is VALID [2022-02-20 18:58:35,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {75179#true} assume 0 == ~r1~0 % 256; {75179#true} is VALID [2022-02-20 18:58:35,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {75179#true} assume 0 == ~r2~0 % 256; {75179#true} is VALID [2022-02-20 18:58:35,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {75179#true} assume 0 == ~r3~0 % 256; {75179#true} is VALID [2022-02-20 18:58:35,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {75179#true} assume !(0 == main_~init__r122~0#1 % 256); {75179#true} is VALID [2022-02-20 18:58:35,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {75179#true} assume !(0 == main_~init__r132~0#1 % 256); {75179#true} is VALID [2022-02-20 18:58:35,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {75179#true} assume !(0 == main_~init__r212~0#1 % 256); {75179#true} is VALID [2022-02-20 18:58:35,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {75179#true} assume !(0 == main_~init__r232~0#1 % 256); {75179#true} is VALID [2022-02-20 18:58:35,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {75179#true} assume !(0 == main_~init__r312~0#1 % 256); {75179#true} is VALID [2022-02-20 18:58:35,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {75179#true} assume !(0 == main_~init__r322~0#1 % 256); {75179#true} is VALID [2022-02-20 18:58:35,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {75179#true} assume ~max1~0 == ~id1~0; {75179#true} is VALID [2022-02-20 18:58:35,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {75179#true} assume ~max2~0 == ~id2~0; {75179#true} is VALID [2022-02-20 18:58:35,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {75179#true} assume ~max3~0 == ~id3~0; {75179#true} is VALID [2022-02-20 18:58:35,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {75179#true} assume 0 == ~st1~0; {75179#true} is VALID [2022-02-20 18:58:35,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {75179#true} assume 0 == ~st2~0; {75179#true} is VALID [2022-02-20 18:58:35,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {75179#true} assume 0 == ~st3~0; {75179#true} is VALID [2022-02-20 18:58:35,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {75179#true} assume 0 == ~nl1~0; {75179#true} is VALID [2022-02-20 18:58:35,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {75179#true} assume 0 == ~nl2~0; {75179#true} is VALID [2022-02-20 18:58:35,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {75179#true} assume 0 == ~nl3~0; {75179#true} is VALID [2022-02-20 18:58:35,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {75179#true} assume 0 == ~mode1~0 % 256; {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:35,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:35,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:35,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax1~0 % 256); {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:35,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax2~0 % 256); {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:35,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1296~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1296~0; {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:35,868 INFO L290 TraceCheckUtils]: 44: Hoare triple {75181#(= (+ (* (- 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; {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:35,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:35,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {75181#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {75180#false} is VALID [2022-02-20 18:58:35,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {75180#false} assume !(255 == ~r1~0 % 256); {75180#false} is VALID [2022-02-20 18:58:35,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {75180#false} ~r1~0 := 1 + ~r1~0 % 256; {75180#false} is VALID [2022-02-20 18:58:35,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {75180#false} assume !!(0 == ~ep21~0 % 256); {75180#false} is VALID [2022-02-20 18:58:35,870 INFO L290 TraceCheckUtils]: 50: Hoare triple {75180#false} assume !!(0 == ~ep31~0 % 256); {75180#false} is VALID [2022-02-20 18:58:35,870 INFO L290 TraceCheckUtils]: 51: Hoare triple {75180#false} ~newmax1~0 := main_~node1__newmax~0#1; {75180#false} is VALID [2022-02-20 18:58:35,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {75180#false} assume 1 == ~r1~0 % 256; {75180#false} is VALID [2022-02-20 18:58:35,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {75180#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {75180#false} is VALID [2022-02-20 18:58:35,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {75180#false} ~mode1~0 := 0; {75180#false} is VALID [2022-02-20 18:58:35,870 INFO L290 TraceCheckUtils]: 55: Hoare triple {75180#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {75180#false} is VALID [2022-02-20 18:58:35,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {75180#false} assume !!(0 == ~mode2~0 % 256); {75180#false} is VALID [2022-02-20 18:58:35,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {75180#false} assume ~r2~0 % 256 < 2; {75180#false} is VALID [2022-02-20 18:58:35,871 INFO L290 TraceCheckUtils]: 58: Hoare triple {75180#false} assume !!(0 == ~ep21~0 % 256); {75180#false} is VALID [2022-02-20 18:58:35,871 INFO L290 TraceCheckUtils]: 59: Hoare triple {75180#false} assume !!(0 == ~ep23~0 % 256); {75180#false} is VALID [2022-02-20 18:58:35,871 INFO L290 TraceCheckUtils]: 60: Hoare triple {75180#false} ~mode2~0 := 1; {75180#false} is VALID [2022-02-20 18:58:35,871 INFO L290 TraceCheckUtils]: 61: Hoare triple {75180#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {75180#false} is VALID [2022-02-20 18:58:35,871 INFO L290 TraceCheckUtils]: 62: Hoare triple {75180#false} assume !!(0 == ~mode3~0 % 256); {75180#false} is VALID [2022-02-20 18:58:35,872 INFO L290 TraceCheckUtils]: 63: Hoare triple {75180#false} assume ~r3~0 % 256 < 2; {75180#false} is VALID [2022-02-20 18:58:35,872 INFO L290 TraceCheckUtils]: 64: Hoare triple {75180#false} assume !!(0 == ~ep31~0 % 256); {75180#false} is VALID [2022-02-20 18:58:35,872 INFO L290 TraceCheckUtils]: 65: Hoare triple {75180#false} assume !!(0 == ~ep32~0 % 256); {75180#false} is VALID [2022-02-20 18:58:35,872 INFO L290 TraceCheckUtils]: 66: Hoare triple {75180#false} ~mode3~0 := 1; {75180#false} is VALID [2022-02-20 18:58:35,872 INFO L290 TraceCheckUtils]: 67: Hoare triple {75180#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; {75180#false} is VALID [2022-02-20 18:58:35,872 INFO L290 TraceCheckUtils]: 68: Hoare triple {75180#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {75180#false} is VALID [2022-02-20 18:58:35,872 INFO L290 TraceCheckUtils]: 69: Hoare triple {75180#false} ~__return_1445~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1445~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; {75180#false} is VALID [2022-02-20 18:58:35,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {75180#false} assume 0 == main_~assert__arg~0#1 % 256; {75180#false} is VALID [2022-02-20 18:58:35,873 INFO L290 TraceCheckUtils]: 71: Hoare triple {75180#false} assume !false; {75180#false} is VALID [2022-02-20 18:58:35,873 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:35,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:35,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402629021] [2022-02-20 18:58:35,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402629021] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:35,874 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:35,874 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:35,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100257308] [2022-02-20 18:58:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:35,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:58:35,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:35,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:35,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:35,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:35,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:35,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:35,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:35,924 INFO L87 Difference]: Start difference. First operand 3869 states and 6234 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:45,961 INFO L93 Difference]: Finished difference Result 8646 states and 14040 transitions. [2022-02-20 18:58:45,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:45,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:58:45,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2022-02-20 18:58:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2022-02-20 18:58:45,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 509 transitions. [2022-02-20 18:58:46,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 509 edges. 509 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:47,663 INFO L225 Difference]: With dead ends: 8646 [2022-02-20 18:58:47,663 INFO L226 Difference]: Without dead ends: 5881 [2022-02-20 18:58:47,666 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:47,666 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 138 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 536 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:47,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 536 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:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states.