./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/systemc/toy.cil.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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 01:08:19,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 01:08:19,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 01:08:19,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 01:08:19,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 01:08:19,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 01:08:19,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 01:08:19,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 01:08:19,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 01:08:19,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 01:08:19,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 01:08:19,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 01:08:19,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 01:08:19,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 01:08:19,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 01:08:19,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 01:08:19,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 01:08:19,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 01:08:19,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 01:08:19,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 01:08:19,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 01:08:19,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 01:08:19,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 01:08:19,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 01:08:19,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 01:08:19,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 01:08:19,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 01:08:19,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 01:08:19,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 01:08:19,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 01:08:19,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 01:08:19,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 01:08:19,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 01:08:19,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 01:08:19,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 01:08:19,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 01:08:19,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 01:08:19,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 01:08:19,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 01:08:19,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 01:08:19,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 01:08:19,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 01:08:19,456 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 01:08:19,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 01:08:19,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 01:08:19,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 01:08:19,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 01:08:19,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 01:08:19,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 01:08:19,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 01:08:19,458 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 01:08:19,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 01:08:19,459 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 01:08:19,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 01:08:19,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 01:08:19,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 01:08:19,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 01:08:19,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 01:08:19,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 01:08:19,460 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 01:08:19,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 01:08:19,460 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 01:08:19,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 01:08:19,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 01:08:19,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 01:08:19,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 01:08:19,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:08:19,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 01:08:19,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 01:08:19,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 01:08:19,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 01:08:19,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 01:08:19,462 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 01:08:19,462 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 01:08:19,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 01:08:19,463 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 01:08:19,463 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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2021-12-16 01:08:19,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 01:08:19,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 01:08:19,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 01:08:19,604 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 01:08:19,605 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 01:08:19,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2021-12-16 01:08:19,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6c3d3d7/9243a5cd6433470aaedc1e0064fb376c/FLAGe9527efda [2021-12-16 01:08:20,033 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 01:08:20,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2021-12-16 01:08:20,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6c3d3d7/9243a5cd6433470aaedc1e0064fb376c/FLAGe9527efda [2021-12-16 01:08:20,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6c3d3d7/9243a5cd6433470aaedc1e0064fb376c [2021-12-16 01:08:20,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 01:08:20,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 01:08:20,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 01:08:20,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 01:08:20,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 01:08:20,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e5926e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20, skipping insertion in model container [2021-12-16 01:08:20,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 01:08:20,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 01:08:20,224 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/systemc/toy.cil.c[697,710] [2021-12-16 01:08:20,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:08:20,281 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 01:08:20,297 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/systemc/toy.cil.c[697,710] [2021-12-16 01:08:20,321 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:08:20,334 INFO L208 MainTranslator]: Completed translation [2021-12-16 01:08:20,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20 WrapperNode [2021-12-16 01:08:20,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 01:08:20,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 01:08:20,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 01:08:20,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 01:08:20,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,372 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 362 [2021-12-16 01:08:20,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 01:08:20,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 01:08:20,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 01:08:20,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 01:08:20,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 01:08:20,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 01:08:20,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 01:08:20,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 01:08:20,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20" (1/1) ... [2021-12-16 01:08:20,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:08:20,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:08:20,443 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) [2021-12-16 01:08:20,454 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 [2021-12-16 01:08:20,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 01:08:20,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 01:08:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 01:08:20,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 01:08:20,522 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 01:08:20,523 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 01:08:20,832 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 01:08:20,837 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 01:08:20,837 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-16 01:08:20,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:08:20 BoogieIcfgContainer [2021-12-16 01:08:20,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 01:08:20,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 01:08:20,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 01:08:20,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 01:08:20,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:08:20" (1/3) ... [2021-12-16 01:08:20,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dd7a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:08:20, skipping insertion in model container [2021-12-16 01:08:20,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:20" (2/3) ... [2021-12-16 01:08:20,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dd7a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:08:20, skipping insertion in model container [2021-12-16 01:08:20,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:08:20" (3/3) ... [2021-12-16 01:08:20,845 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2021-12-16 01:08:20,848 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 01:08:20,848 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 01:08:20,877 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 01:08:20,881 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 [2021-12-16 01:08:20,881 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 01:08:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.8384615384615384) internal successors, (239), 131 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:20,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:20,897 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] [2021-12-16 01:08:20,898 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:20,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:20,901 INFO L85 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2021-12-16 01:08:20,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:20,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479905371] [2021-12-16 01:08:20,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:20,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:21,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:21,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479905371] [2021-12-16 01:08:21,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479905371] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:21,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:21,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:21,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206305322] [2021-12-16 01:08:21,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:21,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:21,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:21,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:21,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:21,065 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.8384615384615384) internal successors, (239), 131 states have internal predecessors, (239), 0 states have call successors, (0), 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 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:21,126 INFO L93 Difference]: Finished difference Result 255 states and 464 transitions. [2021-12-16 01:08:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:21,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:21,137 INFO L225 Difference]: With dead ends: 255 [2021-12-16 01:08:21,137 INFO L226 Difference]: Without dead ends: 127 [2021-12-16 01:08:21,140 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 [2021-12-16 01:08:21,143 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:21,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-16 01:08:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-12-16 01:08:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 220 transitions. [2021-12-16 01:08:21,185 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 220 transitions. Word has length 36 [2021-12-16 01:08:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:21,186 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 220 transitions. [2021-12-16 01:08:21,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2021-12-16 01:08:21,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:21,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:21,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:21,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 01:08:21,190 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:21,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2021-12-16 01:08:21,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:21,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453193738] [2021-12-16 01:08:21,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:21,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:21,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:21,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453193738] [2021-12-16 01:08:21,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453193738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:21,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:21,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:21,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084760203] [2021-12-16 01:08:21,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:21,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:21,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:21,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:21,265 INFO L87 Difference]: Start difference. First operand 127 states and 220 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:21,341 INFO L93 Difference]: Finished difference Result 343 states and 592 transitions. [2021-12-16 01:08:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 01:08:21,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:21,345 INFO L225 Difference]: With dead ends: 343 [2021-12-16 01:08:21,346 INFO L226 Difference]: Without dead ends: 219 [2021-12-16 01:08:21,348 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 [2021-12-16 01:08:21,350 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 574 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:21,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 370 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-16 01:08:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2021-12-16 01:08:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.7255813953488373) internal successors, (371), 215 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 371 transitions. [2021-12-16 01:08:21,374 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 371 transitions. Word has length 36 [2021-12-16 01:08:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:21,375 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 371 transitions. [2021-12-16 01:08:21,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 371 transitions. [2021-12-16 01:08:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:21,379 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:21,380 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] [2021-12-16 01:08:21,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 01:08:21,381 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:21,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2021-12-16 01:08:21,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:21,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666198242] [2021-12-16 01:08:21,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:21,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:21,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:21,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666198242] [2021-12-16 01:08:21,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666198242] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:21,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:21,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:21,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674419664] [2021-12-16 01:08:21,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:21,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:21,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:21,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:21,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:21,439 INFO L87 Difference]: Start difference. First operand 216 states and 371 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:21,479 INFO L93 Difference]: Finished difference Result 423 states and 729 transitions. [2021-12-16 01:08:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:21,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:21,481 INFO L225 Difference]: With dead ends: 423 [2021-12-16 01:08:21,482 INFO L226 Difference]: Without dead ends: 216 [2021-12-16 01:08:21,483 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 [2021-12-16 01:08:21,485 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 189 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:21,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 203 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-16 01:08:21,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-12-16 01:08:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.669767441860465) internal successors, (359), 215 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 359 transitions. [2021-12-16 01:08:21,504 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 359 transitions. Word has length 36 [2021-12-16 01:08:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:21,504 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 359 transitions. [2021-12-16 01:08:21,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 359 transitions. [2021-12-16 01:08:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:21,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:21,508 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] [2021-12-16 01:08:21,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 01:08:21,509 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:21,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1741714488, now seen corresponding path program 1 times [2021-12-16 01:08:21,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:21,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730948847] [2021-12-16 01:08:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:21,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:21,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:21,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730948847] [2021-12-16 01:08:21,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730948847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:21,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:21,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:21,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158749335] [2021-12-16 01:08:21,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:21,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:21,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:21,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:21,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:21,558 INFO L87 Difference]: Start difference. First operand 216 states and 359 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:21,626 INFO L93 Difference]: Finished difference Result 589 states and 980 transitions. [2021-12-16 01:08:21,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:08:21,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:21,628 INFO L225 Difference]: With dead ends: 589 [2021-12-16 01:08:21,628 INFO L226 Difference]: Without dead ends: 383 [2021-12-16 01:08:21,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:21,636 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 369 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:21,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 458 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:21,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-12-16 01:08:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 216. [2021-12-16 01:08:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.655813953488372) internal successors, (356), 215 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 356 transitions. [2021-12-16 01:08:21,663 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 356 transitions. Word has length 36 [2021-12-16 01:08:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:21,663 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 356 transitions. [2021-12-16 01:08:21,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 356 transitions. [2021-12-16 01:08:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:21,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:21,664 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] [2021-12-16 01:08:21,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 01:08:21,664 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:21,665 INFO L85 PathProgramCache]: Analyzing trace with hash 181513546, now seen corresponding path program 1 times [2021-12-16 01:08:21,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:21,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585843690] [2021-12-16 01:08:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:21,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:21,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:21,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585843690] [2021-12-16 01:08:21,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585843690] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:21,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:21,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:21,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971428139] [2021-12-16 01:08:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:21,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:21,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:21,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:21,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:21,714 INFO L87 Difference]: Start difference. First operand 216 states and 356 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:21,764 INFO L93 Difference]: Finished difference Result 590 states and 974 transitions. [2021-12-16 01:08:21,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:08:21,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:21,766 INFO L225 Difference]: With dead ends: 590 [2021-12-16 01:08:21,767 INFO L226 Difference]: Without dead ends: 385 [2021-12-16 01:08:21,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:21,767 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 367 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:21,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 465 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:21,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-12-16 01:08:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 216. [2021-12-16 01:08:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.6418604651162791) internal successors, (353), 215 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 353 transitions. [2021-12-16 01:08:21,783 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 353 transitions. Word has length 36 [2021-12-16 01:08:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:21,784 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 353 transitions. [2021-12-16 01:08:21,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 353 transitions. [2021-12-16 01:08:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:21,787 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:21,787 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] [2021-12-16 01:08:21,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 01:08:21,788 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:21,788 INFO L85 PathProgramCache]: Analyzing trace with hash 243553160, now seen corresponding path program 1 times [2021-12-16 01:08:21,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:21,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677201541] [2021-12-16 01:08:21,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:21,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:21,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:21,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677201541] [2021-12-16 01:08:21,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677201541] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:21,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:21,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:21,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051878655] [2021-12-16 01:08:21,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:21,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:21,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:21,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:21,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:21,847 INFO L87 Difference]: Start difference. First operand 216 states and 353 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:21,897 INFO L93 Difference]: Finished difference Result 604 states and 987 transitions. [2021-12-16 01:08:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:08:21,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:21,909 INFO L225 Difference]: With dead ends: 604 [2021-12-16 01:08:21,910 INFO L226 Difference]: Without dead ends: 400 [2021-12-16 01:08:21,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:21,912 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 373 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:21,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 473 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-12-16 01:08:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 222. [2021-12-16 01:08:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.6153846153846154) internal successors, (357), 221 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 357 transitions. [2021-12-16 01:08:21,946 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 357 transitions. Word has length 36 [2021-12-16 01:08:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:21,948 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 357 transitions. [2021-12-16 01:08:21,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 357 transitions. [2021-12-16 01:08:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:21,948 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:21,948 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] [2021-12-16 01:08:21,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 01:08:21,949 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash 384101770, now seen corresponding path program 1 times [2021-12-16 01:08:21,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:21,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750639534] [2021-12-16 01:08:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:21,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:22,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:22,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750639534] [2021-12-16 01:08:22,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750639534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:22,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:22,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:22,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448139181] [2021-12-16 01:08:22,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:22,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:22,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:22,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:22,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:22,003 INFO L87 Difference]: Start difference. First operand 222 states and 357 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:22,068 INFO L93 Difference]: Finished difference Result 759 states and 1219 transitions. [2021-12-16 01:08:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:08:22,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:22,071 INFO L225 Difference]: With dead ends: 759 [2021-12-16 01:08:22,071 INFO L226 Difference]: Without dead ends: 550 [2021-12-16 01:08:22,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:22,073 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 369 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:22,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 569 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-12-16 01:08:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 365. [2021-12-16 01:08:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.598901098901099) internal successors, (582), 364 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 582 transitions. [2021-12-16 01:08:22,104 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 582 transitions. Word has length 36 [2021-12-16 01:08:22,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:22,104 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 582 transitions. [2021-12-16 01:08:22,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 582 transitions. [2021-12-16 01:08:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:22,106 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:22,106 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] [2021-12-16 01:08:22,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 01:08:22,107 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:22,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:22,107 INFO L85 PathProgramCache]: Analyzing trace with hash 250088264, now seen corresponding path program 1 times [2021-12-16 01:08:22,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:22,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535986501] [2021-12-16 01:08:22,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:22,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:22,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:22,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535986501] [2021-12-16 01:08:22,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535986501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:22,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:22,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:22,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716227914] [2021-12-16 01:08:22,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:22,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:22,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:22,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:22,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:22,154 INFO L87 Difference]: Start difference. First operand 365 states and 582 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:22,180 INFO L93 Difference]: Finished difference Result 872 states and 1395 transitions. [2021-12-16 01:08:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:22,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:22,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:22,182 INFO L225 Difference]: With dead ends: 872 [2021-12-16 01:08:22,182 INFO L226 Difference]: Without dead ends: 531 [2021-12-16 01:08:22,183 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 [2021-12-16 01:08:22,184 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 177 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:22,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 342 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-12-16 01:08:22,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2021-12-16 01:08:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5946969696969697) internal successors, (842), 528 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 842 transitions. [2021-12-16 01:08:22,198 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 842 transitions. Word has length 36 [2021-12-16 01:08:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:22,198 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 842 transitions. [2021-12-16 01:08:22,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 842 transitions. [2021-12-16 01:08:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:22,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:22,199 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] [2021-12-16 01:08:22,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 01:08:22,201 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:22,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1539793604, now seen corresponding path program 1 times [2021-12-16 01:08:22,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:22,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615032484] [2021-12-16 01:08:22,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:22,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:22,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:22,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615032484] [2021-12-16 01:08:22,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615032484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:22,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:22,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:22,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936054405] [2021-12-16 01:08:22,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:22,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:22,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:22,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:22,236 INFO L87 Difference]: Start difference. First operand 529 states and 842 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:22,302 INFO L93 Difference]: Finished difference Result 1347 states and 2145 transitions. [2021-12-16 01:08:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 01:08:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:22,306 INFO L225 Difference]: With dead ends: 1347 [2021-12-16 01:08:22,306 INFO L226 Difference]: Without dead ends: 835 [2021-12-16 01:08:22,306 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 [2021-12-16 01:08:22,308 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 484 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:22,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 330 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2021-12-16 01:08:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 529. [2021-12-16 01:08:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5795454545454546) internal successors, (834), 528 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 834 transitions. [2021-12-16 01:08:22,329 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 834 transitions. Word has length 36 [2021-12-16 01:08:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:22,329 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 834 transitions. [2021-12-16 01:08:22,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 834 transitions. [2021-12-16 01:08:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:22,330 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:22,330 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] [2021-12-16 01:08:22,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 01:08:22,330 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:22,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:22,331 INFO L85 PathProgramCache]: Analyzing trace with hash -48554298, now seen corresponding path program 1 times [2021-12-16 01:08:22,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:22,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637233553] [2021-12-16 01:08:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:22,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:22,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:22,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637233553] [2021-12-16 01:08:22,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637233553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:22,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:22,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:22,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964949157] [2021-12-16 01:08:22,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:22,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:22,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:22,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:22,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:22,361 INFO L87 Difference]: Start difference. First operand 529 states and 834 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:22,425 INFO L93 Difference]: Finished difference Result 1347 states and 2122 transitions. [2021-12-16 01:08:22,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 01:08:22,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:22,429 INFO L225 Difference]: With dead ends: 1347 [2021-12-16 01:08:22,429 INFO L226 Difference]: Without dead ends: 841 [2021-12-16 01:08:22,430 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 [2021-12-16 01:08:22,431 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 468 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:22,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 319 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2021-12-16 01:08:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 529. [2021-12-16 01:08:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5643939393939394) internal successors, (826), 528 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 826 transitions. [2021-12-16 01:08:22,455 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 826 transitions. Word has length 36 [2021-12-16 01:08:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:22,456 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 826 transitions. [2021-12-16 01:08:22,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 826 transitions. [2021-12-16 01:08:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:22,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:22,457 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] [2021-12-16 01:08:22,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 01:08:22,458 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1328417976, now seen corresponding path program 1 times [2021-12-16 01:08:22,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:22,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155984931] [2021-12-16 01:08:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:22,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:22,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:22,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155984931] [2021-12-16 01:08:22,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155984931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:22,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:22,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:22,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440202689] [2021-12-16 01:08:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:22,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:22,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:22,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:22,504 INFO L87 Difference]: Start difference. First operand 529 states and 826 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:22,560 INFO L93 Difference]: Finished difference Result 1276 states and 1990 transitions. [2021-12-16 01:08:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 01:08:22,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:22,563 INFO L225 Difference]: With dead ends: 1276 [2021-12-16 01:08:22,563 INFO L226 Difference]: Without dead ends: 764 [2021-12-16 01:08:22,564 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 [2021-12-16 01:08:22,565 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 480 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:22,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 349 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:22,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-12-16 01:08:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 577. [2021-12-16 01:08:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.5329861111111112) internal successors, (883), 576 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 883 transitions. [2021-12-16 01:08:22,602 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 883 transitions. Word has length 36 [2021-12-16 01:08:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:22,602 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 883 transitions. [2021-12-16 01:08:22,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 883 transitions. [2021-12-16 01:08:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:08:22,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:22,603 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] [2021-12-16 01:08:22,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 01:08:22,603 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2021-12-16 01:08:22,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:22,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133847783] [2021-12-16 01:08:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:22,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:22,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:22,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133847783] [2021-12-16 01:08:22,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133847783] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:22,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:22,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:22,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833135072] [2021-12-16 01:08:22,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:22,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:22,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:22,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:22,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:22,626 INFO L87 Difference]: Start difference. First operand 577 states and 883 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:22,662 INFO L93 Difference]: Finished difference Result 1372 states and 2104 transitions. [2021-12-16 01:08:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:22,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-12-16 01:08:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:22,665 INFO L225 Difference]: With dead ends: 1372 [2021-12-16 01:08:22,665 INFO L226 Difference]: Without dead ends: 809 [2021-12-16 01:08:22,665 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 [2021-12-16 01:08:22,666 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 118 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:22,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 312 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-12-16 01:08:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 806. [2021-12-16 01:08:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.5142857142857142) internal successors, (1219), 805 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1219 transitions. [2021-12-16 01:08:22,687 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1219 transitions. Word has length 36 [2021-12-16 01:08:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:22,687 INFO L470 AbstractCegarLoop]: Abstraction has 806 states and 1219 transitions. [2021-12-16 01:08:22,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1219 transitions. [2021-12-16 01:08:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-16 01:08:22,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:22,688 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:22,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 01:08:22,689 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:22,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1539863823, now seen corresponding path program 1 times [2021-12-16 01:08:22,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:22,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492634515] [2021-12-16 01:08:22,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:22,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:22,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:22,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492634515] [2021-12-16 01:08:22,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492634515] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:22,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:22,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:22,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334089186] [2021-12-16 01:08:22,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:22,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:22,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:22,714 INFO L87 Difference]: Start difference. First operand 806 states and 1219 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:22,750 INFO L93 Difference]: Finished difference Result 1999 states and 3056 transitions. [2021-12-16 01:08:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:22,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-12-16 01:08:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:22,753 INFO L225 Difference]: With dead ends: 1999 [2021-12-16 01:08:22,754 INFO L226 Difference]: Without dead ends: 1220 [2021-12-16 01:08:22,755 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 [2021-12-16 01:08:22,755 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 81 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:22,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 414 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:22,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2021-12-16 01:08:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1218. [2021-12-16 01:08:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1217 states have (on average 1.5209531635168447) internal successors, (1851), 1217 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1851 transitions. [2021-12-16 01:08:22,797 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1851 transitions. Word has length 47 [2021-12-16 01:08:22,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:22,797 INFO L470 AbstractCegarLoop]: Abstraction has 1218 states and 1851 transitions. [2021-12-16 01:08:22,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1851 transitions. [2021-12-16 01:08:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-16 01:08:22,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:22,798 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:22,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 01:08:22,799 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash 642470545, now seen corresponding path program 1 times [2021-12-16 01:08:22,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:22,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048681063] [2021-12-16 01:08:22,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:22,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 01:08:22,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:22,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048681063] [2021-12-16 01:08:22,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048681063] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:22,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:22,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:22,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058961530] [2021-12-16 01:08:22,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:22,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:22,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:22,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:22,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:22,820 INFO L87 Difference]: Start difference. First operand 1218 states and 1851 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:22,850 INFO L93 Difference]: Finished difference Result 2387 states and 3643 transitions. [2021-12-16 01:08:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:22,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 47 [2021-12-16 01:08:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:22,853 INFO L225 Difference]: With dead ends: 2387 [2021-12-16 01:08:22,853 INFO L226 Difference]: Without dead ends: 1196 [2021-12-16 01:08:22,856 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 [2021-12-16 01:08:22,857 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:22,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 182 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2021-12-16 01:08:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1196. [2021-12-16 01:08:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 1.5263598326359833) internal successors, (1824), 1195 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1824 transitions. [2021-12-16 01:08:22,887 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1824 transitions. Word has length 47 [2021-12-16 01:08:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:22,888 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 1824 transitions. [2021-12-16 01:08:22,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1824 transitions. [2021-12-16 01:08:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-16 01:08:22,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:22,889 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:22,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 01:08:22,889 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:22,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1991530956, now seen corresponding path program 1 times [2021-12-16 01:08:22,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:22,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490273096] [2021-12-16 01:08:22,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:22,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:22,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:22,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490273096] [2021-12-16 01:08:22,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490273096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:22,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:22,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:22,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003896715] [2021-12-16 01:08:22,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:22,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:22,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:22,911 INFO L87 Difference]: Start difference. First operand 1196 states and 1824 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:22,990 INFO L93 Difference]: Finished difference Result 3056 states and 4711 transitions. [2021-12-16 01:08:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:22,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-12-16 01:08:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:22,996 INFO L225 Difference]: With dead ends: 3056 [2021-12-16 01:08:22,996 INFO L226 Difference]: Without dead ends: 1887 [2021-12-16 01:08:22,998 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 [2021-12-16 01:08:22,998 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 82 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:22,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 322 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2021-12-16 01:08:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1885. [2021-12-16 01:08:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1884 states have (on average 1.5345010615711252) internal successors, (2891), 1884 states have internal predecessors, (2891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2891 transitions. [2021-12-16 01:08:23,050 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2891 transitions. Word has length 48 [2021-12-16 01:08:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:23,050 INFO L470 AbstractCegarLoop]: Abstraction has 1885 states and 2891 transitions. [2021-12-16 01:08:23,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2891 transitions. [2021-12-16 01:08:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-16 01:08:23,052 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:23,052 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:23,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 01:08:23,053 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:23,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash 253027899, now seen corresponding path program 1 times [2021-12-16 01:08:23,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:23,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472170738] [2021-12-16 01:08:23,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:23,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:23,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:23,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472170738] [2021-12-16 01:08:23,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472170738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:23,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:23,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:23,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520541074] [2021-12-16 01:08:23,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:23,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:23,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:23,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:23,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:23,086 INFO L87 Difference]: Start difference. First operand 1885 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:23,189 INFO L93 Difference]: Finished difference Result 5076 states and 7877 transitions. [2021-12-16 01:08:23,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:23,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-12-16 01:08:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:23,197 INFO L225 Difference]: With dead ends: 5076 [2021-12-16 01:08:23,197 INFO L226 Difference]: Without dead ends: 3220 [2021-12-16 01:08:23,199 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 [2021-12-16 01:08:23,200 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 86 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:23,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 385 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2021-12-16 01:08:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3218. [2021-12-16 01:08:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 3217 states have (on average 1.5461610195834627) internal successors, (4974), 3217 states have internal predecessors, (4974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 4974 transitions. [2021-12-16 01:08:23,301 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 4974 transitions. Word has length 49 [2021-12-16 01:08:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:23,302 INFO L470 AbstractCegarLoop]: Abstraction has 3218 states and 4974 transitions. [2021-12-16 01:08:23,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 4974 transitions. [2021-12-16 01:08:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-16 01:08:23,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:23,303 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:23,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 01:08:23,304 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash -644365379, now seen corresponding path program 1 times [2021-12-16 01:08:23,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:23,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868254914] [2021-12-16 01:08:23,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:23,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-16 01:08:23,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:23,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868254914] [2021-12-16 01:08:23,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868254914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:23,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:23,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:23,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437842605] [2021-12-16 01:08:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:23,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:23,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:23,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:23,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:23,320 INFO L87 Difference]: Start difference. First operand 3218 states and 4974 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:23,408 INFO L93 Difference]: Finished difference Result 6385 states and 9889 transitions. [2021-12-16 01:08:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:23,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 49 [2021-12-16 01:08:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:23,417 INFO L225 Difference]: With dead ends: 6385 [2021-12-16 01:08:23,417 INFO L226 Difference]: Without dead ends: 3196 [2021-12-16 01:08:23,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:23,421 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:23,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 181 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2021-12-16 01:08:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 3196. [2021-12-16 01:08:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3196 states, 3195 states have (on average 1.5486697965571206) internal successors, (4948), 3195 states have internal predecessors, (4948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 4948 transitions. [2021-12-16 01:08:23,516 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 4948 transitions. Word has length 49 [2021-12-16 01:08:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:23,516 INFO L470 AbstractCegarLoop]: Abstraction has 3196 states and 4948 transitions. [2021-12-16 01:08:23,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 4948 transitions. [2021-12-16 01:08:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-16 01:08:23,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:23,517 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:23,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 01:08:23,518 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:23,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1777423200, now seen corresponding path program 1 times [2021-12-16 01:08:23,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:23,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993496741] [2021-12-16 01:08:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:23,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:23,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:23,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993496741] [2021-12-16 01:08:23,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993496741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:23,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:23,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:23,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076856341] [2021-12-16 01:08:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:23,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:23,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:23,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:23,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:23,575 INFO L87 Difference]: Start difference. First operand 3196 states and 4948 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:23,717 INFO L93 Difference]: Finished difference Result 8133 states and 12621 transitions. [2021-12-16 01:08:23,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:08:23,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-12-16 01:08:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:23,729 INFO L225 Difference]: With dead ends: 8133 [2021-12-16 01:08:23,730 INFO L226 Difference]: Without dead ends: 4173 [2021-12-16 01:08:23,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:23,736 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 401 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:23,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 305 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2021-12-16 01:08:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4173. [2021-12-16 01:08:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4173 states, 4172 states have (on average 1.537392138063279) internal successors, (6414), 4172 states have internal predecessors, (6414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 6414 transitions. [2021-12-16 01:08:23,881 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 6414 transitions. Word has length 50 [2021-12-16 01:08:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:23,881 INFO L470 AbstractCegarLoop]: Abstraction has 4173 states and 6414 transitions. [2021-12-16 01:08:23,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 6414 transitions. [2021-12-16 01:08:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-16 01:08:23,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:23,883 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:23,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 01:08:23,883 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:23,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1800183507, now seen corresponding path program 1 times [2021-12-16 01:08:23,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:23,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53315115] [2021-12-16 01:08:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:23,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:23,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:23,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53315115] [2021-12-16 01:08:23,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53315115] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:23,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:23,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 01:08:23,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481548065] [2021-12-16 01:08:23,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:23,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 01:08:23,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:23,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 01:08:23,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:23,923 INFO L87 Difference]: Start difference. First operand 4173 states and 6414 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:24,147 INFO L93 Difference]: Finished difference Result 10612 states and 16218 transitions. [2021-12-16 01:08:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:08:24,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-12-16 01:08:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:24,166 INFO L225 Difference]: With dead ends: 10612 [2021-12-16 01:08:24,166 INFO L226 Difference]: Without dead ends: 6462 [2021-12-16 01:08:24,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:24,173 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 684 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:24,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 514 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6462 states. [2021-12-16 01:08:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6462 to 4868. [2021-12-16 01:08:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4868 states, 4867 states have (on average 1.5062666940620506) internal successors, (7331), 4867 states have internal predecessors, (7331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7331 transitions. [2021-12-16 01:08:24,349 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7331 transitions. Word has length 56 [2021-12-16 01:08:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:24,350 INFO L470 AbstractCegarLoop]: Abstraction has 4868 states and 7331 transitions. [2021-12-16 01:08:24,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7331 transitions. [2021-12-16 01:08:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-16 01:08:24,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:24,353 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:24,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 01:08:24,354 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash 138410889, now seen corresponding path program 1 times [2021-12-16 01:08:24,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:24,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112051055] [2021-12-16 01:08:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:24,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:24,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:24,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112051055] [2021-12-16 01:08:24,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112051055] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:24,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:24,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:24,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703527648] [2021-12-16 01:08:24,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:24,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:24,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:24,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:24,378 INFO L87 Difference]: Start difference. First operand 4868 states and 7331 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:24,525 INFO L93 Difference]: Finished difference Result 10083 states and 15152 transitions. [2021-12-16 01:08:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:24,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-12-16 01:08:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:24,544 INFO L225 Difference]: With dead ends: 10083 [2021-12-16 01:08:24,544 INFO L226 Difference]: Without dead ends: 5244 [2021-12-16 01:08:24,548 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 [2021-12-16 01:08:24,549 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 128 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:24,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 311 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2021-12-16 01:08:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5212. [2021-12-16 01:08:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5212 states, 5211 states have (on average 1.459220878909998) internal successors, (7604), 5211 states have internal predecessors, (7604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 7604 transitions. [2021-12-16 01:08:24,733 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 7604 transitions. Word has length 90 [2021-12-16 01:08:24,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:24,733 INFO L470 AbstractCegarLoop]: Abstraction has 5212 states and 7604 transitions. [2021-12-16 01:08:24,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 7604 transitions. [2021-12-16 01:08:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-16 01:08:24,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:24,736 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:24,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-16 01:08:24,737 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash -56607288, now seen corresponding path program 1 times [2021-12-16 01:08:24,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:24,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371068961] [2021-12-16 01:08:24,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:24,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:24,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:24,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371068961] [2021-12-16 01:08:24,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371068961] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:24,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:24,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:24,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599403160] [2021-12-16 01:08:24,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:24,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:24,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:24,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:24,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:24,755 INFO L87 Difference]: Start difference. First operand 5212 states and 7604 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:24,939 INFO L93 Difference]: Finished difference Result 10937 states and 15918 transitions. [2021-12-16 01:08:24,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:24,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-12-16 01:08:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:24,949 INFO L225 Difference]: With dead ends: 10937 [2021-12-16 01:08:24,949 INFO L226 Difference]: Without dead ends: 5766 [2021-12-16 01:08:24,954 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 [2021-12-16 01:08:24,955 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 127 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:24,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 310 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2021-12-16 01:08:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5718. [2021-12-16 01:08:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5718 states, 5717 states have (on average 1.4131537519678152) internal successors, (8079), 5717 states have internal predecessors, (8079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:25,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 8079 transitions. [2021-12-16 01:08:25,175 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 8079 transitions. Word has length 91 [2021-12-16 01:08:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:25,175 INFO L470 AbstractCegarLoop]: Abstraction has 5718 states and 8079 transitions. [2021-12-16 01:08:25,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 8079 transitions. [2021-12-16 01:08:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-16 01:08:25,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:25,180 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:25,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 01:08:25,180 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:25,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1840400199, now seen corresponding path program 1 times [2021-12-16 01:08:25,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:25,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389823945] [2021-12-16 01:08:25,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:25,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:25,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:25,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389823945] [2021-12-16 01:08:25,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389823945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:25,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:25,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:25,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847823669] [2021-12-16 01:08:25,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:25,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:25,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:25,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:25,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:25,200 INFO L87 Difference]: Start difference. First operand 5718 states and 8079 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:25,428 INFO L93 Difference]: Finished difference Result 11756 states and 16622 transitions. [2021-12-16 01:08:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:25,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-12-16 01:08:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:25,437 INFO L225 Difference]: With dead ends: 11756 [2021-12-16 01:08:25,437 INFO L226 Difference]: Without dead ends: 6099 [2021-12-16 01:08:25,441 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 [2021-12-16 01:08:25,441 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 123 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:25,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 307 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6099 states. [2021-12-16 01:08:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6099 to 5484. [2021-12-16 01:08:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5484 states, 5483 states have (on average 1.3549151924129126) internal successors, (7429), 5483 states have internal predecessors, (7429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 7429 transitions. [2021-12-16 01:08:25,604 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 7429 transitions. Word has length 92 [2021-12-16 01:08:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:25,604 INFO L470 AbstractCegarLoop]: Abstraction has 5484 states and 7429 transitions. [2021-12-16 01:08:25,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 7429 transitions. [2021-12-16 01:08:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-16 01:08:25,608 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:25,608 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:25,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-16 01:08:25,609 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash -195529206, now seen corresponding path program 1 times [2021-12-16 01:08:25,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:25,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478802980] [2021-12-16 01:08:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:25,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 01:08:25,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:25,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478802980] [2021-12-16 01:08:25,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478802980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:25,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:25,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:25,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49620433] [2021-12-16 01:08:25,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:25,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:25,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:25,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:25,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:25,634 INFO L87 Difference]: Start difference. First operand 5484 states and 7429 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:25,846 INFO L93 Difference]: Finished difference Result 10260 states and 13825 transitions. [2021-12-16 01:08:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:08:25,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 93 [2021-12-16 01:08:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:25,854 INFO L225 Difference]: With dead ends: 10260 [2021-12-16 01:08:25,855 INFO L226 Difference]: Without dead ends: 5263 [2021-12-16 01:08:25,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:25,859 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 441 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:25,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 390 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2021-12-16 01:08:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5149. [2021-12-16 01:08:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5149 states, 5148 states have (on average 1.3090520590520591) internal successors, (6739), 5148 states have internal predecessors, (6739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 6739 transitions. [2021-12-16 01:08:26,034 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 6739 transitions. Word has length 93 [2021-12-16 01:08:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:26,034 INFO L470 AbstractCegarLoop]: Abstraction has 5149 states and 6739 transitions. [2021-12-16 01:08:26,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 6739 transitions. [2021-12-16 01:08:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-16 01:08:26,041 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:26,041 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:26,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-16 01:08:26,041 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:26,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1965826331, now seen corresponding path program 1 times [2021-12-16 01:08:26,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:26,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989672589] [2021-12-16 01:08:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:26,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 01:08:26,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:26,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989672589] [2021-12-16 01:08:26,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989672589] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:26,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:26,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:26,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488282294] [2021-12-16 01:08:26,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:26,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:26,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:26,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:26,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:26,062 INFO L87 Difference]: Start difference. First operand 5149 states and 6739 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:26,210 INFO L93 Difference]: Finished difference Result 9832 states and 12854 transitions. [2021-12-16 01:08:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:26,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 122 [2021-12-16 01:08:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:26,218 INFO L225 Difference]: With dead ends: 9832 [2021-12-16 01:08:26,218 INFO L226 Difference]: Without dead ends: 5095 [2021-12-16 01:08:26,223 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 [2021-12-16 01:08:26,223 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 34 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:26,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 301 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5095 states. [2021-12-16 01:08:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5095 to 5095. [2021-12-16 01:08:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5094 states have (on average 1.302120141342756) internal successors, (6633), 5094 states have internal predecessors, (6633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 6633 transitions. [2021-12-16 01:08:26,406 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 6633 transitions. Word has length 122 [2021-12-16 01:08:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:26,406 INFO L470 AbstractCegarLoop]: Abstraction has 5095 states and 6633 transitions. [2021-12-16 01:08:26,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:26,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 6633 transitions. [2021-12-16 01:08:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-16 01:08:26,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:26,413 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:26,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-16 01:08:26,414 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:26,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1720762163, now seen corresponding path program 1 times [2021-12-16 01:08:26,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:26,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127151567] [2021-12-16 01:08:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:26,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 01:08:26,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:26,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127151567] [2021-12-16 01:08:26,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127151567] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:26,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:26,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:26,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305177603] [2021-12-16 01:08:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:26,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:26,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:26,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:26,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:26,440 INFO L87 Difference]: Start difference. First operand 5095 states and 6633 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:26,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:26,591 INFO L93 Difference]: Finished difference Result 9065 states and 11821 transitions. [2021-12-16 01:08:26,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:08:26,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 135 [2021-12-16 01:08:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:26,599 INFO L225 Difference]: With dead ends: 9065 [2021-12-16 01:08:26,599 INFO L226 Difference]: Without dead ends: 5011 [2021-12-16 01:08:26,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:26,603 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 306 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:26,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 312 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:26,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2021-12-16 01:08:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 5009. [2021-12-16 01:08:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5009 states, 5008 states have (on average 1.279552715654952) internal successors, (6408), 5008 states have internal predecessors, (6408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5009 states to 5009 states and 6408 transitions. [2021-12-16 01:08:26,811 INFO L78 Accepts]: Start accepts. Automaton has 5009 states and 6408 transitions. Word has length 135 [2021-12-16 01:08:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:26,811 INFO L470 AbstractCegarLoop]: Abstraction has 5009 states and 6408 transitions. [2021-12-16 01:08:26,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5009 states and 6408 transitions. [2021-12-16 01:08:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-16 01:08:26,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:26,817 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:26,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-16 01:08:26,818 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1604483709, now seen corresponding path program 1 times [2021-12-16 01:08:26,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:26,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86681734] [2021-12-16 01:08:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:26,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 01:08:26,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:26,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86681734] [2021-12-16 01:08:26,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86681734] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:26,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:26,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:26,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796518510] [2021-12-16 01:08:26,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:26,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:26,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:26,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:26,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:26,841 INFO L87 Difference]: Start difference. First operand 5009 states and 6408 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:27,031 INFO L93 Difference]: Finished difference Result 9599 states and 12268 transitions. [2021-12-16 01:08:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:27,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 141 [2021-12-16 01:08:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:27,038 INFO L225 Difference]: With dead ends: 9599 [2021-12-16 01:08:27,038 INFO L226 Difference]: Without dead ends: 5009 [2021-12-16 01:08:27,043 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 [2021-12-16 01:08:27,044 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 25 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:27,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5009 states. [2021-12-16 01:08:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5009 to 4969. [2021-12-16 01:08:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4969 states, 4968 states have (on average 1.2733494363929148) internal successors, (6326), 4968 states have internal predecessors, (6326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4969 states to 4969 states and 6326 transitions. [2021-12-16 01:08:27,245 INFO L78 Accepts]: Start accepts. Automaton has 4969 states and 6326 transitions. Word has length 141 [2021-12-16 01:08:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:27,246 INFO L470 AbstractCegarLoop]: Abstraction has 4969 states and 6326 transitions. [2021-12-16 01:08:27,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 4969 states and 6326 transitions. [2021-12-16 01:08:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-16 01:08:27,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:27,251 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:27,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-16 01:08:27,252 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash -371935883, now seen corresponding path program 1 times [2021-12-16 01:08:27,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:27,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584630966] [2021-12-16 01:08:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:27,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 01:08:27,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:27,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584630966] [2021-12-16 01:08:27,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584630966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:27,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:27,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:27,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663533821] [2021-12-16 01:08:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:27,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:27,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:27,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:27,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:27,275 INFO L87 Difference]: Start difference. First operand 4969 states and 6326 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:27,468 INFO L93 Difference]: Finished difference Result 9547 states and 12146 transitions. [2021-12-16 01:08:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:27,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 141 [2021-12-16 01:08:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:27,474 INFO L225 Difference]: With dead ends: 9547 [2021-12-16 01:08:27,474 INFO L226 Difference]: Without dead ends: 4978 [2021-12-16 01:08:27,478 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 [2021-12-16 01:08:27,479 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 21 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:27,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 299 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2021-12-16 01:08:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 4938. [2021-12-16 01:08:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4937 states have (on average 1.2667611910066843) internal successors, (6254), 4937 states have internal predecessors, (6254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 6254 transitions. [2021-12-16 01:08:27,648 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 6254 transitions. Word has length 141 [2021-12-16 01:08:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:27,648 INFO L470 AbstractCegarLoop]: Abstraction has 4938 states and 6254 transitions. [2021-12-16 01:08:27,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 6254 transitions. [2021-12-16 01:08:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-16 01:08:27,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:27,654 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:27,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-16 01:08:27,654 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:27,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1226586588, now seen corresponding path program 1 times [2021-12-16 01:08:27,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:27,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680807895] [2021-12-16 01:08:27,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:27,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-16 01:08:27,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:27,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680807895] [2021-12-16 01:08:27,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680807895] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:27,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:27,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:27,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781032990] [2021-12-16 01:08:27,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:27,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:27,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:27,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:27,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:27,696 INFO L87 Difference]: Start difference. First operand 4938 states and 6254 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:27,813 INFO L93 Difference]: Finished difference Result 8060 states and 10251 transitions. [2021-12-16 01:08:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:08:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 145 [2021-12-16 01:08:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:27,817 INFO L225 Difference]: With dead ends: 8060 [2021-12-16 01:08:27,817 INFO L226 Difference]: Without dead ends: 3522 [2021-12-16 01:08:27,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:27,821 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 278 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:27,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 291 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3522 states. [2021-12-16 01:08:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3522 to 3520. [2021-12-16 01:08:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 3519 states have (on average 1.2358624609263995) internal successors, (4349), 3519 states have internal predecessors, (4349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4349 transitions. [2021-12-16 01:08:27,925 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4349 transitions. Word has length 145 [2021-12-16 01:08:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:27,925 INFO L470 AbstractCegarLoop]: Abstraction has 3520 states and 4349 transitions. [2021-12-16 01:08:27,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4349 transitions. [2021-12-16 01:08:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-16 01:08:27,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:27,929 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:27,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-16 01:08:27,929 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:27,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:27,930 INFO L85 PathProgramCache]: Analyzing trace with hash 546835114, now seen corresponding path program 1 times [2021-12-16 01:08:27,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:27,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033213936] [2021-12-16 01:08:27,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:27,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 01:08:27,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:27,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033213936] [2021-12-16 01:08:27,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033213936] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:27,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:27,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:27,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471672545] [2021-12-16 01:08:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:27,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:27,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:27,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:27,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:27,953 INFO L87 Difference]: Start difference. First operand 3520 states and 4349 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:28,045 INFO L93 Difference]: Finished difference Result 5695 states and 7039 transitions. [2021-12-16 01:08:28,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:08:28,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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 145 [2021-12-16 01:08:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:28,047 INFO L225 Difference]: With dead ends: 5695 [2021-12-16 01:08:28,048 INFO L226 Difference]: Without dead ends: 2256 [2021-12-16 01:08:28,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:28,050 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 282 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:28,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 284 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2021-12-16 01:08:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2254. [2021-12-16 01:08:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 1.2041722148246783) internal successors, (2713), 2253 states have internal predecessors, (2713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 2713 transitions. [2021-12-16 01:08:28,121 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 2713 transitions. Word has length 145 [2021-12-16 01:08:28,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:28,121 INFO L470 AbstractCegarLoop]: Abstraction has 2254 states and 2713 transitions. [2021-12-16 01:08:28,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2713 transitions. [2021-12-16 01:08:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-16 01:08:28,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:28,123 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:28,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-16 01:08:28,123 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:28,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1626731220, now seen corresponding path program 1 times [2021-12-16 01:08:28,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:28,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429610018] [2021-12-16 01:08:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:28,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-16 01:08:28,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:28,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429610018] [2021-12-16 01:08:28,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429610018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:28,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:28,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:28,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882543986] [2021-12-16 01:08:28,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:28,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:28,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:28,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:28,153 INFO L87 Difference]: Start difference. First operand 2254 states and 2713 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:28,220 INFO L93 Difference]: Finished difference Result 4070 states and 4934 transitions. [2021-12-16 01:08:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:28,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 184 [2021-12-16 01:08:28,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:28,222 INFO L225 Difference]: With dead ends: 4070 [2021-12-16 01:08:28,222 INFO L226 Difference]: Without dead ends: 2192 [2021-12-16 01:08:28,223 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 [2021-12-16 01:08:28,224 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:28,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 300 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2021-12-16 01:08:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2114. [2021-12-16 01:08:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2113 states have (on average 1.1902508282063418) internal successors, (2515), 2113 states have internal predecessors, (2515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2515 transitions. [2021-12-16 01:08:28,285 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2515 transitions. Word has length 184 [2021-12-16 01:08:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:28,287 INFO L470 AbstractCegarLoop]: Abstraction has 2114 states and 2515 transitions. [2021-12-16 01:08:28,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2515 transitions. [2021-12-16 01:08:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-12-16 01:08:28,288 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:28,288 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:28,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-16 01:08:28,289 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:28,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1822764650, now seen corresponding path program 1 times [2021-12-16 01:08:28,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:28,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805506951] [2021-12-16 01:08:28,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:28,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-16 01:08:28,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:28,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805506951] [2021-12-16 01:08:28,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805506951] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:28,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:28,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:28,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30256105] [2021-12-16 01:08:28,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:28,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:28,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:28,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:28,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:28,327 INFO L87 Difference]: Start difference. First operand 2114 states and 2515 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:28,410 INFO L93 Difference]: Finished difference Result 4533 states and 5432 transitions. [2021-12-16 01:08:28,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:28,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 191 [2021-12-16 01:08:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:28,412 INFO L225 Difference]: With dead ends: 4533 [2021-12-16 01:08:28,412 INFO L226 Difference]: Without dead ends: 2789 [2021-12-16 01:08:28,413 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 [2021-12-16 01:08:28,414 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 132 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:28,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 298 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2021-12-16 01:08:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2408. [2021-12-16 01:08:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2407 states have (on average 1.1761528874117158) internal successors, (2831), 2407 states have internal predecessors, (2831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2831 transitions. [2021-12-16 01:08:28,486 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2831 transitions. Word has length 191 [2021-12-16 01:08:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:28,487 INFO L470 AbstractCegarLoop]: Abstraction has 2408 states and 2831 transitions. [2021-12-16 01:08:28,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2831 transitions. [2021-12-16 01:08:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-12-16 01:08:28,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:28,488 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:28,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-16 01:08:28,488 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash 377236115, now seen corresponding path program 1 times [2021-12-16 01:08:28,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:28,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554051549] [2021-12-16 01:08:28,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:28,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 01:08:28,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:28,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554051549] [2021-12-16 01:08:28,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554051549] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:08:28,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875268236] [2021-12-16 01:08:28,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:28,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:08:28,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:08:28,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 01:08:28,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 01:08:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:28,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-16 01:08:28,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:08:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 01:08:29,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 01:08:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-16 01:08:29,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875268236] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 01:08:29,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 01:08:29,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 27 [2021-12-16 01:08:29,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48610869] [2021-12-16 01:08:29,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 01:08:29,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-16 01:08:29,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:29,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-16 01:08:29,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2021-12-16 01:08:29,759 INFO L87 Difference]: Start difference. First operand 2408 states and 2831 transitions. Second operand has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:31,445 INFO L93 Difference]: Finished difference Result 9992 states and 11725 transitions. [2021-12-16 01:08:31,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-12-16 01:08:31,446 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 0 states have call successors, (0), 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 194 [2021-12-16 01:08:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:31,454 INFO L225 Difference]: With dead ends: 9992 [2021-12-16 01:08:31,454 INFO L226 Difference]: Without dead ends: 7941 [2021-12-16 01:08:31,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=745, Invalid=5735, Unknown=0, NotChecked=0, Total=6480 [2021-12-16 01:08:31,459 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 3720 mSDsluCounter, 10174 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3720 SdHoareTripleChecker+Valid, 10776 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:31,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3720 Valid, 10776 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 01:08:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7941 states. [2021-12-16 01:08:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7941 to 3429. [2021-12-16 01:08:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 3428 states have (on average 1.175029171528588) internal successors, (4028), 3428 states have internal predecessors, (4028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4028 transitions. [2021-12-16 01:08:31,598 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 4028 transitions. Word has length 194 [2021-12-16 01:08:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:31,598 INFO L470 AbstractCegarLoop]: Abstraction has 3429 states and 4028 transitions. [2021-12-16 01:08:31,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 4028 transitions. [2021-12-16 01:08:31,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2021-12-16 01:08:31,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:31,601 INFO L514 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:31,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 01:08:31,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-12-16 01:08:31,821 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash -714863608, now seen corresponding path program 1 times [2021-12-16 01:08:31,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:31,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531692384] [2021-12-16 01:08:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:31,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-12-16 01:08:31,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:31,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531692384] [2021-12-16 01:08:31,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531692384] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:31,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:31,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:31,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470422697] [2021-12-16 01:08:31,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:31,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:31,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:31,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:31,868 INFO L87 Difference]: Start difference. First operand 3429 states and 4028 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:31,974 INFO L93 Difference]: Finished difference Result 5329 states and 6235 transitions. [2021-12-16 01:08:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:31,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 263 [2021-12-16 01:08:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:31,977 INFO L225 Difference]: With dead ends: 5329 [2021-12-16 01:08:31,977 INFO L226 Difference]: Without dead ends: 2305 [2021-12-16 01:08:31,979 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 [2021-12-16 01:08:31,981 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:31,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 314 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2021-12-16 01:08:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2272. [2021-12-16 01:08:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.1501541171290182) internal successors, (2612), 2271 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2612 transitions. [2021-12-16 01:08:32,102 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2612 transitions. Word has length 263 [2021-12-16 01:08:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:32,102 INFO L470 AbstractCegarLoop]: Abstraction has 2272 states and 2612 transitions. [2021-12-16 01:08:32,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:32,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2612 transitions. [2021-12-16 01:08:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-12-16 01:08:32,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:32,104 INFO L514 BasicCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:32,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-16 01:08:32,105 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1759293355, now seen corresponding path program 1 times [2021-12-16 01:08:32,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:32,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467753988] [2021-12-16 01:08:32,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:32,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-16 01:08:32,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:32,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467753988] [2021-12-16 01:08:32,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467753988] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:32,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:32,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 01:08:32,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084275451] [2021-12-16 01:08:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:32,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 01:08:32,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:32,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 01:08:32,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 01:08:32,193 INFO L87 Difference]: Start difference. First operand 2272 states and 2612 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:32,300 INFO L93 Difference]: Finished difference Result 4253 states and 4901 transitions. [2021-12-16 01:08:32,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 01:08:32,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 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 271 [2021-12-16 01:08:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:32,303 INFO L225 Difference]: With dead ends: 4253 [2021-12-16 01:08:32,303 INFO L226 Difference]: Without dead ends: 2273 [2021-12-16 01:08:32,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:32,306 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 191 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:32,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 225 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2021-12-16 01:08:32,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2272. [2021-12-16 01:08:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.141347424042272) internal successors, (2592), 2271 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2592 transitions. [2021-12-16 01:08:32,381 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2592 transitions. Word has length 271 [2021-12-16 01:08:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:32,382 INFO L470 AbstractCegarLoop]: Abstraction has 2272 states and 2592 transitions. [2021-12-16 01:08:32,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2592 transitions. [2021-12-16 01:08:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2021-12-16 01:08:32,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:32,384 INFO L514 BasicCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:32,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-16 01:08:32,384 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:32,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash 550996924, now seen corresponding path program 1 times [2021-12-16 01:08:32,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:32,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101026713] [2021-12-16 01:08:32,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:32,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-16 01:08:32,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:32,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101026713] [2021-12-16 01:08:32,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101026713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:32,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:32,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:32,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140617733] [2021-12-16 01:08:32,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:32,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:32,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:32,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:32,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:32,415 INFO L87 Difference]: Start difference. First operand 2272 states and 2592 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:32,452 INFO L93 Difference]: Finished difference Result 2676 states and 3041 transitions. [2021-12-16 01:08:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:32,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 273 [2021-12-16 01:08:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:32,454 INFO L225 Difference]: With dead ends: 2676 [2021-12-16 01:08:32,454 INFO L226 Difference]: Without dead ends: 809 [2021-12-16 01:08:32,455 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 [2021-12-16 01:08:32,455 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 28 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:32,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 302 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-12-16 01:08:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2021-12-16 01:08:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.103960396039604) internal successors, (892), 808 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 892 transitions. [2021-12-16 01:08:32,482 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 892 transitions. Word has length 273 [2021-12-16 01:08:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:32,482 INFO L470 AbstractCegarLoop]: Abstraction has 809 states and 892 transitions. [2021-12-16 01:08:32,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 892 transitions. [2021-12-16 01:08:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2021-12-16 01:08:32,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:32,484 INFO L514 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 01:08:32,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-16 01:08:32,484 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:32,484 INFO L85 PathProgramCache]: Analyzing trace with hash 249689584, now seen corresponding path program 1 times [2021-12-16 01:08:32,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:32,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457466447] [2021-12-16 01:08:32,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:32,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-12-16 01:08:32,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:32,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457466447] [2021-12-16 01:08:32,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457466447] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:32,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:32,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 01:08:32,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546141304] [2021-12-16 01:08:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:32,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:32,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:32,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:32,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 01:08:32,513 INFO L87 Difference]: Start difference. First operand 809 states and 892 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:32,540 INFO L93 Difference]: Finished difference Result 1090 states and 1202 transitions. [2021-12-16 01:08:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:32,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 290 [2021-12-16 01:08:32,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:32,541 INFO L225 Difference]: With dead ends: 1090 [2021-12-16 01:08:32,541 INFO L226 Difference]: Without dead ends: 0 [2021-12-16 01:08:32,542 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 [2021-12-16 01:08:32,542 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 3 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 283 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 [2021-12-16 01:08:32,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 283 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-16 01:08:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-16 01:08:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-16 01:08:32,542 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 290 [2021-12-16 01:08:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:32,543 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-16 01:08:32,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 01:08:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-16 01:08:32,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-16 01:08:32,545 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 01:08:32,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-16 01:08:32,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-16 01:08:52,774 WARN L227 SmtUtils]: Spent 16.25s on a formula simplification. DAG size of input: 226 DAG size of output: 226 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-16 01:09:20,837 INFO L858 garLoopResultBuilder]: For program point L597(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,837 INFO L858 garLoopResultBuilder]: For program point L564(lines 564 568) no Hoare annotation was computed. [2021-12-16 01:09:20,837 INFO L858 garLoopResultBuilder]: For program point L564-2(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,837 INFO L858 garLoopResultBuilder]: For program point L366(lines 298 396) no Hoare annotation was computed. [2021-12-16 01:09:20,838 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 238) no Hoare annotation was computed. [2021-12-16 01:09:20,838 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 110) no Hoare annotation was computed. [2021-12-16 01:09:20,838 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 77) no Hoare annotation was computed. [2021-12-16 01:09:20,838 INFO L858 garLoopResultBuilder]: For program point L598(lines 598 602) no Hoare annotation was computed. [2021-12-16 01:09:20,838 INFO L854 garLoopResultBuilder]: At program point L235(lines 230 257) the Hoare annotation is: (let ((.cse15 (not (= 0 ~c1_st~0))) (.cse0 (not (= 0 ~e_e~0))) (.cse1 (= ~data~0 (+ ~t_b~0 1))) (.cse2 (= ~c1_i~0 1)) (.cse3 (= 2 ~e_c~0)) (.cse4 (= ~c2_pc~0 1)) (.cse5 (not (= 1 ~e_wl~0))) (.cse6 (= 2 ~e_f~0)) (.cse7 (= ~c2_i~0 1)) (.cse8 (= ~wb_i~0 1)) (.cse10 (not (= 0 ~e_g~0))) (.cse9 (= ~processed~0 0)) (.cse12 (not (= 1 ~r_i~0))) (.cse13 (not (= 0 ~e_wl~0))) (.cse11 (= ~wb_pc~0 1)) (.cse22 (not (= 0 ~c2_st~0))) (.cse14 (= ~c1_pc~0 1)) (.cse16 (not (= 0 ~wl_st~0))) (.cse17 (not (= 0 ~wb_st~0))) (.cse18 (not (= 1 ~e_e~0))) (.cse19 (not (= 0 ~e_c~0))) (.cse20 (not (= 1 ~e_g~0))) (.cse21 (not (= 0 ~r_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~c2_st~0 0) .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse5 .cse6 .cse8 .cse7 .cse10 .cse12 .cse13 .cse16 (= ~wl_pc~0 0) .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ~wl_pc~0 2)) .cse16 .cse18 .cse19 .cse20) (and (= ~data~0 (+ ~t_b~0 2)) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse12 .cse13 .cse11 .cse22 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (= ~c1_st~0 0) .cse9 .cse12 .cse13 .cse11 .cse22 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2021-12-16 01:09:20,838 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 107) no Hoare annotation was computed. [2021-12-16 01:09:20,839 INFO L854 garLoopResultBuilder]: At program point L70(lines 65 135) the Hoare annotation is: (and (= ~wl_pc~0 2) (let ((.cse21 (+ ~t_b~0 2)) (.cse1 (+ ~t_b~0 1))) (let ((.cse0 (not (= 0 ~e_e~0))) (.cse2 (= ~c1_i~0 1)) (.cse3 (= 2 ~e_c~0)) (.cse4 (= ~c2_pc~0 1)) (.cse5 (not (= 1 ~e_wl~0))) (.cse6 (= ~c2_i~0 1)) (.cse7 (= ~wb_i~0 1)) (.cse8 (or (= ~c_t~0 .cse21) (= ~c_t~0 .cse1))) (.cse9 (not (= 0 ~e_g~0))) (.cse10 (= ~wb_pc~0 1)) (.cse11 (not (= 1 ~r_i~0))) (.cse12 (not (= 0 ~e_wl~0))) (.cse13 (= ~c1_pc~0 1)) (.cse14 (not (= 0 ~wl_st~0))) (.cse15 (or (= ~d~0 .cse21) (= ~d~0 .cse1))) (.cse16 (or (= ~c~0 .cse21) (= ~c~0 .cse1))) (.cse17 (not (= 0 ~wb_st~0))) (.cse18 (not (= 1 ~e_e~0))) (.cse19 (not (= 1 ~e_g~0))) (.cse20 (not (= 0 ~r_st~0)))) (or (and .cse0 (= ~data~0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 (= ~data~0 .cse21) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) (= 2 ~e_f~0)) [2021-12-16 01:09:20,839 INFO L858 garLoopResultBuilder]: For program point L434-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,839 INFO L858 garLoopResultBuilder]: For program point L534-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,839 INFO L858 garLoopResultBuilder]: For program point L336(lines 298 396) no Hoare annotation was computed. [2021-12-16 01:09:20,840 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 319) no Hoare annotation was computed. [2021-12-16 01:09:20,840 INFO L854 garLoopResultBuilder]: At program point L204-1(lines 185 225) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 1)) (.cse38 (+ ~t_b~0 2))) (let ((.cse30 (= ~data~0 .cse38)) (.cse35 (or (= ~c_t~0 .cse38) (= ~c_t~0 .cse37))) (.cse28 (not (= 0 ~c1_st~0))) (.cse19 (not (= 0 ~wb_st~0))) (.cse36 (= ~data~0 .cse37)) (.cse31 (= ~c2_pc~0 1)) (.cse22 (= ~wb_pc~0 1)) (.cse27 (= ~c1_pc~0 1)) (.cse32 (not (= 0 ~r_st~0))) (.cse8 (not (= 0 ~e_wl~0))) (.cse10 (= ~wl_pc~0 0)) (.cse14 (= ~data~0 0)) (.cse26 (= ~wb_st~0 0)) (.cse15 (= ~d~0 0)) (.cse3 (= 2 ~e_f~0)) (.cse4 (= ~wb_i~0 1)) (.cse6 (not (= 0 ~e_g~0))) (.cse16 (= ~c1_st~0 0)) (.cse17 (= ~c1_pc~0 0)) (.cse33 (not (= ~wl_pc~0 2))) (.cse18 (= ~r_st~0 ~e_f~0)) (.cse29 (= ~wb_pc~0 0)) (.cse12 (not (= 0 ~e_c~0))) (.cse34 (not (= 0 ~wl_pc~0))) (.cse0 (not (= 0 ~e_e~0))) (.cse1 (= ~c1_i~0 1)) (.cse20 (= 2 ~e_c~0)) (.cse2 (not (= 1 ~e_wl~0))) (.cse5 (= ~c2_i~0 1)) (.cse21 (= ~processed~0 0)) (.cse7 (not (= 1 ~r_i~0))) (.cse23 (not (= 0 ~c2_st~0))) (.cse9 (not (= 0 ~wl_st~0))) (.cse24 (= ~t_b~0 0)) (.cse11 (not (= 1 ~e_e~0))) (.cse25 (= ~r_i~0 ~c_req_up~0)) (.cse13 (not (= 1 ~e_g~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse3 .cse4 .cse16 .cse6 .cse8 .cse17 .cse18 .cse19 .cse12 .cse0 .cse1 .cse20 .cse2 .cse5 .cse21 .cse7 .cse22 .cse23 .cse10 .cse24 .cse25 .cse11 .cse13) (and .cse14 .cse26 .cse3 .cse15 .cse4 .cse6 .cse8 .cse27 .cse28 .cse18 .cse29 .cse12 .cse0 .cse1 .cse20 .cse2 .cse5 .cse21 .cse7 .cse23 .cse10 .cse24 .cse25 .cse11 .cse13) (and .cse30 .cse0 .cse1 .cse20 .cse31 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse7 .cse8 .cse23 .cse27 .cse28 .cse9 .cse11 .cse12 .cse13 .cse32) (and .cse14 .cse15 .cse3 .cse4 .cse6 .cse16 .cse17 .cse33 .cse18 .cse19 .cse34 .cse12 .cse0 .cse1 .cse20 .cse2 .cse5 .cse21 .cse22 .cse7 .cse23 .cse9 .cse24 .cse11 .cse25 .cse13) (and .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse27 .cse33 .cse9 .cse11 .cse12 .cse13) (and .cse14 .cse26 .cse15 .cse3 .cse4 .cse6 .cse27 .cse28 .cse33 .cse18 .cse29 .cse12 .cse34 .cse0 .cse1 .cse20 .cse2 .cse5 .cse21 .cse7 .cse23 .cse9 .cse24 .cse11 .cse25 .cse13) (and .cse14 .cse3 .cse15 .cse4 .cse6 .cse8 .cse27 .cse28 .cse18 .cse19 .cse12 .cse0 .cse1 .cse20 .cse2 .cse5 .cse21 .cse22 .cse7 .cse23 .cse10 .cse24 .cse25 .cse11 .cse13) (and .cse30 .cse0 .cse1 .cse20 .cse31 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse22 .cse23 .cse27 .cse28 .cse9 .cse19 .cse11 .cse12 .cse13 .cse32) (and .cse0 .cse1 .cse20 .cse31 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse22 .cse23 .cse27 .cse28 .cse9 .cse19 .cse25 .cse11 .cse12 .cse13 .cse32) (and .cse14 .cse15 .cse3 .cse4 .cse6 .cse27 .cse28 .cse33 .cse18 .cse19 .cse12 .cse34 .cse0 .cse1 .cse20 .cse2 .cse5 .cse21 .cse7 .cse22 .cse23 .cse9 .cse24 .cse11 .cse25 .cse13) (and .cse0 .cse36 .cse1 .cse20 .cse31 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse22 .cse23 .cse27 .cse28 .cse9 .cse19 .cse11 .cse12 .cse13 .cse32) (and .cse0 .cse36 .cse1 .cse20 .cse31 .cse26 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse16 .cse7 .cse8 .cse22 .cse23 .cse27 .cse9 .cse11 .cse12 .cse13 .cse32) (and .cse14 .cse26 .cse3 .cse15 .cse4 .cse16 .cse6 .cse8 .cse17 .cse18 .cse29 .cse12 .cse0 .cse1 .cse20 .cse2 .cse5 .cse21 .cse7 .cse23 .cse10 .cse24 .cse25 .cse11 .cse13) (and .cse14 .cse26 .cse15 .cse3 .cse4 .cse6 .cse16 .cse17 .cse33 .cse18 .cse29 .cse12 .cse34 .cse0 .cse1 .cse20 .cse2 .cse5 .cse21 .cse7 .cse23 .cse9 .cse24 .cse11 .cse25 .cse13)))) [2021-12-16 01:09:20,840 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2021-12-16 01:09:20,840 INFO L858 garLoopResultBuilder]: For program point L667(lines 667 683) no Hoare annotation was computed. [2021-12-16 01:09:20,840 INFO L858 garLoopResultBuilder]: For program point L634-1(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,840 INFO L858 garLoopResultBuilder]: For program point L370(lines 370 377) no Hoare annotation was computed. [2021-12-16 01:09:20,840 INFO L858 garLoopResultBuilder]: For program point L569-1(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,841 INFO L858 garLoopResultBuilder]: For program point L470(lines 470 474) no Hoare annotation was computed. [2021-12-16 01:09:20,841 INFO L854 garLoopResultBuilder]: At program point L272(lines 265 282) the Hoare annotation is: (let ((.cse24 (+ ~t_b~0 2)) (.cse1 (+ ~t_b~0 1))) (let ((.cse3 (= 2 ~e_c~0)) (.cse7 (or (= ~c_t~0 .cse24) (= ~c_t~0 .cse1))) (.cse14 (not (= 0 ~c2_st~0))) (.cse16 (not (= 0 ~c1_st~0))) (.cse17 (or (= ~d~0 .cse24) (= ~d~0 .cse1))) (.cse19 (or (= ~c~0 .cse24) (= ~c~0 .cse1))) (.cse20 (not (= 0 ~wb_st~0))) (.cse0 (not (= 0 ~e_e~0))) (.cse2 (= ~c1_i~0 1)) (.cse4 (= ~c2_pc~0 1)) (.cse5 (not (= 1 ~e_wl~0))) (.cse6 (= 2 ~e_f~0)) (.cse9 (= ~c2_i~0 1)) (.cse8 (= ~wb_i~0 1)) (.cse10 (not (= 0 ~e_g~0))) (.cse12 (not (= 0 ~e_wl~0))) (.cse13 (not (= 1 ~r_i~0))) (.cse11 (= ~wb_pc~0 1)) (.cse15 (= ~c1_pc~0 1)) (.cse18 (not (= 0 ~wl_st~0))) (.cse21 (not (= 0 ~e_c~0))) (.cse22 (not (= 1 ~e_g~0))) (.cse23 (not (= 0 ~r_st~0)))) (or (and .cse0 (= ~data~0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse2 .cse5 .cse6 .cse9 .cse8 .cse10 .cse12 .cse13 .cse18 (= ~wl_pc~0 0) .cse21 .cse22) (and (= ~data~0 .cse24) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse9 .cse8 .cse10 .cse12 .cse13 .cse11 .cse15 (not (= ~wl_pc~0 2)) .cse18 .cse21 .cse22 .cse23)))) [2021-12-16 01:09:20,841 INFO L858 garLoopResultBuilder]: For program point L306(lines 306 318) no Hoare annotation was computed. [2021-12-16 01:09:20,841 INFO L858 garLoopResultBuilder]: For program point L273(lines 265 282) no Hoare annotation was computed. [2021-12-16 01:09:20,841 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2021-12-16 01:09:20,842 INFO L858 garLoopResultBuilder]: For program point L207-1(lines 207 215) no Hoare annotation was computed. [2021-12-16 01:09:20,842 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 149) no Hoare annotation was computed. [2021-12-16 01:09:20,842 INFO L858 garLoopResultBuilder]: For program point L670(lines 670 682) no Hoare annotation was computed. [2021-12-16 01:09:20,842 INFO L858 garLoopResultBuilder]: For program point L505(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,842 INFO L858 garLoopResultBuilder]: For program point L439-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,842 INFO L858 garLoopResultBuilder]: For program point L340(lines 340 347) no Hoare annotation was computed. [2021-12-16 01:09:20,842 INFO L858 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2021-12-16 01:09:20,843 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2021-12-16 01:09:20,843 INFO L858 garLoopResultBuilder]: For program point L506(lines 506 510) no Hoare annotation was computed. [2021-12-16 01:09:20,843 INFO L854 garLoopResultBuilder]: At program point L242-1(lines 230 257) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 2))) (let ((.cse38 (= ~c_t~0 .cse37)) (.cse39 (+ ~t_b~0 1))) (let ((.cse18 (not (= ~wl_pc~0 2))) (.cse22 (not (= 0 ~wl_pc~0))) (.cse34 (= ~data~0 .cse39)) (.cse35 (or .cse38 (= ~c_t~0 .cse39))) (.cse31 (= ~c2_st~0 0)) (.cse32 (= ~c2_pc~0 0)) (.cse33 (= ~wb_pc~0 1)) (.cse29 (= ~c1_pc~0 1)) (.cse30 (not (= 0 ~c1_st~0))) (.cse9 (not (= 0 ~wl_st~0))) (.cse36 (not (= 0 ~r_st~0))) (.cse14 (= ~data~0 0)) (.cse15 (= ~d~0 0)) (.cse3 (= 2 ~e_f~0)) (.cse4 (= ~wb_i~0 1)) (.cse16 (= ~c1_st~0 0)) (.cse6 (not (= 0 ~e_g~0))) (.cse8 (not (= 0 ~e_wl~0))) (.cse17 (= ~c1_pc~0 0)) (.cse19 (= ~r_st~0 ~e_f~0)) (.cse20 (not (= 0 ~wb_st~0))) (.cse21 (= ~wb_pc~0 0)) (.cse12 (not (= 0 ~e_c~0))) (.cse0 (not (= 0 ~e_e~0))) (.cse1 (= ~c1_i~0 1)) (.cse23 (= 2 ~e_c~0)) (.cse24 (= ~c2_pc~0 1)) (.cse2 (not (= 1 ~e_wl~0))) (.cse5 (= ~c2_i~0 1)) (.cse25 (= ~processed~0 0)) (.cse7 (not (= 1 ~r_i~0))) (.cse26 (not (= 0 ~c2_st~0))) (.cse10 (= ~wl_pc~0 0)) (.cse27 (= ~t_b~0 0)) (.cse28 (= ~r_i~0 ~c_req_up~0)) (.cse11 (not (= 1 ~e_e~0))) (.cse13 (not (= 1 ~e_g~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse3 .cse4 .cse16 .cse6 .cse17 .cse18 .cse19 .cse20 .cse21 .cse12 .cse22 .cse0 .cse1 .cse23 .cse24 .cse2 .cse5 .cse25 .cse7 .cse26 .cse9 .cse27 .cse11 .cse28 .cse13) (and .cse14 .cse15 .cse3 .cse4 .cse6 .cse29 .cse30 .cse18 .cse19 .cse31 .cse20 .cse21 .cse32 .cse12 .cse22 .cse0 .cse1 .cse23 .cse2 .cse5 .cse25 .cse7 .cse9 .cse27 .cse11 .cse28 .cse13) (and .cse14 .cse15 .cse3 .cse4 .cse16 .cse6 .cse8 .cse17 .cse19 .cse31 .cse20 .cse21 .cse32 .cse12 .cse0 .cse1 .cse23 .cse2 .cse5 .cse25 .cse7 .cse10 .cse27 .cse28 .cse11 .cse13) (and .cse14 .cse15 .cse3 .cse4 .cse6 .cse29 .cse30 .cse18 .cse19 .cse20 .cse21 .cse12 .cse22 .cse0 .cse1 .cse23 .cse24 .cse2 .cse5 .cse25 .cse7 .cse26 .cse9 .cse27 .cse11 .cse28 .cse13) (and .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse33 .cse7 .cse8 .cse29 .cse18 .cse9 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse3 .cse4 .cse16 .cse6 .cse17 .cse18 .cse19 .cse31 .cse20 .cse21 .cse32 .cse12 .cse22 .cse0 .cse1 .cse23 .cse2 .cse5 .cse25 .cse7 .cse9 .cse27 .cse11 .cse28 .cse13) (and .cse14 .cse15 .cse3 .cse4 .cse6 .cse8 .cse30 .cse29 .cse19 .cse20 .cse21 .cse12 .cse0 .cse1 .cse23 .cse24 .cse2 .cse5 .cse25 .cse7 .cse26 .cse10 .cse27 .cse28 .cse11 .cse13) (and .cse0 .cse34 .cse1 .cse23 .cse24 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse16 .cse33 .cse7 .cse8 .cse26 .cse29 .cse9 .cse20 .cse11 .cse12 .cse13 .cse36) (and .cse0 .cse34 .cse1 .cse23 .cse24 .cse2 .cse3 .cse4 .cse5 .cse35 .cse6 .cse7 .cse8 .cse33 .cse29 .cse30 .cse9 .cse31 .cse20 .cse11 .cse12 .cse13 .cse36) (and .cse14 .cse15 .cse3 .cse4 .cse6 .cse8 .cse30 .cse29 .cse19 .cse31 .cse20 .cse21 .cse32 .cse12 .cse0 .cse1 .cse23 .cse2 .cse5 .cse25 .cse7 .cse10 .cse27 .cse28 .cse11 .cse13) (and (= ~data~0 .cse37) .cse0 .cse1 .cse23 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse26 .cse29 .cse30 .cse9 .cse38 .cse20 .cse11 .cse12 .cse13 .cse36) (and .cse14 .cse15 .cse3 .cse4 .cse16 .cse6 .cse8 .cse17 .cse19 .cse20 .cse21 .cse12 .cse0 .cse1 .cse23 .cse24 .cse2 .cse5 .cse25 .cse7 .cse26 .cse10 .cse27 .cse28 .cse11 .cse13))))) [2021-12-16 01:09:20,844 INFO L854 garLoopResultBuilder]: At program point L176(lines 137 181) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 2)) (.cse38 (+ ~t_b~0 1))) (let ((.cse27 (or (= ~c_t~0 .cse37) (= ~c_t~0 .cse38))) (.cse33 (= ~data~0 .cse38)) (.cse30 (not (= 0 ~wb_st~0))) (.cse21 (= ~wl_pc~0 0)) (.cse0 (= ~data~0 0)) (.cse2 (= ~d~0 0)) (.cse32 (not (= ~wl_pc~0 2))) (.cse9 (= ~r_st~0 ~e_f~0)) (.cse34 (= ~c2_st~0 0)) (.cse10 (= ~wb_pc~0 0)) (.cse35 (= ~c2_pc~0 0)) (.cse36 (not (= 0 ~wl_pc~0))) (.cse22 (= ~t_b~0 0)) (.cse23 (= ~r_i~0 ~c_req_up~0)) (.cse26 (= ~data~0 .cse37)) (.cse12 (not (= 0 ~e_e~0))) (.cse13 (= ~c1_i~0 1)) (.cse14 (= 2 ~e_c~0)) (.cse15 (= ~c2_pc~0 1)) (.cse1 (= ~wb_st~0 0)) (.cse16 (not (= 1 ~e_wl~0))) (.cse3 (= 2 ~e_f~0)) (.cse17 (= ~c2_i~0 1)) (.cse4 (= ~wb_i~0 1)) (.cse5 (not (= 0 ~e_g~0))) (.cse18 (= ~processed~0 0)) (.cse19 (not (= 1 ~r_i~0))) (.cse6 (not (= 0 ~e_wl~0))) (.cse28 (= ~wb_pc~0 1)) (.cse20 (not (= 0 ~c2_st~0))) (.cse8 (= ~c1_pc~0 1)) (.cse7 (not (= 0 ~c1_st~0))) (.cse29 (not (= 0 ~wl_st~0))) (.cse24 (not (= 1 ~e_e~0))) (.cse11 (not (= 0 ~e_c~0))) (.cse25 (not (= 1 ~e_g~0))) (.cse31 (not (= 0 ~r_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse17 .cse4 .cse27 .cse5 .cse28 .cse19 .cse6 .cse20 .cse8 .cse7 .cse29 .cse30 .cse24 .cse11 .cse25 .cse31) (and .cse12 .cse13 .cse16 .cse3 .cse4 .cse17 .cse5 .cse19 .cse6 .cse29 .cse21 .cse24 .cse11 .cse25) (and .cse12 .cse13 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse28 .cse19 .cse6 .cse8 .cse32 .cse29 .cse24 .cse11 .cse25) (and .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse3 .cse17 .cse4 .cse27 .cse5 .cse28 .cse19 .cse6 .cse20 .cse8 .cse7 .cse29 .cse30 .cse24 .cse11 .cse25 .cse31) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse30 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse30 .cse35 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse28 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse32 .cse9 .cse30 .cse11 .cse36 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse29 .cse22 .cse24 .cse23 .cse25) (and .cse12 .cse33 .cse13 .cse14 .cse15 .cse1 .cse16 .cse3 .cse17 .cse4 .cse5 .cse18 .cse28 .cse19 .cse6 .cse8 .cse7 .cse29 .cse34 .cse24 .cse11 .cse25 .cse31) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse32 .cse9 .cse34 .cse30 .cse35 .cse11 .cse36 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse22 .cse24 .cse23 .cse25) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse19 .cse28 .cse20 .cse8 .cse7 .cse29 .cse30 .cse23 .cse24 .cse11 .cse25 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse32 .cse9 .cse10 .cse11 .cse36 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse22 .cse24 .cse23 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse34 .cse10 .cse35 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse32 .cse9 .cse34 .cse10 .cse35 .cse11 .cse36 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse29 .cse22 .cse24 .cse23 .cse25) (and .cse26 .cse12 .cse13 .cse14 .cse15 .cse1 .cse16 .cse3 .cse17 .cse4 .cse5 .cse18 .cse19 .cse6 .cse28 .cse20 .cse8 .cse7 .cse29 .cse24 .cse11 .cse25 .cse31)))) [2021-12-16 01:09:20,844 INFO L858 garLoopResultBuilder]: For program point L639-1(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,844 INFO L858 garLoopResultBuilder]: For program point L408(lines 408 418) no Hoare annotation was computed. [2021-12-16 01:09:20,844 INFO L858 garLoopResultBuilder]: For program point L408-2(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,844 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 317) no Hoare annotation was computed. [2021-12-16 01:09:20,844 INFO L858 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2021-12-16 01:09:20,844 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 148) no Hoare annotation was computed. [2021-12-16 01:09:20,845 INFO L858 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2021-12-16 01:09:20,845 INFO L858 garLoopResultBuilder]: For program point L607(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,845 INFO L858 garLoopResultBuilder]: For program point L574-1(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,845 INFO L858 garLoopResultBuilder]: For program point L409(lines 409 414) no Hoare annotation was computed. [2021-12-16 01:09:20,845 INFO L858 garLoopResultBuilder]: For program point L409-2(lines 409 414) no Hoare annotation was computed. [2021-12-16 01:09:20,845 INFO L854 garLoopResultBuilder]: At program point L145(lines 140 180) the Hoare annotation is: (let ((.cse23 (+ ~t_b~0 1))) (let ((.cse16 (= ~processed~0 0)) (.cse0 (not (= 0 ~e_e~0))) (.cse13 (= ~data~0 .cse23)) (.cse1 (= ~c1_i~0 1)) (.cse14 (= 2 ~e_c~0)) (.cse15 (= ~c2_pc~0 1)) (.cse2 (not (= 1 ~e_wl~0))) (.cse3 (= 2 ~e_f~0)) (.cse4 (= ~wb_i~0 1)) (.cse5 (= ~c2_i~0 1)) (.cse6 (not (= 0 ~e_g~0))) (.cse7 (not (= 1 ~r_i~0))) (.cse8 (not (= 0 ~e_wl~0))) (.cse17 (= ~wb_pc~0 1)) (.cse18 (not (= 0 ~c2_st~0))) (.cse19 (= ~c1_pc~0 1)) (.cse20 (not (= 0 ~c1_st~0))) (.cse9 (not (= 0 ~wl_st~0))) (.cse22 (not (= 0 ~wb_st~0))) (.cse10 (not (= 1 ~e_e~0))) (.cse11 (not (= 0 ~e_c~0))) (.cse12 (not (= 1 ~e_g~0))) (.cse21 (not (= 0 ~r_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~wl_pc~0 0) .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse14 .cse15 (= ~wb_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse17 .cse7 .cse8 .cse18 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse17 .cse20 .cse19 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse9 (= ~c2_st~0 0) .cse22 .cse10 .cse11 .cse12 .cse21 (= ~data~0 ~t_b~0)) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse19 (not (= ~wl_pc~0 2)) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 (or (= ~c_t~0 (+ ~t_b~0 2)) (= ~c_t~0 .cse23)) .cse6 .cse7 .cse8 .cse17 .cse18 .cse19 .cse20 .cse9 .cse22 .cse10 .cse11 .cse12 .cse21)))) [2021-12-16 01:09:20,846 INFO L854 garLoopResultBuilder]: At program point L79(lines 65 135) the Hoare annotation is: (let ((.cse25 (= ~c2_st~0 0)) (.cse26 (= ~c2_pc~0 0)) (.cse6 (= ~c1_pc~0 1)) (.cse7 (not (= 0 ~c1_st~0))) (.cse27 (not (= 0 ~wb_st~0))) (.cse28 (= ~wb_pc~0 1)) (.cse0 (= ~data~0 0)) (.cse1 (= ~wb_st~0 0)) (.cse2 (= ~d~0 0)) (.cse3 (= 2 ~e_f~0)) (.cse4 (= ~wb_i~0 1)) (.cse29 (= ~c1_st~0 0)) (.cse5 (not (= 0 ~e_g~0))) (.cse30 (= ~c1_pc~0 0)) (.cse8 (not (= ~wl_pc~0 2))) (.cse9 (= ~r_st~0 ~e_f~0)) (.cse10 (= ~wb_pc~0 0)) (.cse11 (not (= 0 ~e_e~0))) (.cse12 (= ~c1_i~0 1)) (.cse13 (= 2 ~e_c~0)) (.cse14 (= ~c2_pc~0 1)) (.cse15 (not (= 1 ~e_wl~0))) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~processed~0 0)) (.cse18 (not (= 1 ~r_i~0))) (.cse19 (not (= 0 ~c2_st~0))) (.cse20 (not (= 0 ~wl_st~0))) (.cse21 (= ~t_b~0 0)) (.cse22 (not (= 1 ~e_e~0))) (.cse23 (= ~r_i~0 ~c_req_up~0)) (.cse24 (not (= 1 ~e_g~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse27 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse2 .cse3 .cse4 .cse29 .cse5 .cse30 .cse8 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse2 .cse3 .cse4 .cse29 .cse5 .cse30 .cse8 .cse9 .cse25 .cse27 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse30 .cse8 .cse9 .cse25 .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse29 .cse5 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) [2021-12-16 01:09:20,846 INFO L858 garLoopResultBuilder]: For program point L608(lines 608 612) no Hoare annotation was computed. [2021-12-16 01:09:20,846 INFO L854 garLoopResultBuilder]: At program point L476(lines 469 486) the Hoare annotation is: (let ((.cse0 (= ~c1_i~0 1)) (.cse1 (= ~e_e~0 ~e_f~0)) (.cse2 (= 2 ~e_c~0)) (.cse3 (= ~wb_st~0 0)) (.cse4 (= ~wb_i~0 1)) (.cse5 (= ~c2_i~0 1)) (.cse6 (= ~c1_st~0 0)) (.cse7 (not (= 1 ~r_i~0))) (.cse8 (= ~e_wl~0 ~e_c~0)) (.cse9 (= ~e_g~0 ~e_f~0)) (.cse10 (= ~c2_st~0 0)) (.cse11 (= ~wl_pc~0 0)) (.cse12 (= ~r_i~0 ~c_req_up~0)) (.cse13 (= ~e_e~0 ~e_c~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ~wl_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 (= ~data~0 0) .cse3 (= ~d~0 0) .cse4 .cse5 .cse6 (= ~processed~0 0) .cse7 (= ~c1_pc~0 0) .cse8 (= ~r_st~0 ~e_f~0) .cse9 .cse10 .cse11 (= ~wb_pc~0 0) (= ~t_b~0 0) (= ~c2_pc~0 0) .cse12 .cse13))) [2021-12-16 01:09:20,846 INFO L858 garLoopResultBuilder]: For program point L477(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,846 INFO L858 garLoopResultBuilder]: For program point L444-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,847 INFO L858 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2021-12-16 01:09:20,847 INFO L858 garLoopResultBuilder]: For program point L312-1(lines 298 396) no Hoare annotation was computed. [2021-12-16 01:09:20,847 INFO L858 garLoopResultBuilder]: For program point L676(lines 676 680) no Hoare annotation was computed. [2021-12-16 01:09:20,847 INFO L858 garLoopResultBuilder]: For program point L676-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,847 INFO L858 garLoopResultBuilder]: For program point L478(lines 478 482) no Hoare annotation was computed. [2021-12-16 01:09:20,847 INFO L858 garLoopResultBuilder]: For program point L644-1(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,847 INFO L858 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2021-12-16 01:09:20,848 INFO L858 garLoopResultBuilder]: For program point L579-1(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,848 INFO L854 garLoopResultBuilder]: At program point L381(lines 298 396) the Hoare annotation is: (let ((.cse42 (+ ~t_b~0 2)) (.cse43 (+ ~t_b~0 1)) (.cse40 (= ~wl_pc~0 2))) (let ((.cse33 (= ~c1_pc~0 0)) (.cse34 (not .cse40)) (.cse37 (not (= 0 ~wl_pc~0))) (.cse38 (= ~data~0 .cse43)) (.cse32 (= ~c1_st~0 0)) (.cse28 (or (= ~c_t~0 .cse42) (= ~c_t~0 .cse43))) (.cse39 (or (= ~c~0 .cse42) (= ~c~0 .cse43))) (.cse30 (not (= 0 ~wb_st~0))) (.cse0 (= ~data~0 0)) (.cse2 (= ~d~0 0)) (.cse9 (= ~r_st~0 ~e_f~0)) (.cse35 (= ~c2_st~0 0)) (.cse10 (= ~wb_pc~0 0)) (.cse36 (= ~c2_pc~0 0)) (.cse21 (= ~wl_pc~0 0)) (.cse22 (= ~t_b~0 0)) (.cse23 (= ~r_i~0 ~c_req_up~0)) (.cse27 (= ~data~0 .cse42)) (.cse12 (not (= 0 ~e_e~0))) (.cse13 (= ~c1_i~0 1)) (.cse14 (= 2 ~e_c~0)) (.cse15 (= ~c2_pc~0 1)) (.cse1 (= ~wb_st~0 0)) (.cse16 (not (= 1 ~e_wl~0))) (.cse3 (= 2 ~e_f~0)) (.cse17 (= ~c2_i~0 1)) (.cse4 (= ~wb_i~0 1)) (.cse5 (not (= 0 ~e_g~0))) (.cse18 (= ~processed~0 0)) (.cse19 (not (= 1 ~r_i~0))) (.cse6 (not (= 0 ~e_wl~0))) (.cse29 (= ~wb_pc~0 1)) (.cse20 (not (= 0 ~c2_st~0))) (.cse8 (= ~c1_pc~0 1)) (.cse7 (not (= 0 ~c1_st~0))) (.cse26 (not (= 0 ~wl_st~0))) (.cse24 (not (= 1 ~e_e~0))) (.cse11 (not (= 0 ~e_c~0))) (.cse25 (not (= 1 ~e_g~0))) (.cse31 (not (= 0 ~r_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse12 .cse13 .cse16 .cse3 .cse4 .cse17 .cse5 .cse19 .cse6 .cse26 .cse21 .cse24 .cse11 .cse25) (and .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse17 .cse4 .cse28 .cse5 .cse29 .cse19 .cse6 .cse20 .cse8 .cse7 .cse26 .cse30 .cse24 .cse11 .cse25 .cse31) (and .cse0 .cse2 .cse3 .cse4 .cse32 .cse5 .cse33 .cse34 .cse9 .cse35 .cse30 .cse36 .cse11 .cse37 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse12 .cse13 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse29 .cse19 .cse6 .cse8 .cse34 .cse26 .cse24 .cse11 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse32 .cse5 .cse6 .cse33 .cse9 .cse35 .cse10 .cse36 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse32 .cse5 .cse33 .cse34 .cse9 .cse10 .cse11 .cse37 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse12 .cse38 .cse13 .cse14 .cse15 .cse16 .cse3 .cse17 .cse4 .cse28 .cse5 .cse19 .cse6 .cse29 .cse8 .cse7 .cse26 .cse30 .cse24 .cse11 .cse25 .cse31) (and .cse12 .cse38 .cse13 .cse14 .cse15 .cse1 .cse16 .cse3 .cse17 .cse4 .cse5 .cse18 .cse29 .cse19 .cse6 .cse8 .cse7 .cse26 .cse35 .cse24 .cse11 .cse25 .cse31) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse32 .cse5 .cse6 .cse33 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse32 .cse5 .cse33 .cse34 .cse9 .cse30 .cse11 .cse37 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse19 .cse29 .cse20 .cse8 .cse7 .cse26 .cse30 .cse23 .cse24 .cse11 .cse25 .cse31) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse17 .cse4 .cse18 .cse5 .cse32 .cse29 .cse19 .cse6 .cse8 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse26 .cse35 .cse30 .cse24 .cse11 .cse25 .cse31 (= ~data~0 ~t_b~0)) (and .cse0 .cse2 .cse3 .cse4 .cse32 .cse5 .cse6 .cse33 .cse9 .cse30 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse12 .cse38 .cse13 .cse14 .cse15 .cse16 .cse3 .cse28 .cse17 .cse4 .cse5 .cse19 .cse6 .cse29 .cse20 .cse8 .cse7 .cse26 .cse39 .cse30 .cse24 .cse11 .cse25) (and .cse40 (let ((.cse41 (or (= ~d~0 .cse42) (= ~d~0 .cse43)))) (or (and .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse17 .cse4 .cse28 .cse5 .cse19 .cse6 .cse29 .cse20 .cse8 .cse7 .cse41 .cse39 .cse30 .cse24 .cse11 .cse25 .cse31) (and .cse12 .cse38 .cse13 .cse14 .cse15 .cse16 .cse3 .cse17 .cse4 .cse28 .cse5 .cse19 .cse6 .cse29 .cse20 .cse8 .cse7 .cse41 .cse39 .cse30 .cse24 .cse11 .cse25 .cse31)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse32 .cse5 .cse33 .cse34 .cse9 .cse35 .cse10 .cse36 .cse11 .cse37 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse34 .cse9 .cse35 .cse10 .cse36 .cse11 .cse37 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse32 .cse5 .cse6 .cse33 .cse9 .cse35 .cse30 .cse36 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse12 .cse38 .cse13 .cse14 .cse15 .cse16 .cse3 .cse28 .cse17 .cse4 .cse5 .cse19 .cse6 .cse29 .cse20 .cse8 .cse26 .cse30 .cse24 .cse11 .cse25 .cse31) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse34 .cse9 .cse30 .cse11 .cse37 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse35 .cse30 .cse36 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse34 .cse9 .cse30 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse34 .cse9 .cse35 .cse30 .cse36 .cse11 .cse37 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse34 .cse9 .cse10 .cse11 .cse37 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse12 .cse38 .cse13 .cse14 .cse15 .cse1 .cse16 .cse3 .cse17 .cse4 .cse5 .cse32 .cse18 .cse19 .cse6 .cse29 .cse20 .cse8 .cse26 .cse24 .cse11 .cse25 .cse31) (and .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse28 .cse17 .cse4 .cse5 .cse19 .cse6 .cse29 .cse20 .cse8 .cse7 .cse26 .cse39 .cse30 .cse24 .cse11 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse35 .cse10 .cse36 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse27 .cse12 .cse13 .cse14 .cse15 .cse1 .cse16 .cse3 .cse17 .cse4 .cse5 .cse18 .cse19 .cse6 .cse29 .cse20 .cse8 .cse7 .cse26 .cse24 .cse11 .cse25 .cse31)))) [2021-12-16 01:09:20,848 INFO L858 garLoopResultBuilder]: For program point L514-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,848 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,849 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-16 01:09:20,849 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 129) no Hoare annotation was computed. [2021-12-16 01:09:20,849 INFO L858 garLoopResultBuilder]: For program point L351(lines 298 396) no Hoare annotation was computed. [2021-12-16 01:09:20,849 INFO L858 garLoopResultBuilder]: For program point L186(lines 186 194) no Hoare annotation was computed. [2021-12-16 01:09:20,849 INFO L858 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2021-12-16 01:09:20,849 INFO L858 garLoopResultBuilder]: For program point L616(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,849 INFO L858 garLoopResultBuilder]: For program point L649-1(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,849 INFO L858 garLoopResultBuilder]: For program point L385(lines 385 392) no Hoare annotation was computed. [2021-12-16 01:09:20,850 INFO L854 garLoopResultBuilder]: At program point L286(lines 259 288) the Hoare annotation is: (let ((.cse27 (+ ~t_b~0 2)) (.cse28 (+ ~t_b~0 1))) (let ((.cse12 (= ~wl_pc~0 2)) (.cse18 (= ~data~0 .cse28)) (.cse26 (= ~data~0 .cse27)) (.cse0 (not (= 0 ~e_e~0))) (.cse1 (= ~c1_i~0 1)) (.cse19 (= 2 ~e_c~0)) (.cse2 (= ~c2_pc~0 1)) (.cse3 (not (= 1 ~e_wl~0))) (.cse4 (= 2 ~e_f~0)) (.cse20 (or (= ~c_t~0 .cse27) (= ~c_t~0 .cse28))) (.cse6 (= ~wb_i~0 1)) (.cse5 (= ~c2_i~0 1)) (.cse7 (not (= 0 ~e_g~0))) (.cse10 (= ~wb_pc~0 1)) (.cse8 (not (= 0 ~e_wl~0))) (.cse9 (not (= 1 ~r_i~0))) (.cse21 (not (= 0 ~c2_st~0))) (.cse11 (= ~c1_pc~0 1)) (.cse22 (not (= 0 ~c1_st~0))) (.cse13 (= ~r_st~0 ~e_f~0)) (.cse14 (not (= 0 ~wl_st~0))) (.cse23 (not (= 0 ~wb_st~0))) (.cse15 (not (= 1 ~e_e~0))) (.cse16 (not (= 0 ~e_c~0))) (.cse17 (not (= 1 ~e_g~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not .cse12) .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 (= ~wl_pc~0 0) .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse20 .cse6 .cse5 .cse7 .cse10 .cse8 .cse9 .cse21 .cse11 .cse22 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17) (and .cse12 (let ((.cse24 (or (= ~d~0 .cse27) (= ~d~0 .cse28))) (.cse25 (or (= ~c~0 .cse27) (= ~c~0 .cse28)))) (or (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse20 .cse6 .cse5 .cse7 .cse10 .cse8 .cse9 .cse21 .cse11 .cse22 .cse13 .cse24 .cse25 .cse23 .cse15 .cse16 .cse17) (and .cse26 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse20 .cse6 .cse5 .cse7 .cse10 .cse8 .cse9 .cse21 .cse11 .cse22 .cse13 .cse24 .cse25 .cse23 .cse15 .cse16 .cse17)))) (and .cse26 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse20 .cse6 .cse5 .cse7 .cse10 .cse8 .cse9 .cse21 .cse11 .cse22 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17)))) [2021-12-16 01:09:20,850 INFO L854 garLoopResultBuilder]: At program point L253(lines 227 258) the Hoare annotation is: (let ((.cse36 (+ ~t_b~0 2))) (let ((.cse37 (= ~c_t~0 .cse36)) (.cse38 (+ ~t_b~0 1))) (let ((.cse27 (= ~data~0 .cse38)) (.cse29 (or .cse37 (= ~c_t~0 .cse38))) (.cse9 (= ~c2_st~0 0)) (.cse11 (= ~c2_pc~0 0)) (.cse33 (not (= ~wl_pc~0 2))) (.cse34 (not (= 0 ~wl_pc~0))) (.cse30 (= ~c1_pc~0 1)) (.cse31 (not (= 0 ~c1_st~0))) (.cse26 (not (= 0 ~wl_st~0))) (.cse32 (not (= 0 ~r_st~0))) (.cse0 (= ~data~0 0)) (.cse1 (= ~d~0 0)) (.cse2 (= 2 ~e_f~0)) (.cse3 (= ~wb_i~0 1)) (.cse4 (= ~c1_st~0 0)) (.cse5 (not (= 0 ~e_g~0))) (.cse6 (not (= 0 ~e_wl~0))) (.cse7 (= ~c1_pc~0 0)) (.cse8 (= ~r_st~0 ~e_f~0)) (.cse10 (not (= 0 ~wb_st~0))) (.cse12 (not (= 0 ~e_c~0))) (.cse13 (not (= 0 ~e_e~0))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= 2 ~e_c~0)) (.cse28 (= ~c2_pc~0 1)) (.cse16 (not (= 1 ~e_wl~0))) (.cse17 (= ~c2_i~0 1)) (.cse18 (= ~processed~0 0)) (.cse19 (= ~wb_pc~0 1)) (.cse20 (not (= 1 ~r_i~0))) (.cse35 (not (= 0 ~c2_st~0))) (.cse21 (= ~wl_pc~0 0)) (.cse22 (= ~t_b~0 0)) (.cse23 (= ~r_i~0 ~c_req_up~0)) (.cse24 (not (= 1 ~e_e~0))) (.cse25 (not (= 1 ~e_g~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse13 .cse14 .cse16 .cse2 .cse3 .cse17 .cse5 .cse20 .cse6 .cse26 .cse21 .cse24 .cse12 .cse25) (and .cse13 .cse27 .cse14 .cse15 .cse28 .cse16 .cse2 .cse17 .cse3 .cse29 .cse5 .cse20 .cse6 .cse19 .cse30 .cse31 .cse26 .cse9 .cse10 .cse24 .cse12 .cse25 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse33 .cse8 .cse9 .cse10 .cse11 .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse13 .cse14 .cse28 .cse16 .cse2 .cse3 .cse17 .cse5 .cse19 .cse20 .cse6 .cse30 .cse33 .cse26 .cse24 .cse12 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse31 .cse30 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse35 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse13 .cse27 .cse14 .cse15 .cse28 .cse16 .cse2 .cse29 .cse17 .cse3 .cse5 .cse4 .cse20 .cse6 .cse19 .cse35 .cse30 .cse26 .cse10 .cse24 .cse12 .cse25 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse31 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse30 .cse31 .cse33 .cse8 .cse10 .cse12 .cse34 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse35 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse30 .cse31 .cse33 .cse8 .cse9 .cse10 .cse11 .cse12 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse33 .cse8 .cse10 .cse12 .cse34 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse35 .cse26 .cse22 .cse24 .cse23 .cse25) (and (= ~data~0 .cse36) .cse13 .cse14 .cse15 .cse28 .cse16 .cse2 .cse17 .cse3 .cse5 .cse19 .cse20 .cse6 .cse35 .cse30 .cse31 .cse26 .cse37 .cse10 .cse24 .cse12 .cse25 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse35 .cse21 .cse22 .cse23 .cse24 .cse25))))) [2021-12-16 01:09:20,850 INFO L858 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2021-12-16 01:09:20,850 INFO L858 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2021-12-16 01:09:20,850 INFO L858 garLoopResultBuilder]: For program point L584-1(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,851 INFO L858 garLoopResultBuilder]: For program point L419-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,851 INFO L854 garLoopResultBuilder]: At program point L221(lines 182 226) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 1)) (.cse38 (+ ~t_b~0 2))) (let ((.cse27 (= ~data~0 .cse38)) (.cse34 (= ~c1_pc~0 0)) (.cse21 (= ~wl_pc~0 0)) (.cse0 (= ~data~0 0)) (.cse2 (= ~d~0 0)) (.cse30 (not (= ~wl_pc~0 2))) (.cse9 (= ~r_st~0 ~e_f~0)) (.cse10 (= ~wb_pc~0 0)) (.cse32 (not (= 0 ~wl_pc~0))) (.cse22 (= ~t_b~0 0)) (.cse23 (= ~r_i~0 ~c_req_up~0)) (.cse35 (or (= ~c_t~0 .cse38) (= ~c_t~0 .cse37))) (.cse7 (not (= 0 ~c1_st~0))) (.cse31 (not (= 0 ~wb_st~0))) (.cse12 (not (= 0 ~e_e~0))) (.cse36 (= ~data~0 .cse37)) (.cse13 (= ~c1_i~0 1)) (.cse14 (= 2 ~e_c~0)) (.cse15 (= ~c2_pc~0 1)) (.cse1 (= ~wb_st~0 0)) (.cse16 (not (= 1 ~e_wl~0))) (.cse3 (= 2 ~e_f~0)) (.cse4 (= ~wb_i~0 1)) (.cse17 (= ~c2_i~0 1)) (.cse18 (= ~processed~0 0)) (.cse5 (not (= 0 ~e_g~0))) (.cse33 (= ~c1_st~0 0)) (.cse19 (not (= 1 ~r_i~0))) (.cse6 (not (= 0 ~e_wl~0))) (.cse28 (= ~wb_pc~0 1)) (.cse20 (not (= 0 ~c2_st~0))) (.cse8 (= ~c1_pc~0 1)) (.cse26 (not (= 0 ~wl_st~0))) (.cse24 (not (= 1 ~e_e~0))) (.cse11 (not (= 0 ~e_c~0))) (.cse25 (not (= 1 ~e_g~0))) (.cse29 (not (= 0 ~r_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse12 .cse13 .cse16 .cse3 .cse4 .cse17 .cse5 .cse19 .cse6 .cse26 .cse21 .cse24 .cse11 .cse25) (and .cse27 .cse12 .cse13 .cse14 .cse15 .cse1 .cse16 .cse3 .cse4 .cse17 .cse5 .cse18 .cse28 .cse19 .cse6 .cse20 .cse8 .cse7 .cse26 .cse24 .cse11 .cse25 .cse29) (and .cse12 .cse13 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse28 .cse19 .cse6 .cse8 .cse30 .cse26 .cse24 .cse11 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse31 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse30 .cse9 .cse31 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse33 .cse5 .cse34 .cse30 .cse9 .cse10 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse33 .cse5 .cse6 .cse34 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse35 .cse4 .cse17 .cse5 .cse19 .cse6 .cse28 .cse20 .cse8 .cse7 .cse26 .cse31 .cse24 .cse11 .cse25 .cse29) (and .cse0 .cse2 .cse3 .cse4 .cse33 .cse5 .cse34 .cse30 .cse9 .cse31 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse19 .cse28 .cse20 .cse8 .cse7 .cse26 .cse31 .cse23 .cse24 .cse11 .cse25 .cse29) (and .cse0 .cse2 .cse3 .cse4 .cse33 .cse5 .cse6 .cse34 .cse9 .cse31 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse30 .cse9 .cse10 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse22 .cse24 .cse23 .cse25) (and .cse12 .cse36 .cse13 .cse14 .cse15 .cse16 .cse3 .cse35 .cse4 .cse17 .cse5 .cse19 .cse6 .cse28 .cse20 .cse8 .cse7 .cse26 .cse31 .cse24 .cse11 .cse25 .cse29) (and .cse12 .cse36 .cse13 .cse14 .cse15 .cse1 .cse16 .cse3 .cse4 .cse17 .cse18 .cse5 .cse33 .cse19 .cse6 .cse28 .cse20 .cse8 .cse26 .cse24 .cse11 .cse25 .cse29)))) [2021-12-16 01:09:20,851 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 128) no Hoare annotation was computed. [2021-12-16 01:09:20,851 INFO L854 garLoopResultBuilder]: At program point L122-2(lines 65 135) the Hoare annotation is: (let ((.cse0 (= 2 ~e_f~0)) (.cse6 (not (= 0 ~e_e~0))) (.cse7 (= ~c1_i~0 1)) (.cse8 (= 2 ~e_c~0)) (.cse9 (= ~c2_pc~0 1)) (.cse10 (not (= 1 ~e_wl~0))) (.cse11 (= ~c2_i~0 1)) (.cse1 (= ~wb_i~0 1)) (.cse2 (not (= 0 ~e_g~0))) (.cse13 (= ~wb_pc~0 1)) (.cse12 (not (= 1 ~r_i~0))) (.cse3 (not (= 0 ~e_wl~0))) (.cse4 (= ~c1_pc~0 1)) (.cse14 (not (= 0 ~wl_st~0))) (.cse5 (not (= 0 ~wb_st~0))) (.cse15 (not (= 1 ~e_e~0))) (.cse16 (not (= 1 ~e_g~0)))) (or (and (= ~data~0 0) (= ~d~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 ~c1_st~0)) (= ~r_st~0 ~e_f~0) .cse5 (not (= 0 ~wl_pc~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~processed~0 0) .cse12 .cse13 (not (= 0 ~c2_st~0)) .cse14 (= ~t_b~0 0) (= ~r_i~0 ~c_req_up~0) .cse15 .cse16) (and (= ~wl_pc~0 2) .cse0 (let ((.cse17 (not (= 0 ~r_st~0)))) (or (and .cse6 (= ~data~0 (+ ~t_b~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse2 .cse13 .cse12 .cse3 .cse4 .cse14 .cse5 .cse15 .cse16 .cse17) (and (= ~data~0 (+ ~t_b~0 2)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse2 .cse13 .cse12 .cse3 .cse4 .cse14 .cse5 .cse15 .cse16 .cse17) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse2 .cse13 .cse12 .cse3 .cse4 .cse14 .cse5 .cse15 .cse16 .cse17 (= ~data~0 ~t_b~0))))))) [2021-12-16 01:09:20,851 INFO L858 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2021-12-16 01:09:20,852 INFO L854 garLoopResultBuilder]: At program point L717(lines 692 719) the Hoare annotation is: (= ~c2_i~0 1) [2021-12-16 01:09:20,852 INFO L858 garLoopResultBuilder]: For program point L552(lines 552 562) no Hoare annotation was computed. [2021-12-16 01:09:20,852 INFO L858 garLoopResultBuilder]: For program point L519-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,852 INFO L858 garLoopResultBuilder]: For program point L552-2(lines 552 562) no Hoare annotation was computed. [2021-12-16 01:09:20,852 INFO L858 garLoopResultBuilder]: For program point L321(lines 298 396) no Hoare annotation was computed. [2021-12-16 01:09:20,852 INFO L858 garLoopResultBuilder]: For program point L189(lines 189 193) no Hoare annotation was computed. [2021-12-16 01:09:20,852 INFO L854 garLoopResultBuilder]: At program point L24(lines 19 26) the Hoare annotation is: false [2021-12-16 01:09:20,852 INFO L858 garLoopResultBuilder]: For program point L553(lines 553 558) no Hoare annotation was computed. [2021-12-16 01:09:20,853 INFO L858 garLoopResultBuilder]: For program point L487(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,853 INFO L858 garLoopResultBuilder]: For program point L553-2(lines 553 558) no Hoare annotation was computed. [2021-12-16 01:09:20,853 INFO L858 garLoopResultBuilder]: For program point L454-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,853 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 362) no Hoare annotation was computed. [2021-12-16 01:09:20,853 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-16 01:09:20,853 INFO L854 garLoopResultBuilder]: At program point L190(lines 185 225) the Hoare annotation is: (let ((.cse23 (+ ~t_b~0 1))) (let ((.cse16 (= ~processed~0 0)) (.cse0 (not (= 0 ~e_e~0))) (.cse13 (= ~data~0 .cse23)) (.cse1 (= ~c1_i~0 1)) (.cse14 (= 2 ~e_c~0)) (.cse15 (= ~c2_pc~0 1)) (.cse2 (not (= 1 ~e_wl~0))) (.cse3 (= 2 ~e_f~0)) (.cse4 (= ~wb_i~0 1)) (.cse5 (= ~c2_i~0 1)) (.cse6 (not (= 0 ~e_g~0))) (.cse7 (not (= 1 ~r_i~0))) (.cse8 (not (= 0 ~e_wl~0))) (.cse17 (= ~wb_pc~0 1)) (.cse18 (not (= 0 ~c2_st~0))) (.cse19 (= ~c1_pc~0 1)) (.cse20 (not (= 0 ~c1_st~0))) (.cse9 (not (= 0 ~wl_st~0))) (.cse22 (not (= 0 ~wb_st~0))) (.cse10 (not (= 1 ~e_e~0))) (.cse11 (not (= 0 ~e_c~0))) (.cse12 (not (= 1 ~e_g~0))) (.cse21 (not (= 0 ~r_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~wl_pc~0 0) .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse14 .cse15 (= ~wb_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse17 .cse7 .cse8 .cse18 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse21) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 (= ~c1_st~0 0) .cse17 .cse7 .cse8 .cse18 .cse19 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse9 .cse22 .cse10 .cse11 .cse12 (= ~data~0 ~t_b~0) .cse21) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse19 (not (= ~wl_pc~0 2)) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 (or (= ~c_t~0 (+ ~t_b~0 2)) (= ~c_t~0 .cse23)) .cse6 .cse7 .cse8 .cse17 .cse18 .cse19 .cse20 .cse9 .cse22 .cse10 .cse11 .cse12 .cse21)))) [2021-12-16 01:09:20,853 INFO L854 garLoopResultBuilder]: At program point L686(lines 403 691) the Hoare annotation is: (= ~c2_i~0 1) [2021-12-16 01:09:20,854 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2021-12-16 01:09:20,854 INFO L858 garLoopResultBuilder]: For program point L654-1(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,854 INFO L854 garLoopResultBuilder]: At program point L159-1(lines 140 180) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 2)) (.cse38 (+ ~t_b~0 1))) (let ((.cse9 (or (= ~c_t~0 .cse37) (= ~c_t~0 .cse38))) (.cse33 (= ~data~0 .cse38)) (.cse23 (= ~wl_pc~0 0)) (.cse35 (= ~wb_pc~0 0)) (.cse24 (= ~data~0 0)) (.cse25 (= ~d~0 0)) (.cse32 (not (= ~wl_pc~0 2))) (.cse26 (= ~r_st~0 ~e_f~0)) (.cse27 (= ~c2_st~0 0)) (.cse18 (not (= 0 ~wb_st~0))) (.cse28 (= ~c2_pc~0 0)) (.cse36 (not (= 0 ~wl_pc~0))) (.cse30 (= ~t_b~0 0)) (.cse31 (= ~r_i~0 ~c_req_up~0)) (.cse0 (= ~data~0 .cse37)) (.cse1 (not (= 0 ~e_e~0))) (.cse2 (= ~c1_i~0 1)) (.cse3 (= 2 ~e_c~0)) (.cse4 (= ~c2_pc~0 1)) (.cse34 (= ~wb_st~0 0)) (.cse5 (not (= 1 ~e_wl~0))) (.cse6 (= 2 ~e_f~0)) (.cse7 (= ~c2_i~0 1)) (.cse8 (= ~wb_i~0 1)) (.cse10 (not (= 0 ~e_g~0))) (.cse29 (= ~processed~0 0)) (.cse12 (not (= 1 ~r_i~0))) (.cse13 (not (= 0 ~e_wl~0))) (.cse11 (= ~wb_pc~0 1)) (.cse14 (not (= 0 ~c2_st~0))) (.cse15 (= ~c1_pc~0 1)) (.cse16 (not (= 0 ~c1_st~0))) (.cse17 (not (= 0 ~wl_st~0))) (.cse19 (not (= 1 ~e_e~0))) (.cse20 (not (= 0 ~e_c~0))) (.cse21 (not (= 1 ~e_g~0))) (.cse22 (not (= 0 ~r_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse5 .cse6 .cse8 .cse7 .cse10 .cse12 .cse13 .cse17 .cse23 .cse19 .cse20 .cse21) (and .cse24 .cse25 .cse6 .cse8 .cse10 .cse13 .cse16 .cse26 .cse27 .cse18 .cse28 .cse20 .cse1 .cse2 .cse3 .cse5 .cse7 .cse29 .cse12 .cse11 .cse23 .cse30 .cse31 .cse19 .cse21) (and .cse24 .cse25 .cse6 .cse8 .cse10 .cse13 .cse16 .cse26 .cse18 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse29 .cse12 .cse11 .cse14 .cse23 .cse30 .cse31 .cse19 .cse21) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse32 .cse17 .cse19 .cse20 .cse21) (and .cse1 .cse33 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse24 .cse34 .cse6 .cse25 .cse8 .cse10 .cse13 .cse16 .cse26 .cse35 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse29 .cse12 .cse14 .cse23 .cse30 .cse31 .cse19 .cse21) (and .cse1 .cse33 .cse2 .cse3 .cse4 .cse34 .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse12 .cse13 .cse11 .cse15 .cse16 .cse17 .cse27 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse10 .cse13 .cse12 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse21 .cse22) (and .cse24 .cse34 .cse25 .cse6 .cse8 .cse10 .cse13 .cse16 .cse26 .cse27 .cse35 .cse28 .cse20 .cse1 .cse2 .cse3 .cse5 .cse7 .cse29 .cse12 .cse23 .cse30 .cse31 .cse19 .cse21) (and .cse24 .cse34 .cse6 .cse25 .cse8 .cse10 .cse16 .cse32 .cse26 .cse27 .cse35 .cse28 .cse20 .cse36 .cse1 .cse2 .cse3 .cse5 .cse7 .cse29 .cse12 .cse17 .cse30 .cse19 .cse31 .cse21) (and .cse24 .cse6 .cse25 .cse8 .cse10 .cse16 .cse32 .cse26 .cse18 .cse20 .cse36 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse29 .cse12 .cse11 .cse14 .cse17 .cse30 .cse19 .cse31 .cse21) (and .cse24 .cse34 .cse6 .cse25 .cse8 .cse10 .cse16 .cse32 .cse26 .cse35 .cse20 .cse36 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse29 .cse12 .cse14 .cse17 .cse30 .cse19 .cse31 .cse21) (and .cse24 .cse25 .cse6 .cse8 .cse10 .cse16 .cse32 .cse26 .cse27 .cse18 .cse28 .cse20 .cse36 .cse1 .cse2 .cse3 .cse5 .cse7 .cse29 .cse12 .cse11 .cse17 .cse30 .cse19 .cse31 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse34 .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse12 .cse13 .cse11 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22)))) [2021-12-16 01:09:20,854 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2021-12-16 01:09:20,854 INFO L858 garLoopResultBuilder]: For program point L93-1(lines 87 130) no Hoare annotation was computed. [2021-12-16 01:09:20,854 INFO L858 garLoopResultBuilder]: For program point L424-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,855 INFO L858 garLoopResultBuilder]: For program point L325(lines 325 332) no Hoare annotation was computed. [2021-12-16 01:09:20,855 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2021-12-16 01:09:20,855 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-16 01:09:20,855 INFO L858 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-12-16 01:09:20,855 INFO L858 garLoopResultBuilder]: For program point L524-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,855 INFO L858 garLoopResultBuilder]: For program point L459-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,855 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 170) no Hoare annotation was computed. [2021-12-16 01:09:20,856 INFO L858 garLoopResultBuilder]: For program point L162-1(lines 162 170) no Hoare annotation was computed. [2021-12-16 01:09:20,856 INFO L858 garLoopResultBuilder]: For program point L625(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,856 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2021-12-16 01:09:20,856 INFO L858 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2021-12-16 01:09:20,856 INFO L858 garLoopResultBuilder]: For program point L659-1(lines 545 685) no Hoare annotation was computed. [2021-12-16 01:09:20,856 INFO L854 garLoopResultBuilder]: At program point L131(lines 62 136) the Hoare annotation is: (let ((.cse34 (= ~wl_pc~0 2))) (let ((.cse33 (not (= 0 ~e_wl~0))) (.cse35 (not (= 0 ~r_st~0))) (.cse10 (not (= 0 ~wb_st~0))) (.cse20 (= ~wb_pc~0 1)) (.cse27 (= ~c1_st~0 0)) (.cse28 (= ~c1_pc~0 0)) (.cse29 (= ~c2_pc~0 1)) (.cse30 (not (= 0 ~c2_st~0))) (.cse0 (= ~data~0 0)) (.cse31 (= ~wb_st~0 0)) (.cse1 (= ~d~0 0)) (.cse2 (= 2 ~e_f~0)) (.cse3 (= ~wb_i~0 1)) (.cse4 (not (= 0 ~e_g~0))) (.cse5 (= ~c1_pc~0 1)) (.cse6 (not (= 0 ~c1_st~0))) (.cse7 (not .cse34)) (.cse8 (= ~r_st~0 ~e_f~0)) (.cse9 (= ~c2_st~0 0)) (.cse32 (= ~wb_pc~0 0)) (.cse11 (= ~c2_pc~0 0)) (.cse12 (not (= 0 ~e_c~0))) (.cse13 (not (= 0 ~wl_pc~0))) (.cse14 (not (= 0 ~e_e~0))) (.cse15 (= ~c1_i~0 1)) (.cse16 (= 2 ~e_c~0)) (.cse17 (not (= 1 ~e_wl~0))) (.cse18 (= ~c2_i~0 1)) (.cse19 (= ~processed~0 0)) (.cse21 (not (= 1 ~r_i~0))) (.cse22 (not (= 0 ~wl_st~0))) (.cse23 (= ~t_b~0 0)) (.cse24 (not (= 1 ~e_e~0))) (.cse25 (= ~r_i~0 ~c_req_up~0)) (.cse26 (not (= 1 ~e_g~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse4 .cse28 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse4 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse14 .cse15 .cse16 .cse29 .cse17 .cse2 .cse3 .cse18 .cse27 .cse19 .cse4 .cse20 .cse21 .cse33 .cse5 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse34 .cse22 .cse9 .cse10 .cse24 .cse26 (= ~data~0 ~t_b~0) .cse35) (and .cse14 .cse15 .cse16 .cse29 .cse17 .cse2 .cse3 .cse18 .cse4 .cse33 .cse21 .cse20 .cse30 .cse5 .cse6 .cse22 .cse10 .cse24 .cse25 .cse12 .cse26 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse20 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse31 .cse1 .cse2 .cse3 .cse27 .cse4 .cse28 .cse7 .cse8 .cse9 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse31 .cse1 .cse2 .cse3 .cse27 .cse4 .cse28 .cse7 .cse8 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse19 .cse21 .cse30 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2021-12-16 01:09:20,857 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-16 01:09:20,857 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 23) no Hoare annotation was computed. [2021-12-16 01:09:20,857 INFO L858 garLoopResultBuilder]: For program point L429-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,857 INFO L858 garLoopResultBuilder]: For program point L231(lines 231 239) no Hoare annotation was computed. [2021-12-16 01:09:20,857 INFO L858 garLoopResultBuilder]: For program point L198(line 198) no Hoare annotation was computed. [2021-12-16 01:09:20,857 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 78) no Hoare annotation was computed. [2021-12-16 01:09:20,858 INFO L858 garLoopResultBuilder]: For program point L496(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,858 INFO L858 garLoopResultBuilder]: For program point L529-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,858 INFO L854 garLoopResultBuilder]: At program point L397(lines 289 402) the Hoare annotation is: (let ((.cse18 (+ ~t_b~0 2)) (.cse25 (+ ~t_b~0 1))) (let ((.cse20 (or (= ~c_t~0 .cse18) (= ~c_t~0 .cse25))) (.cse10 (not (= 0 ~e_wl~0))) (.cse17 (not (= 0 ~r_st~0))) (.cse4 (= 2 ~e_f~0)) (.cse5 (= ~wb_i~0 1)) (.cse7 (not (= 0 ~e_g~0))) (.cse11 (= ~c1_pc~0 1)) (.cse22 (not (= 0 ~c1_st~0))) (.cse12 (not (= ~wl_pc~0 2))) (.cse23 (not (= 0 ~wb_st~0))) (.cse15 (not (= 0 ~e_c~0))) (.cse0 (not (= 0 ~e_e~0))) (.cse1 (= ~c1_i~0 1)) (.cse19 (= 2 ~e_c~0)) (.cse2 (= ~c2_pc~0 1)) (.cse3 (not (= 1 ~e_wl~0))) (.cse6 (= ~c2_i~0 1)) (.cse8 (= ~wb_pc~0 1)) (.cse9 (not (= 1 ~r_i~0))) (.cse21 (not (= 0 ~c2_st~0))) (.cse13 (not (= 0 ~wl_st~0))) (.cse14 (not (= 1 ~e_e~0))) (.cse24 (= ~r_i~0 ~c_req_up~0)) (.cse16 (not (= 1 ~e_g~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 (= ~wl_pc~0 0) .cse14 .cse15 .cse16) (and (= ~data~0 .cse18) .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse5 .cse20 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse22 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse9 .cse8 .cse21 .cse11 .cse22 .cse13 .cse23 .cse24 .cse14 .cse15 .cse16 .cse17) (and .cse0 (= ~data~0 .cse25) .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse5 .cse20 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse22 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17) (and (= ~data~0 0) (= ~d~0 0) .cse4 .cse5 .cse7 .cse11 .cse22 .cse12 (= ~r_st~0 ~e_f~0) .cse23 .cse15 (not (= 0 ~wl_pc~0)) .cse0 .cse1 .cse19 .cse2 .cse3 .cse6 (= ~processed~0 0) .cse8 .cse9 .cse21 .cse13 (= ~t_b~0 0) .cse14 .cse24 .cse16)))) [2021-12-16 01:09:20,858 INFO L858 garLoopResultBuilder]: For program point L265(lines 265 282) no Hoare annotation was computed. [2021-12-16 01:09:20,859 INFO L854 garLoopResultBuilder]: At program point L596(lines 589 606) the Hoare annotation is: (let ((.cse23 (+ ~t_b~0 2)) (.cse13 (+ ~t_b~0 1))) (let ((.cse0 (not (= 0 ~e_e~0))) (.cse1 (= ~c1_i~0 1)) (.cse14 (= ~c2_pc~0 1)) (.cse2 (not (= 1 ~e_wl~0))) (.cse3 (= 2 ~e_f~0)) (.cse4 (= ~wb_i~0 1)) (.cse5 (= ~c2_i~0 1)) (.cse15 (or (= ~c_t~0 .cse23) (= ~c_t~0 .cse13))) (.cse6 (not (= 0 ~e_g~0))) (.cse16 (= ~wb_pc~0 1)) (.cse7 (not (= 1 ~r_i~0))) (.cse8 (not (= 0 ~e_wl~0))) (.cse17 (not (= 0 ~c2_st~0))) (.cse18 (= ~c1_pc~0 1)) (.cse19 (not (= 0 ~c1_st~0))) (.cse9 (not (= 0 ~wl_st~0))) (.cse20 (or (= ~c~0 .cse23) (= ~c~0 .cse13))) (.cse21 (not (= 0 ~wb_st~0))) (.cse10 (not (= 1 ~e_e~0))) (.cse11 (not (= 0 ~e_c~0))) (.cse12 (not (= 1 ~e_g~0))) (.cse22 (not (= 0 ~r_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~wl_pc~0 0) .cse10 .cse11 .cse12) (and .cse0 (= ~data~0 .cse13) .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse17 .cse18 .cse19 .cse9 .cse20 .cse21 .cse10 .cse11 .cse12 .cse22) (and .cse0 .cse1 (= 2 ~e_c~0) .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse18 .cse19 .cse9 .cse21 .cse10 .cse11 .cse12 .cse22) (and .cse0 .cse1 .cse14 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse18 (not (= ~wl_pc~0 2)) .cse9 .cse10 .cse11 .cse12 .cse22) (and (= ~data~0 .cse23) .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse17 .cse18 .cse19 .cse9 .cse20 .cse21 .cse10 .cse11 .cse12 .cse22)))) [2021-12-16 01:09:20,859 INFO L858 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2021-12-16 01:09:20,859 INFO L858 garLoopResultBuilder]: For program point L464-1(lines 406 690) no Hoare annotation was computed. [2021-12-16 01:09:20,859 INFO L858 garLoopResultBuilder]: For program point L299(lines 298 396) no Hoare annotation was computed. [2021-12-16 01:09:20,859 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2021-12-16 01:09:20,862 INFO L732 BasicCegarLoop]: Path program 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] [2021-12-16 01:09:20,864 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 01:09:20,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:09:20 BoogieIcfgContainer [2021-12-16 01:09:20,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 01:09:20,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 01:09:20,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 01:09:20,969 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 01:09:20,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:08:20" (3/4) ... [2021-12-16 01:09:20,972 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-16 01:09:20,990 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-12-16 01:09:20,991 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-16 01:09:20,991 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-16 01:09:20,992 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-16 01:09:21,078 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 01:09:21,079 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 01:09:21,081 INFO L158 Benchmark]: Toolchain (without parser) took 61022.16ms. Allocated memory was 146.8MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 117.6MB in the beginning and 925.3MB in the end (delta: -807.7MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-16 01:09:21,085 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 49.6MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 01:09:21,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.02ms. Allocated memory is still 146.8MB. Free memory was 117.6MB in the beginning and 119.5MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 01:09:21,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.68ms. Allocated memory is still 146.8MB. Free memory was 119.5MB in the beginning and 117.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:09:21,088 INFO L158 Benchmark]: Boogie Preprocessor took 31.94ms. Allocated memory is still 146.8MB. Free memory was 117.4MB in the beginning and 115.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:09:21,088 INFO L158 Benchmark]: RCFGBuilder took 434.22ms. Allocated memory is still 146.8MB. Free memory was 115.3MB in the beginning and 94.8MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-16 01:09:21,088 INFO L158 Benchmark]: TraceAbstraction took 60128.44ms. Allocated memory was 146.8MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 94.3MB in the beginning and 945.2MB in the end (delta: -850.9MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-16 01:09:21,088 INFO L158 Benchmark]: Witness Printer took 110.24ms. Allocated memory is still 2.3GB. Free memory was 944.2MB in the beginning and 925.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-16 01:09:21,089 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 49.6MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.02ms. Allocated memory is still 146.8MB. Free memory was 117.6MB in the beginning and 119.5MB in the end (delta: -1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.68ms. Allocated memory is still 146.8MB. Free memory was 119.5MB in the beginning and 117.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.94ms. Allocated memory is still 146.8MB. Free memory was 117.4MB in the beginning and 115.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 434.22ms. Allocated memory is still 146.8MB. Free memory was 115.3MB in the beginning and 94.8MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 60128.44ms. Allocated memory was 146.8MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 94.3MB in the beginning and 945.2MB in the end (delta: -850.9MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 110.24ms. Allocated memory is still 2.3GB. Free memory was 944.2MB in the beginning and 925.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.0s, OverallIterations: 36, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 48.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11719 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11719 mSDsluCounter, 22319 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14501 mSDsCounter, 323 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1694 IncrementalHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 323 mSolverCounterUnsat, 7818 mSDtfsCounter, 1694 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5718occurred in iteration=21, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 9012 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 599 NumberOfFragments, 15076 HoareAnnotationTreeSize, 22 FomulaSimplifications, 332 FormulaSimplificationTreeSizeReduction, 34.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 7092227 FormulaSimplificationTreeSizeReductionInter, 13.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3833 NumberOfCodeBlocks, 3833 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3989 ConstructedInterpolants, 0 QuantifiedInterpolants, 8379 SizeOfPredicates, 6 NumberOfNonLiveVariables, 531 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 38 InterpolantComputations, 35 PerfectInterpolantSequences, 2142/2272 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g)) || (((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && r_i == c_req_up) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && processed == 0) && !(0 == e_g)) && c1_st == 0) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g)) || (((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && c2_st == 0) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && c1_st == 0) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && c_t == t_b + 2) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g)) - InvariantResult [Line: 692]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g)) || ((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g)) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) || (((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wb_pc == 1) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((((data == 0 && wb_st == 0) && 2 == e_f) && d == 0) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && processed == 0) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && c2_st == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && r_i == c_req_up) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && wb_st == 0) && 2 == e_f) && d == 0) && wb_i == 1) && !(0 == e_g)) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && 2 == e_f) && d == 0) && wb_i == 1) && !(0 == e_g)) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && wb_st == 0) && 2 == e_f) && d == 0) && wb_i == 1) && !(0 == e_g)) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wb_pc == 1) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && processed == 0) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == c1_st)) && r_st == e_f) && !(0 == wb_st)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g)) || ((wl_pc == 2 && 2 == e_f) && (((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(1 == e_g)) && !(0 == r_st)) || (((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(1 == e_g)) && !(0 == r_st)) && data == t_b))) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) || (((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && r_i == c_req_up) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) || ((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((((data == 0 && wb_st == 0) && 2 == e_f) && d == 0) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == c1_st)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_st == 0) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == wl_pc)) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((data == 0 && 2 == e_f) && d == 0) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == c1_st)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && r_i == c_req_up) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && processed == 0) && !(0 == e_g)) && c1_st == 0) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((((data == 0 && wb_st == 0) && 2 == e_f) && d == 0) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_st == 0) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g)) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && processed == 0) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c1_st)) && c1_pc == 1) && data == t) && !(0 == wl_st)) && c2_st == 0) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) && data == t_b)) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ((((((((((((((c1_i == 1 && e_e == e_f) && 2 == e_c) && wb_st == 0) && wb_i == 1) && c2_i == 1) && c1_st == 0) && !(1 == r_i)) && e_wl == e_c) && !(0 == wl_st)) && e_g == e_f) && c2_st == 0) && wl_pc == 0) && r_i == c_req_up) && e_e == e_c) || (((((((((((((((((((((c1_i == 1 && e_e == e_f) && 2 == e_c) && data == 0) && wb_st == 0) && d == 0) && wb_i == 1) && c2_i == 1) && c1_st == 0) && processed == 0) && !(1 == r_i)) && c1_pc == 0) && e_wl == e_c) && r_st == e_f) && e_g == e_f) && c2_st == 0) && wl_pc == 0) && wb_pc == 0) && t_b == 0) && c2_pc == 0) && r_i == c_req_up) && e_e == e_c) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g)) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && c1_st == 0) && processed == 0) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && data == t) && wl_pc == 2) && !(0 == wl_st)) && c2_st == 0) && !(0 == wb_st)) && !(1 == e_e)) && !(1 == e_g)) && data == t_b) && !(0 == r_st))) || (((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && r_i == c_req_up) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g)) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(0 == e_wl)) && !(1 == r_i)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && (d == t_b + 2 || d == t_b + 1)) && !(0 == wl_st)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) || ((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(1 == r_i)) && !(0 == wl_st)) && wl_pc == 0) && !(0 == e_c)) && !(1 == e_g))) || (((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(0 == e_wl)) && !(1 == r_i)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && (d == t_b + 2 || d == t_b + 1)) && !(0 == wl_st)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(1 == r_i)) && wb_pc == 1) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g)) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && c2_st == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && r_i == c_req_up) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && processed == 0) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && processed == 0) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && c2_st == 0) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) || (((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && processed == 0) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && c1_st == 0) && processed == 0) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && processed == 0) && !(0 == e_g)) && c1_st == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && data == t) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && data == t_b) && !(0 == r_st))) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) - InvariantResult [Line: 589]: Loop Invariant Derived loop invariant: ((((((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && !(0 == wb_st)) && wb_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && c1_st == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && c2_st == 0) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && c_t == t_b + 2) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && !(0 == wb_st)) && wb_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (wl_pc == 2 && (((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == wl_st)) && (d == t_b + 2 || d == t_b + 1)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(1 == e_e)) && !(1 == e_g)) && !(0 == r_st)) || ((((((((((((((((((((!(0 == e_e) && data == t_b + 2) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == wl_st)) && (d == t_b + 2 || d == t_b + 1)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(1 == e_e)) && !(1 == e_g)) && !(0 == r_st)))) && 2 == e_f - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(1 == r_i)) && wb_pc == 1) && c1_pc == 1) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) || (((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(1 == r_i)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(0 == e_wl)) && !(1 == r_i)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && r_st == e_f) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || (wl_pc == 2 && ((((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(0 == e_wl)) && !(1 == r_i)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && r_st == e_f) && (d == t_b + 2 || d == t_b + 1)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) || (((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(0 == e_wl)) && !(1 == r_i)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && r_st == e_f) && (d == t_b + 2 || d == t_b + 1)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(0 == e_wl)) && !(1 == r_i)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && r_st == e_f) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g)) || (((((((((((((!(0 == e_e) && c1_i == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == wl_st)) && wl_pc == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((!(0 == e_e) && c1_i == 1) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(wl_pc == 2)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && c2_st == 0) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && wb_i == 1) && c2_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(0 == wb_st)) && r_i == c_req_up) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || (((((((((((((((((((((((!(0 == e_e) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && processed == 0) && !(0 == e_g)) && c1_st == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == e_wl)) && c1_pc == 1) && data == t) && !(0 == wl_st)) && c2_st == 0) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) && data == t_b)) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || (wl_pc == 2 && ((((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && (d == t_b + 2 || d == t_b + 1)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) || (((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && (c_t == t_b + 2 || c_t == t_b + 1)) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && (d == t_b + 2 || d == t_b + 1)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && c1_pc == 0) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && c1_st == 0) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 0) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || (((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == wl_st)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && !(0 == wb_st)) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wb_pc == 1) && !(0 == c2_st)) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && c2_st == 0) && !(0 == wb_st)) && c2_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && wb_pc == 1) && !(1 == r_i)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && c1_pc == 1) && !(0 == c1_st)) && !(wl_pc == 2)) && r_st == e_f) && wb_pc == 0) && !(0 == e_c)) && !(0 == wl_pc)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && !(0 == c2_st)) && !(0 == wl_st)) && t_b == 0) && !(1 == e_e)) && r_i == c_req_up) && !(1 == e_g))) || ((((((((((((((((((((((!(0 == e_e) && data == t_b + 1) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && c1_st == 0) && processed == 0) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && !(1 == e_wl)) && 2 == e_f) && (c_t == t_b + 2 || c_t == t_b + 1)) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && (c == t_b + 2 || c == t_b + 1)) && !(0 == wb_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g))) || (((((((((((((((((((((((((data == 0 && wb_st == 0) && d == 0) && 2 == e_f) && wb_i == 1) && !(0 == e_g)) && !(0 == e_wl)) && !(0 == c1_st)) && c1_pc == 1) && r_st == e_f) && c2_st == 0) && wb_pc == 0) && c2_pc == 0) && !(0 == e_c)) && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && !(1 == e_wl)) && c2_i == 1) && processed == 0) && !(1 == r_i)) && wl_pc == 0) && t_b == 0) && r_i == c_req_up) && !(1 == e_e)) && !(1 == e_g))) || ((((((((((((((((((((((data == t_b + 2 && !(0 == e_e)) && c1_i == 1) && 2 == e_c) && c2_pc == 1) && wb_st == 0) && !(1 == e_wl)) && 2 == e_f) && c2_i == 1) && wb_i == 1) && !(0 == e_g)) && processed == 0) && !(1 == r_i)) && !(0 == e_wl)) && wb_pc == 1) && !(0 == c2_st)) && c1_pc == 1) && !(0 == c1_st)) && !(0 == wl_st)) && !(1 == e_e)) && !(0 == e_c)) && !(1 == e_g)) && !(0 == r_st)) RESULT: Ultimate proved your program to be correct! [2021-12-16 01:09:21,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE