./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 20ed64ec 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 1ba07ae5f9ba9742e473cf2ed151649cad165d7c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 09:13:07,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 09:13:07,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 09:13:07,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 09:13:07,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 09:13:07,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 09:13:07,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 09:13:07,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 09:13:07,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 09:13:07,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 09:13:07,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 09:13:07,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 09:13:07,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 09:13:07,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 09:13:07,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 09:13:07,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 09:13:07,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 09:13:07,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 09:13:07,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 09:13:07,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 09:13:07,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 09:13:07,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 09:13:07,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 09:13:07,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 09:13:07,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 09:13:07,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 09:13:07,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 09:13:07,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 09:13:07,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 09:13:07,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 09:13:07,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 09:13:07,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 09:13:07,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 09:13:07,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 09:13:07,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 09:13:07,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 09:13:07,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 09:13:07,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 09:13:07,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 09:13:07,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 09:13:07,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 09:13:07,877 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 09:13:07,904 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 09:13:07,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 09:13:07,905 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 09:13:07,905 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 09:13:07,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 09:13:07,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 09:13:07,907 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 09:13:07,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 09:13:07,907 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 09:13:07,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 09:13:07,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 09:13:07,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 09:13:07,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 09:13:07,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 09:13:07,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 09:13:07,908 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 09:13:07,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 09:13:07,908 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 09:13:07,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 09:13:07,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 09:13:07,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 09:13:07,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 09:13:07,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:13:07,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 09:13:07,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 09:13:07,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 09:13:07,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 09:13:07,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 09:13:07,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 09:13:07,914 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 09:13:07,914 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 -> 1ba07ae5f9ba9742e473cf2ed151649cad165d7c [2021-08-26 09:13:08,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 09:13:08,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 09:13:08,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 09:13:08,177 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 09:13:08,177 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 09:13:08,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2021-08-26 09:13:08,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b643473/8e382cdf272e4019baaf5c724ac66ef3/FLAGada16e5b0 [2021-08-26 09:13:08,566 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 09:13:08,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2021-08-26 09:13:08,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b643473/8e382cdf272e4019baaf5c724ac66ef3/FLAGada16e5b0 [2021-08-26 09:13:08,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b643473/8e382cdf272e4019baaf5c724ac66ef3 [2021-08-26 09:13:08,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 09:13:08,973 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 09:13:08,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 09:13:08,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 09:13:08,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 09:13:08,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:13:08" (1/1) ... [2021-08-26 09:13:08,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c6c480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:08, skipping insertion in model container [2021-08-26 09:13:08,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:13:08" (1/1) ... [2021-08-26 09:13:08,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 09:13:09,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 09:13:09,079 WARN L228 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[392,405] [2021-08-26 09:13:09,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:13:09,155 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 09:13:09,182 WARN L228 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[392,405] [2021-08-26 09:13:09,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:13:09,219 INFO L208 MainTranslator]: Completed translation [2021-08-26 09:13:09,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09 WrapperNode [2021-08-26 09:13:09,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 09:13:09,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 09:13:09,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 09:13:09,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 09:13:09,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09" (1/1) ... [2021-08-26 09:13:09,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09" (1/1) ... [2021-08-26 09:13:09,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 09:13:09,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 09:13:09,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 09:13:09,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 09:13:09,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09" (1/1) ... [2021-08-26 09:13:09,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09" (1/1) ... [2021-08-26 09:13:09,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09" (1/1) ... [2021-08-26 09:13:09,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09" (1/1) ... [2021-08-26 09:13:09,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09" (1/1) ... [2021-08-26 09:13:09,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09" (1/1) ... [2021-08-26 09:13:09,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09" (1/1) ... [2021-08-26 09:13:09,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 09:13:09,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 09:13:09,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 09:13:09,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 09:13:09,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09" (1/1) ... [2021-08-26 09:13:09,297 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:13:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:13:09,313 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-08-26 09:13:09,335 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-08-26 09:13:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 09:13:09,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 09:13:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 09:13:09,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 09:13:09,851 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 09:13:09,852 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-08-26 09:13:09,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:13:09 BoogieIcfgContainer [2021-08-26 09:13:09,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 09:13:09,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 09:13:09,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 09:13:09,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 09:13:09,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:13:08" (1/3) ... [2021-08-26 09:13:09,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4681a2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:13:09, skipping insertion in model container [2021-08-26 09:13:09,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:13:09" (2/3) ... [2021-08-26 09:13:09,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4681a2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:13:09, skipping insertion in model container [2021-08-26 09:13:09,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:13:09" (3/3) ... [2021-08-26 09:13:09,860 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2021-08-26 09:13:09,863 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 09:13:09,863 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 09:13:09,915 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 09:13:09,919 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, mConcurrency=FINITE_AUTOMATA, 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-08-26 09:13:09,919 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 09:13:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 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-08-26 09:13:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:09,934 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:09,935 INFO L512 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-08-26 09:13:09,935 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:09,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:09,938 INFO L82 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2021-08-26 09:13:09,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:09,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110090258] [2021-08-26 09:13:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:09,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:10,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:10,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110090258] [2021-08-26 09:13:10,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110090258] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:10,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:10,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:10,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840991275] [2021-08-26 09:13:10,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:10,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:10,096 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 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-08-26 09:13:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:10,126 INFO L93 Difference]: Finished difference Result 244 states and 453 transitions. [2021-08-26 09:13:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:10,127 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-08-26 09:13:10,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:10,133 INFO L225 Difference]: With dead ends: 244 [2021-08-26 09:13:10,133 INFO L226 Difference]: Without dead ends: 122 [2021-08-26 09:13:10,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-08-26 09:13:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-08-26 09:13:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.7768595041322315) internal successors, (215), 121 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-08-26 09:13:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2021-08-26 09:13:10,161 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 36 [2021-08-26 09:13:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:10,162 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 215 transitions. [2021-08-26 09:13:10,162 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-08-26 09:13:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions. [2021-08-26 09:13:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:10,164 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:10,165 INFO L512 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-08-26 09:13:10,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 09:13:10,165 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:10,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:10,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2021-08-26 09:13:10,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:10,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403799471] [2021-08-26 09:13:10,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:10,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:10,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:10,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403799471] [2021-08-26 09:13:10,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403799471] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:10,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:10,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:10,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762208618] [2021-08-26 09:13:10,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:10,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:10,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:10,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:10,215 INFO L87 Difference]: Start difference. First operand 122 states and 215 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-08-26 09:13:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:10,250 INFO L93 Difference]: Finished difference Result 328 states and 577 transitions. [2021-08-26 09:13:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:13:10,250 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-08-26 09:13:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:10,252 INFO L225 Difference]: With dead ends: 328 [2021-08-26 09:13:10,252 INFO L226 Difference]: Without dead ends: 209 [2021-08-26 09:13:10,256 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-08-26 09:13:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2021-08-26 09:13:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.7609756097560976) internal successors, (361), 205 states have internal predecessors, (361), 0 states have call successors, (0), 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-08-26 09:13:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 361 transitions. [2021-08-26 09:13:10,271 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 361 transitions. Word has length 36 [2021-08-26 09:13:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:10,271 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 361 transitions. [2021-08-26 09:13:10,271 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-08-26 09:13:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 361 transitions. [2021-08-26 09:13:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:10,272 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:10,272 INFO L512 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-08-26 09:13:10,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 09:13:10,272 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:10,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:10,273 INFO L82 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2021-08-26 09:13:10,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:10,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571711080] [2021-08-26 09:13:10,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:10,273 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:10,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:10,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571711080] [2021-08-26 09:13:10,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571711080] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:10,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:10,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:10,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017091179] [2021-08-26 09:13:10,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:10,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:10,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:10,345 INFO L87 Difference]: Start difference. First operand 206 states and 361 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-08-26 09:13:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:10,409 INFO L93 Difference]: Finished difference Result 403 states and 709 transitions. [2021-08-26 09:13:10,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:10,410 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-08-26 09:13:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:10,411 INFO L225 Difference]: With dead ends: 403 [2021-08-26 09:13:10,411 INFO L226 Difference]: Without dead ends: 206 [2021-08-26 09:13:10,412 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-08-26 09:13:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-08-26 09:13:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.7024390243902439) internal successors, (349), 205 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 349 transitions. [2021-08-26 09:13:10,424 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 349 transitions. Word has length 36 [2021-08-26 09:13:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:10,424 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 349 transitions. [2021-08-26 09:13:10,424 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-08-26 09:13:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 349 transitions. [2021-08-26 09:13:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:10,425 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:10,425 INFO L512 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-08-26 09:13:10,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 09:13:10,425 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:10,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1741714488, now seen corresponding path program 1 times [2021-08-26 09:13:10,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:10,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727609964] [2021-08-26 09:13:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:10,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:10,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:10,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727609964] [2021-08-26 09:13:10,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727609964] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:10,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:10,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:10,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120391851] [2021-08-26 09:13:10,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:10,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:10,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:10,494 INFO L87 Difference]: Start difference. First operand 206 states and 349 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-08-26 09:13:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:10,573 INFO L93 Difference]: Finished difference Result 559 states and 950 transitions. [2021-08-26 09:13:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:13:10,573 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-08-26 09:13:10,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:10,575 INFO L225 Difference]: With dead ends: 559 [2021-08-26 09:13:10,575 INFO L226 Difference]: Without dead ends: 363 [2021-08-26 09:13:10,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-08-26 09:13:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 206. [2021-08-26 09:13:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.6878048780487804) internal successors, (346), 205 states have internal predecessors, (346), 0 states have call successors, (0), 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-08-26 09:13:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 346 transitions. [2021-08-26 09:13:10,587 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 346 transitions. Word has length 36 [2021-08-26 09:13:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:10,587 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 346 transitions. [2021-08-26 09:13:10,588 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-08-26 09:13:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 346 transitions. [2021-08-26 09:13:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:10,588 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:10,588 INFO L512 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-08-26 09:13:10,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 09:13:10,589 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:10,589 INFO L82 PathProgramCache]: Analyzing trace with hash 181513546, now seen corresponding path program 1 times [2021-08-26 09:13:10,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:10,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837723313] [2021-08-26 09:13:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:10,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:10,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:10,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837723313] [2021-08-26 09:13:10,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837723313] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:10,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:10,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:10,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616014208] [2021-08-26 09:13:10,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:10,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:10,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:10,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:10,628 INFO L87 Difference]: Start difference. First operand 206 states and 346 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-08-26 09:13:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:10,697 INFO L93 Difference]: Finished difference Result 562 states and 946 transitions. [2021-08-26 09:13:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:13:10,697 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-08-26 09:13:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:10,699 INFO L225 Difference]: With dead ends: 562 [2021-08-26 09:13:10,699 INFO L226 Difference]: Without dead ends: 367 [2021-08-26 09:13:10,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-08-26 09:13:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 206. [2021-08-26 09:13:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.673170731707317) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:13:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 343 transitions. [2021-08-26 09:13:10,726 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 343 transitions. Word has length 36 [2021-08-26 09:13:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:10,726 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 343 transitions. [2021-08-26 09:13:10,726 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-08-26 09:13:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 343 transitions. [2021-08-26 09:13:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:10,730 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:10,730 INFO L512 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-08-26 09:13:10,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 09:13:10,731 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:10,732 INFO L82 PathProgramCache]: Analyzing trace with hash 243553160, now seen corresponding path program 1 times [2021-08-26 09:13:10,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:10,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780844313] [2021-08-26 09:13:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:10,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:10,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:10,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780844313] [2021-08-26 09:13:10,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780844313] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:10,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:10,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:10,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395801909] [2021-08-26 09:13:10,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:10,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:10,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:10,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:10,763 INFO L87 Difference]: Start difference. First operand 206 states and 343 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-08-26 09:13:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:10,818 INFO L93 Difference]: Finished difference Result 574 states and 957 transitions. [2021-08-26 09:13:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:13:10,819 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-08-26 09:13:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:10,820 INFO L225 Difference]: With dead ends: 574 [2021-08-26 09:13:10,821 INFO L226 Difference]: Without dead ends: 380 [2021-08-26 09:13:10,827 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-08-26 09:13:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2021-08-26 09:13:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.6445497630331753) internal successors, (347), 211 states have internal predecessors, (347), 0 states have call successors, (0), 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-08-26 09:13:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 347 transitions. [2021-08-26 09:13:10,837 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 347 transitions. Word has length 36 [2021-08-26 09:13:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:10,838 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 347 transitions. [2021-08-26 09:13:10,838 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-08-26 09:13:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 347 transitions. [2021-08-26 09:13:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:10,841 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:10,841 INFO L512 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-08-26 09:13:10,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 09:13:10,841 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:10,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:10,841 INFO L82 PathProgramCache]: Analyzing trace with hash 384101770, now seen corresponding path program 1 times [2021-08-26 09:13:10,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:10,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077405037] [2021-08-26 09:13:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:10,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:10,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:10,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077405037] [2021-08-26 09:13:10,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077405037] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:10,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:10,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:10,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339455492] [2021-08-26 09:13:10,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:10,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:10,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:10,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:10,880 INFO L87 Difference]: Start difference. First operand 212 states and 347 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-08-26 09:13:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:10,942 INFO L93 Difference]: Finished difference Result 721 states and 1181 transitions. [2021-08-26 09:13:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:13:10,942 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-08-26 09:13:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:10,944 INFO L225 Difference]: With dead ends: 721 [2021-08-26 09:13:10,944 INFO L226 Difference]: Without dead ends: 522 [2021-08-26 09:13:10,944 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-08-26 09:13:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 345. [2021-08-26 09:13:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.6337209302325582) internal successors, (562), 344 states have internal predecessors, (562), 0 states have call successors, (0), 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-08-26 09:13:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 562 transitions. [2021-08-26 09:13:10,956 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 562 transitions. Word has length 36 [2021-08-26 09:13:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:10,956 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 562 transitions. [2021-08-26 09:13:10,956 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-08-26 09:13:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 562 transitions. [2021-08-26 09:13:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:10,957 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:10,957 INFO L512 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-08-26 09:13:10,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 09:13:10,957 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash 250088264, now seen corresponding path program 1 times [2021-08-26 09:13:10,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:10,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258055202] [2021-08-26 09:13:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:10,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:11,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:11,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258055202] [2021-08-26 09:13:11,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258055202] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:11,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:11,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:11,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946864286] [2021-08-26 09:13:11,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:11,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:11,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:11,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:11,004 INFO L87 Difference]: Start difference. First operand 345 states and 562 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-08-26 09:13:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:11,034 INFO L93 Difference]: Finished difference Result 822 states and 1345 transitions. [2021-08-26 09:13:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:11,035 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-08-26 09:13:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:11,036 INFO L225 Difference]: With dead ends: 822 [2021-08-26 09:13:11,036 INFO L226 Difference]: Without dead ends: 501 [2021-08-26 09:13:11,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-08-26 09:13:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 499. [2021-08-26 09:13:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.6305220883534137) internal successors, (812), 498 states have internal predecessors, (812), 0 states have call successors, (0), 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-08-26 09:13:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 812 transitions. [2021-08-26 09:13:11,056 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 812 transitions. Word has length 36 [2021-08-26 09:13:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:11,057 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 812 transitions. [2021-08-26 09:13:11,057 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-08-26 09:13:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 812 transitions. [2021-08-26 09:13:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:11,057 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:11,057 INFO L512 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-08-26 09:13:11,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 09:13:11,058 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:11,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:11,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1539793604, now seen corresponding path program 1 times [2021-08-26 09:13:11,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:11,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072343995] [2021-08-26 09:13:11,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:11,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:11,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:11,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072343995] [2021-08-26 09:13:11,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072343995] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:11,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:11,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:11,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144994556] [2021-08-26 09:13:11,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:11,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:11,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:11,088 INFO L87 Difference]: Start difference. First operand 499 states and 812 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-08-26 09:13:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:11,141 INFO L93 Difference]: Finished difference Result 1271 states and 2069 transitions. [2021-08-26 09:13:11,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:13:11,141 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-08-26 09:13:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:11,143 INFO L225 Difference]: With dead ends: 1271 [2021-08-26 09:13:11,143 INFO L226 Difference]: Without dead ends: 789 [2021-08-26 09:13:11,144 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-08-26 09:13:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 499. [2021-08-26 09:13:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.6144578313253013) internal successors, (804), 498 states have internal predecessors, (804), 0 states have call successors, (0), 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-08-26 09:13:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 804 transitions. [2021-08-26 09:13:11,174 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 804 transitions. Word has length 36 [2021-08-26 09:13:11,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:11,174 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 804 transitions. [2021-08-26 09:13:11,174 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-08-26 09:13:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 804 transitions. [2021-08-26 09:13:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:11,175 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:11,175 INFO L512 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-08-26 09:13:11,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 09:13:11,175 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:11,176 INFO L82 PathProgramCache]: Analyzing trace with hash -48554298, now seen corresponding path program 1 times [2021-08-26 09:13:11,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:11,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174276365] [2021-08-26 09:13:11,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:11,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:11,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:11,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174276365] [2021-08-26 09:13:11,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174276365] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:11,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:11,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:11,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855906107] [2021-08-26 09:13:11,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:11,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:11,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:11,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:11,220 INFO L87 Difference]: Start difference. First operand 499 states and 804 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-08-26 09:13:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:11,286 INFO L93 Difference]: Finished difference Result 1267 states and 2042 transitions. [2021-08-26 09:13:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:13:11,287 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-08-26 09:13:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:11,289 INFO L225 Difference]: With dead ends: 1267 [2021-08-26 09:13:11,289 INFO L226 Difference]: Without dead ends: 791 [2021-08-26 09:13:11,291 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-08-26 09:13:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 499. [2021-08-26 09:13:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.5983935742971886) internal successors, (796), 498 states have internal predecessors, (796), 0 states have call successors, (0), 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-08-26 09:13:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 796 transitions. [2021-08-26 09:13:11,314 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 796 transitions. Word has length 36 [2021-08-26 09:13:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:11,316 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 796 transitions. [2021-08-26 09:13:11,316 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-08-26 09:13:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 796 transitions. [2021-08-26 09:13:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:11,316 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:11,316 INFO L512 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-08-26 09:13:11,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 09:13:11,317 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1328417976, now seen corresponding path program 1 times [2021-08-26 09:13:11,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:11,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084730572] [2021-08-26 09:13:11,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:11,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:11,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:11,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084730572] [2021-08-26 09:13:11,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084730572] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:11,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:11,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:11,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835880165] [2021-08-26 09:13:11,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:11,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:11,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:11,362 INFO L87 Difference]: Start difference. First operand 499 states and 796 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-08-26 09:13:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:11,424 INFO L93 Difference]: Finished difference Result 1206 states and 1920 transitions. [2021-08-26 09:13:11,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:13:11,424 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-08-26 09:13:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:11,427 INFO L225 Difference]: With dead ends: 1206 [2021-08-26 09:13:11,427 INFO L226 Difference]: Without dead ends: 724 [2021-08-26 09:13:11,427 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2021-08-26 09:13:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 547. [2021-08-26 09:13:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.5622710622710623) internal successors, (853), 546 states have internal predecessors, (853), 0 states have call successors, (0), 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-08-26 09:13:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 853 transitions. [2021-08-26 09:13:11,446 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 853 transitions. Word has length 36 [2021-08-26 09:13:11,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:11,446 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 853 transitions. [2021-08-26 09:13:11,446 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-08-26 09:13:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 853 transitions. [2021-08-26 09:13:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 09:13:11,446 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:11,446 INFO L512 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-08-26 09:13:11,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 09:13:11,446 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:11,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:11,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2021-08-26 09:13:11,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:11,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218811650] [2021-08-26 09:13:11,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:11,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:11,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:11,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218811650] [2021-08-26 09:13:11,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218811650] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:11,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:11,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:11,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733880838] [2021-08-26 09:13:11,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:11,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:11,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:11,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:11,479 INFO L87 Difference]: Start difference. First operand 547 states and 853 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-08-26 09:13:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:11,526 INFO L93 Difference]: Finished difference Result 1300 states and 2032 transitions. [2021-08-26 09:13:11,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:11,526 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-08-26 09:13:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:11,528 INFO L225 Difference]: With dead ends: 1300 [2021-08-26 09:13:11,528 INFO L226 Difference]: Without dead ends: 767 [2021-08-26 09:13:11,529 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2021-08-26 09:13:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 764. [2021-08-26 09:13:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 1.54259501965924) internal successors, (1177), 763 states have internal predecessors, (1177), 0 states have call successors, (0), 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-08-26 09:13:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1177 transitions. [2021-08-26 09:13:11,555 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1177 transitions. Word has length 36 [2021-08-26 09:13:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:11,556 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 1177 transitions. [2021-08-26 09:13:11,556 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-08-26 09:13:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1177 transitions. [2021-08-26 09:13:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-26 09:13:11,556 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:11,556 INFO L512 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] [2021-08-26 09:13:11,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 09:13:11,556 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1648654786, now seen corresponding path program 1 times [2021-08-26 09:13:11,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:11,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586477102] [2021-08-26 09:13:11,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:11,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:11,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:11,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586477102] [2021-08-26 09:13:11,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586477102] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:11,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:11,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:11,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778564388] [2021-08-26 09:13:11,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:11,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:11,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:11,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:11,580 INFO L87 Difference]: Start difference. First operand 764 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-08-26 09:13:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:11,634 INFO L93 Difference]: Finished difference Result 1882 states and 2939 transitions. [2021-08-26 09:13:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:11,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2021-08-26 09:13:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:11,637 INFO L225 Difference]: With dead ends: 1882 [2021-08-26 09:13:11,637 INFO L226 Difference]: Without dead ends: 1145 [2021-08-26 09:13:11,638 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:11,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2021-08-26 09:13:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1143. [2021-08-26 09:13:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.5551663747810858) internal successors, (1776), 1142 states have internal predecessors, (1776), 0 states have call successors, (0), 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-08-26 09:13:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1776 transitions. [2021-08-26 09:13:11,685 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1776 transitions. Word has length 46 [2021-08-26 09:13:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:11,685 INFO L470 AbstractCegarLoop]: Abstraction has 1143 states and 1776 transitions. [2021-08-26 09:13:11,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-08-26 09:13:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1776 transitions. [2021-08-26 09:13:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-26 09:13:11,686 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:11,686 INFO L512 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] [2021-08-26 09:13:11,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 09:13:11,686 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:11,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1400508292, now seen corresponding path program 1 times [2021-08-26 09:13:11,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:11,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804033464] [2021-08-26 09:13:11,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:11,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 09:13:11,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:11,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804033464] [2021-08-26 09:13:11,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804033464] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:11,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:11,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:11,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544025177] [2021-08-26 09:13:11,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:11,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:11,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:11,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:11,709 INFO L87 Difference]: Start difference. First operand 1143 states and 1776 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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-08-26 09:13:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:11,756 INFO L93 Difference]: Finished difference Result 2237 states and 3493 transitions. [2021-08-26 09:13:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:11,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 46 [2021-08-26 09:13:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:11,759 INFO L225 Difference]: With dead ends: 2237 [2021-08-26 09:13:11,759 INFO L226 Difference]: Without dead ends: 1121 [2021-08-26 09:13:11,761 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-08-26 09:13:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2021-08-26 09:13:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.5616071428571427) internal successors, (1749), 1120 states have internal predecessors, (1749), 0 states have call successors, (0), 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-08-26 09:13:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1749 transitions. [2021-08-26 09:13:11,805 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1749 transitions. Word has length 46 [2021-08-26 09:13:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:11,805 INFO L470 AbstractCegarLoop]: Abstraction has 1121 states and 1749 transitions. [2021-08-26 09:13:11,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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-08-26 09:13:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1749 transitions. [2021-08-26 09:13:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-26 09:13:11,806 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:11,806 INFO L512 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-08-26 09:13:11,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 09:13:11,806 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:11,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:11,806 INFO L82 PathProgramCache]: Analyzing trace with hash 666181047, now seen corresponding path program 1 times [2021-08-26 09:13:11,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:11,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248036488] [2021-08-26 09:13:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:11,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:11,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:11,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248036488] [2021-08-26 09:13:11,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248036488] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:11,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:11,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:11,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268761797] [2021-08-26 09:13:11,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:11,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:11,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:11,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:11,830 INFO L87 Difference]: Start difference. First operand 1121 states and 1749 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-08-26 09:13:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:11,896 INFO L93 Difference]: Finished difference Result 2849 states and 4504 transitions. [2021-08-26 09:13:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:11,896 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-08-26 09:13:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:11,902 INFO L225 Difference]: With dead ends: 2849 [2021-08-26 09:13:11,902 INFO L226 Difference]: Without dead ends: 1755 [2021-08-26 09:13:11,904 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:11,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2021-08-26 09:13:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2021-08-26 09:13:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1752 states have (on average 1.5747716894977168) internal successors, (2759), 1752 states have internal predecessors, (2759), 0 states have call successors, (0), 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-08-26 09:13:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2759 transitions. [2021-08-26 09:13:11,971 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2759 transitions. Word has length 47 [2021-08-26 09:13:11,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:11,972 INFO L470 AbstractCegarLoop]: Abstraction has 1753 states and 2759 transitions. [2021-08-26 09:13:11,972 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-08-26 09:13:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2759 transitions. [2021-08-26 09:13:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-26 09:13:11,973 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:11,973 INFO L512 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-08-26 09:13:11,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 09:13:11,973 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:11,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:11,974 INFO L82 PathProgramCache]: Analyzing trace with hash -656218967, now seen corresponding path program 1 times [2021-08-26 09:13:11,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:11,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969963988] [2021-08-26 09:13:11,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:11,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:12,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:12,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969963988] [2021-08-26 09:13:12,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969963988] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:12,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:12,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:12,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081921335] [2021-08-26 09:13:12,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:12,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:12,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:12,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:12,004 INFO L87 Difference]: Start difference. First operand 1753 states and 2759 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-08-26 09:13:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:12,125 INFO L93 Difference]: Finished difference Result 4716 states and 7517 transitions. [2021-08-26 09:13:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:12,125 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-08-26 09:13:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:12,133 INFO L225 Difference]: With dead ends: 4716 [2021-08-26 09:13:12,133 INFO L226 Difference]: Without dead ends: 2992 [2021-08-26 09:13:12,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2021-08-26 09:13:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2990. [2021-08-26 09:13:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2989 states have (on average 1.5878220140515222) internal successors, (4746), 2989 states have internal predecessors, (4746), 0 states have call successors, (0), 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-08-26 09:13:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 4746 transitions. [2021-08-26 09:13:12,247 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 4746 transitions. Word has length 48 [2021-08-26 09:13:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:12,247 INFO L470 AbstractCegarLoop]: Abstraction has 2990 states and 4746 transitions. [2021-08-26 09:13:12,247 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-08-26 09:13:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 4746 transitions. [2021-08-26 09:13:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-26 09:13:12,248 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:12,248 INFO L512 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-08-26 09:13:12,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 09:13:12,248 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:12,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash -408072473, now seen corresponding path program 1 times [2021-08-26 09:13:12,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:12,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186811085] [2021-08-26 09:13:12,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:12,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 09:13:12,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:12,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186811085] [2021-08-26 09:13:12,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186811085] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:12,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:12,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:12,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960419472] [2021-08-26 09:13:12,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:12,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:12,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:12,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:12,276 INFO L87 Difference]: Start difference. First operand 2990 states and 4746 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-08-26 09:13:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:12,376 INFO L93 Difference]: Finished difference Result 5929 states and 9433 transitions. [2021-08-26 09:13:12,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:12,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-08-26 09:13:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:12,384 INFO L225 Difference]: With dead ends: 5929 [2021-08-26 09:13:12,384 INFO L226 Difference]: Without dead ends: 2968 [2021-08-26 09:13:12,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2021-08-26 09:13:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2021-08-26 09:13:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2968 states, 2967 states have (on average 1.5908324907313784) internal successors, (4720), 2967 states have internal predecessors, (4720), 0 states have call successors, (0), 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-08-26 09:13:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 4720 transitions. [2021-08-26 09:13:12,495 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 4720 transitions. Word has length 48 [2021-08-26 09:13:12,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:12,495 INFO L470 AbstractCegarLoop]: Abstraction has 2968 states and 4720 transitions. [2021-08-26 09:13:12,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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-08-26 09:13:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 4720 transitions. [2021-08-26 09:13:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-26 09:13:12,496 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:12,496 INFO L512 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-08-26 09:13:12,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 09:13:12,497 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:12,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2128148300, now seen corresponding path program 1 times [2021-08-26 09:13:12,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:12,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630748317] [2021-08-26 09:13:12,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:12,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:12,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:12,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630748317] [2021-08-26 09:13:12,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630748317] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:12,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:12,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:12,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346453334] [2021-08-26 09:13:12,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:12,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:12,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:12,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:12,530 INFO L87 Difference]: Start difference. First operand 2968 states and 4720 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-08-26 09:13:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:12,728 INFO L93 Difference]: Finished difference Result 7517 states and 12005 transitions. [2021-08-26 09:13:12,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:13:12,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-08-26 09:13:12,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:12,740 INFO L225 Difference]: With dead ends: 7517 [2021-08-26 09:13:12,740 INFO L226 Difference]: Without dead ends: 3845 [2021-08-26 09:13:12,745 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2021-08-26 09:13:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3845. [2021-08-26 09:13:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3844 states have (on average 1.5832466181061395) internal successors, (6086), 3844 states have internal predecessors, (6086), 0 states have call successors, (0), 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-08-26 09:13:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6086 transitions. [2021-08-26 09:13:12,909 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6086 transitions. Word has length 49 [2021-08-26 09:13:12,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:12,909 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 6086 transitions. [2021-08-26 09:13:12,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-08-26 09:13:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6086 transitions. [2021-08-26 09:13:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-26 09:13:12,910 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:12,910 INFO L512 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] [2021-08-26 09:13:12,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 09:13:12,911 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:12,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:12,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1609174737, now seen corresponding path program 1 times [2021-08-26 09:13:12,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:12,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618863702] [2021-08-26 09:13:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:12,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:12,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:12,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618863702] [2021-08-26 09:13:12,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618863702] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:12,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:12,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:13:12,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166198949] [2021-08-26 09:13:12,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:13:12,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:12,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:13:12,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:12,942 INFO L87 Difference]: Start difference. First operand 3845 states and 6086 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-08-26 09:13:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:13,180 INFO L93 Difference]: Finished difference Result 9812 states and 15418 transitions. [2021-08-26 09:13:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 09:13:13,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-08-26 09:13:13,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:13,205 INFO L225 Difference]: With dead ends: 9812 [2021-08-26 09:13:13,205 INFO L226 Difference]: Without dead ends: 5990 [2021-08-26 09:13:13,210 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:13:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2021-08-26 09:13:13,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 4496. [2021-08-26 09:13:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4496 states, 4495 states have (on average 1.5481646273637375) internal successors, (6959), 4495 states have internal predecessors, (6959), 0 states have call successors, (0), 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-08-26 09:13:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 6959 transitions. [2021-08-26 09:13:13,391 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 6959 transitions. Word has length 54 [2021-08-26 09:13:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:13,391 INFO L470 AbstractCegarLoop]: Abstraction has 4496 states and 6959 transitions. [2021-08-26 09:13:13,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-08-26 09:13:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 6959 transitions. [2021-08-26 09:13:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-26 09:13:13,394 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:13,394 INFO L512 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] [2021-08-26 09:13:13,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-26 09:13:13,394 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:13,394 INFO L82 PathProgramCache]: Analyzing trace with hash -605096400, now seen corresponding path program 1 times [2021-08-26 09:13:13,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:13,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254714559] [2021-08-26 09:13:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:13,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:13,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:13,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254714559] [2021-08-26 09:13:13,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254714559] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:13,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:13,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:13,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862421970] [2021-08-26 09:13:13,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:13,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:13,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:13,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:13,419 INFO L87 Difference]: Start difference. First operand 4496 states and 6959 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-08-26 09:13:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:13,621 INFO L93 Difference]: Finished difference Result 9315 states and 14384 transitions. [2021-08-26 09:13:13,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:13,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-08-26 09:13:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:13,636 INFO L225 Difference]: With dead ends: 9315 [2021-08-26 09:13:13,636 INFO L226 Difference]: Without dead ends: 4848 [2021-08-26 09:13:13,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4848 states. [2021-08-26 09:13:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4848 to 4816. [2021-08-26 09:13:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4816 states, 4815 states have (on average 1.4969885773624092) internal successors, (7208), 4815 states have internal predecessors, (7208), 0 states have call successors, (0), 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-08-26 09:13:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4816 states to 4816 states and 7208 transitions. [2021-08-26 09:13:13,869 INFO L78 Accepts]: Start accepts. Automaton has 4816 states and 7208 transitions. Word has length 86 [2021-08-26 09:13:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:13,869 INFO L470 AbstractCegarLoop]: Abstraction has 4816 states and 7208 transitions. [2021-08-26 09:13:13,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-08-26 09:13:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4816 states and 7208 transitions. [2021-08-26 09:13:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-26 09:13:13,872 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:13,872 INFO L512 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] [2021-08-26 09:13:13,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-26 09:13:13,873 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:13,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash 129921275, now seen corresponding path program 1 times [2021-08-26 09:13:13,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:13,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495355914] [2021-08-26 09:13:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:13,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:13,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:13,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495355914] [2021-08-26 09:13:13,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495355914] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:13,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:13,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:13,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209638877] [2021-08-26 09:13:13,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:13,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:13,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:13,894 INFO L87 Difference]: Start difference. First operand 4816 states and 7208 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-08-26 09:13:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:14,076 INFO L93 Difference]: Finished difference Result 10113 states and 15094 transitions. [2021-08-26 09:13:14,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:14,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-08-26 09:13:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:14,085 INFO L225 Difference]: With dead ends: 10113 [2021-08-26 09:13:14,085 INFO L226 Difference]: Without dead ends: 5338 [2021-08-26 09:13:14,090 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5338 states. [2021-08-26 09:13:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5338 to 5290. [2021-08-26 09:13:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5290 states, 5289 states have (on average 1.4465872565702402) internal successors, (7651), 5289 states have internal predecessors, (7651), 0 states have call successors, (0), 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-08-26 09:13:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7651 transitions. [2021-08-26 09:13:14,294 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7651 transitions. Word has length 87 [2021-08-26 09:13:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:14,295 INFO L470 AbstractCegarLoop]: Abstraction has 5290 states and 7651 transitions. [2021-08-26 09:13:14,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-08-26 09:13:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7651 transitions. [2021-08-26 09:13:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-26 09:13:14,298 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:14,298 INFO L512 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] [2021-08-26 09:13:14,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-26 09:13:14,299 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash 793269102, now seen corresponding path program 1 times [2021-08-26 09:13:14,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:14,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517144112] [2021-08-26 09:13:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:14,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:13:14,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:14,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517144112] [2021-08-26 09:13:14,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517144112] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:14,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:14,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:14,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574982295] [2021-08-26 09:13:14,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:14,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:14,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:14,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:14,320 INFO L87 Difference]: Start difference. First operand 5290 states and 7651 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-08-26 09:13:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:14,500 INFO L93 Difference]: Finished difference Result 10887 states and 15753 transitions. [2021-08-26 09:13:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:14,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-08-26 09:13:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:14,509 INFO L225 Difference]: With dead ends: 10887 [2021-08-26 09:13:14,509 INFO L226 Difference]: Without dead ends: 5658 [2021-08-26 09:13:14,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2021-08-26 09:13:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5076. [2021-08-26 09:13:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5076 states, 5075 states have (on average 1.383448275862069) internal successors, (7021), 5075 states have internal predecessors, (7021), 0 states have call successors, (0), 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-08-26 09:13:14,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7021 transitions. [2021-08-26 09:13:14,716 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7021 transitions. Word has length 88 [2021-08-26 09:13:14,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:14,716 INFO L470 AbstractCegarLoop]: Abstraction has 5076 states and 7021 transitions. [2021-08-26 09:13:14,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-08-26 09:13:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7021 transitions. [2021-08-26 09:13:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-26 09:13:14,720 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:14,721 INFO L512 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] [2021-08-26 09:13:14,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-26 09:13:14,721 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash -831404099, now seen corresponding path program 1 times [2021-08-26 09:13:14,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:14,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018473206] [2021-08-26 09:13:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:14,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-26 09:13:14,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:14,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018473206] [2021-08-26 09:13:14,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018473206] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:14,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:14,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:14,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976927789] [2021-08-26 09:13:14,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:14,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:14,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:14,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:14,753 INFO L87 Difference]: Start difference. First operand 5076 states and 7021 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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-08-26 09:13:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:15,071 INFO L93 Difference]: Finished difference Result 9480 states and 13045 transitions. [2021-08-26 09:13:15,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:13:15,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 89 [2021-08-26 09:13:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:15,078 INFO L225 Difference]: With dead ends: 9480 [2021-08-26 09:13:15,078 INFO L226 Difference]: Without dead ends: 4855 [2021-08-26 09:13:15,081 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2021-08-26 09:13:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 4741. [2021-08-26 09:13:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4741 states, 4740 states have (on average 1.3356540084388187) internal successors, (6331), 4740 states have internal predecessors, (6331), 0 states have call successors, (0), 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-08-26 09:13:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 6331 transitions. [2021-08-26 09:13:15,327 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 6331 transitions. Word has length 89 [2021-08-26 09:13:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:15,328 INFO L470 AbstractCegarLoop]: Abstraction has 4741 states and 6331 transitions. [2021-08-26 09:13:15,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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-08-26 09:13:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 6331 transitions. [2021-08-26 09:13:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-26 09:13:15,335 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:15,335 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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-08-26 09:13:15,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-26 09:13:15,335 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:15,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:15,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1827636855, now seen corresponding path program 1 times [2021-08-26 09:13:15,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:15,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235955796] [2021-08-26 09:13:15,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:15,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-26 09:13:15,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:15,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235955796] [2021-08-26 09:13:15,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235955796] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:15,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:15,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:15,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854631801] [2021-08-26 09:13:15,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:15,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:15,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:15,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:15,356 INFO L87 Difference]: Start difference. First operand 4741 states and 6331 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-08-26 09:13:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:15,589 INFO L93 Difference]: Finished difference Result 9037 states and 12059 transitions. [2021-08-26 09:13:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 116 [2021-08-26 09:13:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:15,597 INFO L225 Difference]: With dead ends: 9037 [2021-08-26 09:13:15,597 INFO L226 Difference]: Without dead ends: 4687 [2021-08-26 09:13:15,601 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2021-08-26 09:13:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4687. [2021-08-26 09:13:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 4686 states have (on average 1.3284250960307298) internal successors, (6225), 4686 states have internal predecessors, (6225), 0 states have call successors, (0), 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-08-26 09:13:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 6225 transitions. [2021-08-26 09:13:15,865 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 6225 transitions. Word has length 116 [2021-08-26 09:13:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:15,865 INFO L470 AbstractCegarLoop]: Abstraction has 4687 states and 6225 transitions. [2021-08-26 09:13:15,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-08-26 09:13:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 6225 transitions. [2021-08-26 09:13:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-08-26 09:13:15,872 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:15,872 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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-08-26 09:13:15,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-26 09:13:15,872 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:15,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1827087367, now seen corresponding path program 1 times [2021-08-26 09:13:15,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:15,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287064218] [2021-08-26 09:13:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:15,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-26 09:13:15,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:15,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287064218] [2021-08-26 09:13:15,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287064218] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:15,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:15,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:15,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90842329] [2021-08-26 09:13:15,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:15,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:15,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:15,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:15,905 INFO L87 Difference]: Start difference. First operand 4687 states and 6225 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-08-26 09:13:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:16,092 INFO L93 Difference]: Finished difference Result 8325 states and 11081 transitions. [2021-08-26 09:13:16,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:13:16,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 128 [2021-08-26 09:13:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:16,099 INFO L225 Difference]: With dead ends: 8325 [2021-08-26 09:13:16,099 INFO L226 Difference]: Without dead ends: 4607 [2021-08-26 09:13:16,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4607 states. [2021-08-26 09:13:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4607 to 4605. [2021-08-26 09:13:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 4604 states have (on average 1.3040834057341442) internal successors, (6004), 4604 states have internal predecessors, (6004), 0 states have call successors, (0), 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-08-26 09:13:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6004 transitions. [2021-08-26 09:13:16,273 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6004 transitions. Word has length 128 [2021-08-26 09:13:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:16,273 INFO L470 AbstractCegarLoop]: Abstraction has 4605 states and 6004 transitions. [2021-08-26 09:13:16,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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-08-26 09:13:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6004 transitions. [2021-08-26 09:13:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-26 09:13:16,279 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:16,280 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2021-08-26 09:13:16,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-26 09:13:16,280 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:16,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:16,280 INFO L82 PathProgramCache]: Analyzing trace with hash 210660645, now seen corresponding path program 1 times [2021-08-26 09:13:16,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:16,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252123746] [2021-08-26 09:13:16,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:16,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-26 09:13:16,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:16,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252123746] [2021-08-26 09:13:16,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252123746] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:16,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:16,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:16,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422606428] [2021-08-26 09:13:16,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:16,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:16,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:16,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:16,317 INFO L87 Difference]: Start difference. First operand 4605 states and 6004 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-08-26 09:13:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:16,488 INFO L93 Difference]: Finished difference Result 8823 states and 11496 transitions. [2021-08-26 09:13:16,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:16,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 134 [2021-08-26 09:13:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:16,495 INFO L225 Difference]: With dead ends: 8823 [2021-08-26 09:13:16,495 INFO L226 Difference]: Without dead ends: 4604 [2021-08-26 09:13:16,499 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2021-08-26 09:13:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 4564. [2021-08-26 09:13:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 4563 states have (on average 1.2976112206881438) internal successors, (5921), 4563 states have internal predecessors, (5921), 0 states have call successors, (0), 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-08-26 09:13:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 5921 transitions. [2021-08-26 09:13:16,689 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 5921 transitions. Word has length 134 [2021-08-26 09:13:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:16,689 INFO L470 AbstractCegarLoop]: Abstraction has 4564 states and 5921 transitions. [2021-08-26 09:13:16,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-08-26 09:13:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 5921 transitions. [2021-08-26 09:13:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-26 09:13:16,695 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:16,695 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2021-08-26 09:13:16,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-26 09:13:16,695 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:16,696 INFO L82 PathProgramCache]: Analyzing trace with hash 80634053, now seen corresponding path program 1 times [2021-08-26 09:13:16,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:16,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25817068] [2021-08-26 09:13:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:16,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-26 09:13:16,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:16,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25817068] [2021-08-26 09:13:16,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25817068] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:16,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:16,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:16,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770929920] [2021-08-26 09:13:16,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:16,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:16,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:16,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:16,717 INFO L87 Difference]: Start difference. First operand 4564 states and 5921 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-08-26 09:13:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:16,886 INFO L93 Difference]: Finished difference Result 8762 states and 11357 transitions. [2021-08-26 09:13:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:16,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 134 [2021-08-26 09:13:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:16,891 INFO L225 Difference]: With dead ends: 8762 [2021-08-26 09:13:16,891 INFO L226 Difference]: Without dead ends: 4574 [2021-08-26 09:13:16,895 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2021-08-26 09:13:17,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4534. [2021-08-26 09:13:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4534 states, 4533 states have (on average 1.2905360688285903) internal successors, (5850), 4533 states have internal predecessors, (5850), 0 states have call successors, (0), 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-08-26 09:13:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 5850 transitions. [2021-08-26 09:13:17,065 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 5850 transitions. Word has length 134 [2021-08-26 09:13:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:17,065 INFO L470 AbstractCegarLoop]: Abstraction has 4534 states and 5850 transitions. [2021-08-26 09:13:17,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-08-26 09:13:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 5850 transitions. [2021-08-26 09:13:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-26 09:13:17,070 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:17,070 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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-08-26 09:13:17,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-26 09:13:17,070 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:17,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:17,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1507420786, now seen corresponding path program 1 times [2021-08-26 09:13:17,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:17,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360873528] [2021-08-26 09:13:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:17,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-26 09:13:17,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:17,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360873528] [2021-08-26 09:13:17,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360873528] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:17,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:17,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:17,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796175719] [2021-08-26 09:13:17,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:17,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:17,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:17,095 INFO L87 Difference]: Start difference. First operand 4534 states and 5850 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 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-08-26 09:13:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:17,239 INFO L93 Difference]: Finished difference Result 7387 states and 9578 transitions. [2021-08-26 09:13:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:13:17,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 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 137 [2021-08-26 09:13:17,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:17,243 INFO L225 Difference]: With dead ends: 7387 [2021-08-26 09:13:17,243 INFO L226 Difference]: Without dead ends: 3225 [2021-08-26 09:13:17,246 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2021-08-26 09:13:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3223. [2021-08-26 09:13:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 3222 states have (on average 1.2576039726877715) internal successors, (4052), 3222 states have internal predecessors, (4052), 0 states have call successors, (0), 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-08-26 09:13:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4052 transitions. [2021-08-26 09:13:17,391 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4052 transitions. Word has length 137 [2021-08-26 09:13:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:17,392 INFO L470 AbstractCegarLoop]: Abstraction has 3223 states and 4052 transitions. [2021-08-26 09:13:17,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 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-08-26 09:13:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4052 transitions. [2021-08-26 09:13:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-26 09:13:17,395 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:17,395 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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-08-26 09:13:17,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-26 09:13:17,395 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:17,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1526376893, now seen corresponding path program 1 times [2021-08-26 09:13:17,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:17,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574493369] [2021-08-26 09:13:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:17,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-26 09:13:17,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:17,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574493369] [2021-08-26 09:13:17,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574493369] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:17,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:17,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:13:17,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109381937] [2021-08-26 09:13:17,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:13:17,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:17,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:13:17,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:13:17,420 INFO L87 Difference]: Start difference. First operand 3223 states and 4052 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-08-26 09:13:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:17,523 INFO L93 Difference]: Finished difference Result 5208 states and 6552 transitions. [2021-08-26 09:13:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:13:17,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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 137 [2021-08-26 09:13:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:17,525 INFO L225 Difference]: With dead ends: 5208 [2021-08-26 09:13:17,525 INFO L226 Difference]: Without dead ends: 2057 [2021-08-26 09:13:17,530 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:13:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2021-08-26 09:13:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2055. [2021-08-26 09:13:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 2054 states have (on average 1.2239532619279454) internal successors, (2514), 2054 states have internal predecessors, (2514), 0 states have call successors, (0), 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-08-26 09:13:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2514 transitions. [2021-08-26 09:13:17,609 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2514 transitions. Word has length 137 [2021-08-26 09:13:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:17,609 INFO L470 AbstractCegarLoop]: Abstraction has 2055 states and 2514 transitions. [2021-08-26 09:13:17,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-08-26 09:13:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2514 transitions. [2021-08-26 09:13:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-08-26 09:13:17,610 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:17,610 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:13:17,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-26 09:13:17,610 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:17,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1143751876, now seen corresponding path program 1 times [2021-08-26 09:13:17,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:17,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475390708] [2021-08-26 09:13:17,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:17,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-26 09:13:17,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:17,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475390708] [2021-08-26 09:13:17,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475390708] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:17,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:17,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:17,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107933143] [2021-08-26 09:13:17,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:17,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:17,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:17,631 INFO L87 Difference]: Start difference. First operand 2055 states and 2514 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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-08-26 09:13:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:17,714 INFO L93 Difference]: Finished difference Result 3727 states and 4591 transitions. [2021-08-26 09:13:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:17,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 176 [2021-08-26 09:13:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:17,716 INFO L225 Difference]: With dead ends: 3727 [2021-08-26 09:13:17,716 INFO L226 Difference]: Without dead ends: 2013 [2021-08-26 09:13:17,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2021-08-26 09:13:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1935. [2021-08-26 09:13:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1934 states have (on average 1.2078593588417788) internal successors, (2336), 1934 states have internal predecessors, (2336), 0 states have call successors, (0), 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-08-26 09:13:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2336 transitions. [2021-08-26 09:13:17,793 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2336 transitions. Word has length 176 [2021-08-26 09:13:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:17,794 INFO L470 AbstractCegarLoop]: Abstraction has 1935 states and 2336 transitions. [2021-08-26 09:13:17,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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-08-26 09:13:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2336 transitions. [2021-08-26 09:13:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-08-26 09:13:17,795 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:17,795 INFO L512 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] [2021-08-26 09:13:17,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-26 09:13:17,796 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:17,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:17,796 INFO L82 PathProgramCache]: Analyzing trace with hash 709277431, now seen corresponding path program 1 times [2021-08-26 09:13:17,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:17,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543177485] [2021-08-26 09:13:17,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:17,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-26 09:13:17,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:17,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543177485] [2021-08-26 09:13:17,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543177485] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:17,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:17,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:17,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910796056] [2021-08-26 09:13:17,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:17,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:17,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:17,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:17,823 INFO L87 Difference]: Start difference. First operand 1935 states and 2336 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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-08-26 09:13:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:17,927 INFO L93 Difference]: Finished difference Result 4164 states and 5063 transitions. [2021-08-26 09:13:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:17,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 182 [2021-08-26 09:13:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:17,929 INFO L225 Difference]: With dead ends: 4164 [2021-08-26 09:13:17,929 INFO L226 Difference]: Without dead ends: 2566 [2021-08-26 09:13:17,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2021-08-26 09:13:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2213. [2021-08-26 09:13:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2212 states have (on average 1.1916817359855334) internal successors, (2636), 2212 states have internal predecessors, (2636), 0 states have call successors, (0), 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-08-26 09:13:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2636 transitions. [2021-08-26 09:13:18,043 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2636 transitions. Word has length 182 [2021-08-26 09:13:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:18,043 INFO L470 AbstractCegarLoop]: Abstraction has 2213 states and 2636 transitions. [2021-08-26 09:13:18,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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-08-26 09:13:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2636 transitions. [2021-08-26 09:13:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-08-26 09:13:18,049 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:18,049 INFO L512 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, 1] [2021-08-26 09:13:18,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-26 09:13:18,050 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:18,050 INFO L82 PathProgramCache]: Analyzing trace with hash 391755360, now seen corresponding path program 1 times [2021-08-26 09:13:18,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:18,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822108887] [2021-08-26 09:13:18,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:18,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-26 09:13:18,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:18,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822108887] [2021-08-26 09:13:18,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822108887] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:13:18,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884962648] [2021-08-26 09:13:18,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:18,237 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:13:18,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:13:18,239 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-08-26 09:13:18,268 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-08-26 09:13:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:18,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-26 09:13:18,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:13:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-26 09:13:18,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884962648] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:13:18,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:13:18,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-08-26 09:13:18,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533521501] [2021-08-26 09:13:18,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-26 09:13:18,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:18,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-26 09:13:18,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-08-26 09:13:18,998 INFO L87 Difference]: Start difference. First operand 2213 states and 2636 transitions. Second operand has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 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-08-26 09:13:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:19,959 INFO L93 Difference]: Finished difference Result 7188 states and 8534 transitions. [2021-08-26 09:13:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-26 09:13:19,960 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 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 185 [2021-08-26 09:13:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:19,966 INFO L225 Difference]: With dead ends: 7188 [2021-08-26 09:13:19,966 INFO L226 Difference]: Without dead ends: 5299 [2021-08-26 09:13:19,969 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 497.7ms TimeCoverageRelationStatistics Valid=237, Invalid=1569, Unknown=0, NotChecked=0, Total=1806 [2021-08-26 09:13:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2021-08-26 09:13:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 2902. [2021-08-26 09:13:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2901 states have (on average 1.1889003791795933) internal successors, (3449), 2901 states have internal predecessors, (3449), 0 states have call successors, (0), 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-08-26 09:13:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 3449 transitions. [2021-08-26 09:13:20,157 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 3449 transitions. Word has length 185 [2021-08-26 09:13:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:20,157 INFO L470 AbstractCegarLoop]: Abstraction has 2902 states and 3449 transitions. [2021-08-26 09:13:20,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 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-08-26 09:13:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 3449 transitions. [2021-08-26 09:13:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-08-26 09:13:20,159 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:20,159 INFO L512 BasicCegarLoop]: trace histogram [7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:13:20,180 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-08-26 09:13:20,368 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-08-26 09:13:20,369 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:20,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:20,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1085364486, now seen corresponding path program 1 times [2021-08-26 09:13:20,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:20,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294699170] [2021-08-26 09:13:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:20,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-26 09:13:20,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:20,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294699170] [2021-08-26 09:13:20,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294699170] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:13:20,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838147100] [2021-08-26 09:13:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:20,517 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:13:20,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:13:20,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:13:20,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 09:13:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:20,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-26 09:13:20,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:13:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-26 09:13:21,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838147100] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:13:21,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:13:21,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2021-08-26 09:13:21,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374232627] [2021-08-26 09:13:21,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 09:13:21,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:21,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 09:13:21,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-08-26 09:13:21,843 INFO L87 Difference]: Start difference. First operand 2902 states and 3449 transitions. Second operand has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 0 states have call successors, (0), 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-08-26 09:13:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:22,307 INFO L93 Difference]: Finished difference Result 6480 states and 7693 transitions. [2021-08-26 09:13:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 09:13:22,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 0 states have call successors, (0), 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-08-26 09:13:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:22,311 INFO L225 Difference]: With dead ends: 6480 [2021-08-26 09:13:22,311 INFO L226 Difference]: Without dead ends: 3902 [2021-08-26 09:13:22,312 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 195.4ms TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-08-26 09:13:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2021-08-26 09:13:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 3099. [2021-08-26 09:13:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 3098 states have (on average 1.185280826339574) internal successors, (3672), 3098 states have internal predecessors, (3672), 0 states have call successors, (0), 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-08-26 09:13:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 3672 transitions. [2021-08-26 09:13:22,459 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 3672 transitions. Word has length 191 [2021-08-26 09:13:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:22,459 INFO L470 AbstractCegarLoop]: Abstraction has 3099 states and 3672 transitions. [2021-08-26 09:13:22,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 0 states have call successors, (0), 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-08-26 09:13:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 3672 transitions. [2021-08-26 09:13:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-08-26 09:13:22,462 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:22,462 INFO L512 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08-26 09:13:22,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 09:13:22,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-08-26 09:13:22,664 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:22,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:22,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1258410680, now seen corresponding path program 1 times [2021-08-26 09:13:22,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:22,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134804396] [2021-08-26 09:13:22,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:22,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-08-26 09:13:22,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:22,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134804396] [2021-08-26 09:13:22,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134804396] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:22,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:22,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:22,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105744473] [2021-08-26 09:13:22,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:22,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:22,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:22,692 INFO L87 Difference]: Start difference. First operand 3099 states and 3672 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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-08-26 09:13:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:22,798 INFO L93 Difference]: Finished difference Result 4753 states and 5608 transitions. [2021-08-26 09:13:22,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:22,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 251 [2021-08-26 09:13:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:22,800 INFO L225 Difference]: With dead ends: 4753 [2021-08-26 09:13:22,800 INFO L226 Difference]: Without dead ends: 2114 [2021-08-26 09:13:22,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2021-08-26 09:13:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2081. [2021-08-26 09:13:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 2080 states have (on average 1.1576923076923078) internal successors, (2408), 2080 states have internal predecessors, (2408), 0 states have call successors, (0), 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-08-26 09:13:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2408 transitions. [2021-08-26 09:13:22,896 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2408 transitions. Word has length 251 [2021-08-26 09:13:22,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:22,896 INFO L470 AbstractCegarLoop]: Abstraction has 2081 states and 2408 transitions. [2021-08-26 09:13:22,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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-08-26 09:13:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2408 transitions. [2021-08-26 09:13:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2021-08-26 09:13:22,898 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:22,898 INFO L512 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, 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-08-26 09:13:22,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-26 09:13:22,898 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:22,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2068647826, now seen corresponding path program 1 times [2021-08-26 09:13:22,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:22,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438720316] [2021-08-26 09:13:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:22,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-08-26 09:13:22,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:22,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438720316] [2021-08-26 09:13:22,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438720316] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:22,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:22,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:22,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561544392] [2021-08-26 09:13:22,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:22,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:22,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:22,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:22,929 INFO L87 Difference]: Start difference. First operand 2081 states and 2408 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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-08-26 09:13:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:22,989 INFO L93 Difference]: Finished difference Result 2385 states and 2747 transitions. [2021-08-26 09:13:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:22,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 275 [2021-08-26 09:13:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:22,991 INFO L225 Difference]: With dead ends: 2385 [2021-08-26 09:13:22,991 INFO L226 Difference]: Without dead ends: 815 [2021-08-26 09:13:22,992 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:22,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2021-08-26 09:13:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2021-08-26 09:13:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 814 states have (on average 1.106879606879607) internal successors, (901), 814 states have internal predecessors, (901), 0 states have call successors, (0), 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-08-26 09:13:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 901 transitions. [2021-08-26 09:13:23,033 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 901 transitions. Word has length 275 [2021-08-26 09:13:23,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:23,033 INFO L470 AbstractCegarLoop]: Abstraction has 815 states and 901 transitions. [2021-08-26 09:13:23,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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-08-26 09:13:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 901 transitions. [2021-08-26 09:13:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-08-26 09:13:23,035 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:23,035 INFO L512 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, 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-08-26 09:13:23,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-26 09:13:23,035 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:23,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:23,035 INFO L82 PathProgramCache]: Analyzing trace with hash 625161699, now seen corresponding path program 1 times [2021-08-26 09:13:23,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:23,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064578692] [2021-08-26 09:13:23,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:23,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-08-26 09:13:23,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:23,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064578692] [2021-08-26 09:13:23,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064578692] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:13:23,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:13:23,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:13:23,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118718942] [2021-08-26 09:13:23,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:13:23,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:13:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:23,066 INFO L87 Difference]: Start difference. First operand 815 states and 901 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-08-26 09:13:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:23,111 INFO L93 Difference]: Finished difference Result 1159 states and 1277 transitions. [2021-08-26 09:13:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:13:23,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 277 [2021-08-26 09:13:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:23,113 INFO L225 Difference]: With dead ends: 1159 [2021-08-26 09:13:23,113 INFO L226 Difference]: Without dead ends: 745 [2021-08-26 09:13:23,113 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:13:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2021-08-26 09:13:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 737. [2021-08-26 09:13:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.0991847826086956) internal successors, (809), 736 states have internal predecessors, (809), 0 states have call successors, (0), 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-08-26 09:13:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 809 transitions. [2021-08-26 09:13:23,150 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 809 transitions. Word has length 277 [2021-08-26 09:13:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:23,151 INFO L470 AbstractCegarLoop]: Abstraction has 737 states and 809 transitions. [2021-08-26 09:13:23,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-08-26 09:13:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 809 transitions. [2021-08-26 09:13:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2021-08-26 09:13:23,152 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:13:23,152 INFO L512 BasicCegarLoop]: trace histogram [10, 6, 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, 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] [2021-08-26 09:13:23,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-26 09:13:23,152 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 09:13:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:13:23,153 INFO L82 PathProgramCache]: Analyzing trace with hash -469819346, now seen corresponding path program 1 times [2021-08-26 09:13:23,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:13:23,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568942701] [2021-08-26 09:13:23,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:23,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:13:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 237 proven. 30 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-08-26 09:13:23,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:13:23,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568942701] [2021-08-26 09:13:23,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568942701] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:13:23,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938188068] [2021-08-26 09:13:23,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:13:23,253 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:13:23,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:13:23,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:13:23,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 09:13:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:13:23,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-26 09:13:23,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:13:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 237 proven. 30 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-08-26 09:13:24,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938188068] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:13:24,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:13:24,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-08-26 09:13:24,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95741052] [2021-08-26 09:13:24,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 09:13:24,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:13:24,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 09:13:24,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-26 09:13:24,562 INFO L87 Difference]: Start difference. First operand 737 states and 809 transitions. Second operand has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 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-08-26 09:13:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:13:24,762 INFO L93 Difference]: Finished difference Result 1053 states and 1149 transitions. [2021-08-26 09:13:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 09:13:24,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 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 289 [2021-08-26 09:13:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:13:24,763 INFO L225 Difference]: With dead ends: 1053 [2021-08-26 09:13:24,763 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 09:13:24,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 117.2ms TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-08-26 09:13:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 09:13:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 09:13:24,764 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-08-26 09:13:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 09:13:24,764 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 289 [2021-08-26 09:13:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:13:24,764 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 09:13:24,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 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-08-26 09:13:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 09:13:24,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 09:13:24,766 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:13:24,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 09:13:24,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:13:24,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 09:13:24,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:24,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:25,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:25,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:25,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:25,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:25,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:26,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:26,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:26,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:27,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:27,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:27,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:27,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:27,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:27,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:27,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:28,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:28,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:28,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:13:41,427 WARN L207 SmtUtils]: Spent 5.52 s on a formula simplification. DAG size of input: 297 DAG size of output: 149 [2021-08-26 09:13:48,748 WARN L207 SmtUtils]: Spent 5.64 s on a formula simplification. DAG size of input: 303 DAG size of output: 150 [2021-08-26 09:13:56,919 WARN L207 SmtUtils]: Spent 5.51 s on a formula simplification. DAG size of input: 297 DAG size of output: 149 [2021-08-26 09:14:02,152 INFO L857 garLoopResultBuilder]: For program point L498(lines 498 502) no Hoare annotation was computed. [2021-08-26 09:14:02,152 INFO L853 garLoopResultBuilder]: At program point L234-1(lines 222 249) the Hoare annotation is: (let ((.cse27 (= ~c2_st~0 0)) (.cse39 (+ ~t_b~0 1)) (.cse35 (= ~c1_st~0 0))) (let ((.cse2 (not .cse35)) (.cse37 (not (= ~e_c~0 0))) (.cse33 (= ~c2_pc~0 0)) (.cse25 (<= ~c_t~0 .cse39)) (.cse26 (= ~wb_pc~0 1)) (.cse28 (<= .cse39 ~c_t~0)) (.cse18 (= ~c1_pc~0 1)) (.cse29 (<= .cse39 ~data~0)) (.cse30 (not (= ~r_st~0 0))) (.cse32 (<= ~data~0 .cse39)) (.cse0 (not (= 0 ~wl_st~0))) (.cse9 (not (= 2 ~wl_pc~0))) (.cse1 (not (= ~e_g~0 0))) (.cse3 (= ~d~0 0)) (.cse4 (not .cse27)) (.cse34 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (= ~wb_pc~0 0)) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse19 (not (= ~wb_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse21 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse36 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~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 .cse25 .cse2 .cse26 .cse27 .cse5 .cse7 .cse10 .cse11 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse30 .cse20 .cse31 .cse32 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse33 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse27 .cse33 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse35 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse31 .cse36 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse5 .cse7 .cse37 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse36 .cse23) (let ((.cse38 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse2 .cse4 .cse26 (= .cse38 ~data~0) .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 (= .cse38 ~c_t~0) .cse31 .cse23)) (and .cse1 .cse2 .cse3 .cse27 .cse33 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse31 .cse36 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse26 .cse5 .cse7 .cse37 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20 .cse31 .cse23) (and .cse1 .cse3 .cse27 .cse33 .cse34 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse31 .cse35 .cse36 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse25 .cse4 .cse26 .cse5 .cse7 .cse10 .cse11 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse30 .cse20 .cse31 .cse35 .cse32 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse35 .cse22 .cse23 .cse24) (and .cse1 .cse3 .cse4 .cse34 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse35 .cse36 .cse22 .cse23 .cse24)))) [2021-08-26 09:14:02,152 INFO L857 garLoopResultBuilder]: For program point L631-1(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,153 INFO L857 garLoopResultBuilder]: For program point L400(lines 400 410) no Hoare annotation was computed. [2021-08-26 09:14:02,153 INFO L857 garLoopResultBuilder]: For program point L400-2(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,153 INFO L857 garLoopResultBuilder]: For program point L301(lines 301 309) no Hoare annotation was computed. [2021-08-26 09:14:02,153 INFO L857 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2021-08-26 09:14:02,153 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 140) no Hoare annotation was computed. [2021-08-26 09:14:02,153 INFO L857 garLoopResultBuilder]: For program point L665(lines 665 673) no Hoare annotation was computed. [2021-08-26 09:14:02,153 INFO L857 garLoopResultBuilder]: For program point L599(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,153 INFO L857 garLoopResultBuilder]: For program point L566-1(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,153 INFO L857 garLoopResultBuilder]: For program point L401(lines 401 406) no Hoare annotation was computed. [2021-08-26 09:14:02,153 INFO L857 garLoopResultBuilder]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2021-08-26 09:14:02,154 INFO L853 garLoopResultBuilder]: At program point L137(lines 132 172) the Hoare annotation is: (let ((.cse22 (= ~wb_st~0 0)) (.cse24 (= ~c2_st~0 0))) (let ((.cse4 (not .cse24)) (.cse2 (+ ~t_b~0 1)) (.cse3 (not (= ~c1_st~0 0))) (.cse12 (= ~e_c~0 2)) (.cse16 (not .cse22)) (.cse17 (not (= ~r_st~0 0))) (.cse21 (= ~processed~0 0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse5 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse23 (not (= ~e_c~0 0))) (.cse8 (not (= ~r_i~0 1))) (.cse9 (not (= ~e_e~0 1))) (.cse10 (not (= ~e_wl~0 1))) (.cse11 (= ~c1_i~0 1)) (.cse13 (= ~c2_i~0 1)) (.cse14 (= ~e_f~0 2)) (.cse15 (= ~c1_pc~0 1)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (not (= ~e_wl~0 0))) (.cse20 (= ~wb_i~0 1))) (or (and .cse0 .cse1 (<= ~c_t~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse2 ~c_t~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= .cse2 ~data~0) .cse17 .cse18 .cse19 (<= ~data~0 .cse2) .cse20) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse21 .cse19 (= ~data~0 .cse2) .cse22 .cse20) (and .cse0 .cse1 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse19 (= 0 ~wl_pc~0) .cse20) (and .cse0 .cse1 .cse3 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~data~0 ~t_b~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse19 .cse20 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse23 (not (= 2 ~wl_pc~0)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20)))) [2021-08-26 09:14:02,154 INFO L853 garLoopResultBuilder]: At program point L71(lines 57 127) the Hoare annotation is: (let ((.cse26 (= ~c2_st~0 0)) (.cse29 (= ~c1_st~0 0)) (.cse31 (= ~wb_st~0 0))) (let ((.cse5 (= ~wb_pc~0 1)) (.cse20 (not .cse31)) (.cse27 (= ~c2_pc~0 0)) (.cse2 (not .cse29)) (.cse19 (= ~c1_pc~0 1)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse3 (= ~d~0 0)) (.cse4 (not .cse26)) (.cse28 (= ~c1_pc~0 0)) (.cse6 (not (= ~e_g~0 1))) (.cse7 (= ~t_b~0 0)) (.cse8 (not (= ~e_e~0 0))) (.cse9 (= ~data~0 0)) (.cse10 (not (= ~e_c~0 0))) (.cse11 (not (= 2 ~wl_pc~0))) (.cse12 (not (= ~r_i~0 1))) (.cse13 (not (= ~e_e~0 1))) (.cse30 (= ~wb_pc~0 0)) (.cse14 (not (= ~e_wl~0 1))) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse17 (= ~c2_i~0 1)) (.cse18 (= ~e_f~0 2)) (.cse21 (= ~c2_pc~0 1)) (.cse22 (= ~processed~0 0)) (.cse23 (= ~c_req_up~0 ~r_i~0)) (.cse24 (= ~wb_i~0 1)) (.cse25 (= ~r_st~0 ~e_f~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 .cse0 .cse1 .cse2 .cse3 .cse5 .cse26 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse5 .cse26 .cse27 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse29 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse29 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse26 .cse27 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse22 .cse29 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse26 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse22 .cse29 .cse31 .cse23 .cse24 .cse25)))) [2021-08-26 09:14:02,154 INFO L857 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2021-08-26 09:14:02,154 INFO L853 garLoopResultBuilder]: At program point L468(lines 461 478) the Hoare annotation is: (let ((.cse0 (= ~c2_st~0 0)) (.cse1 (not (= ~r_i~0 1))) (.cse2 (= ~e_g~0 ~e_f~0)) (.cse3 (= ~c1_i~0 1)) (.cse4 (= ~e_c~0 2)) (.cse5 (= ~c2_i~0 1)) (.cse6 (= ~e_wl~0 ~e_c~0)) (.cse7 (= ~e_f~0 2)) (.cse8 (= ~e_e~0 ~e_f~0)) (.cse9 (= ~c1_st~0 0)) (.cse10 (= 0 ~wl_pc~0)) (.cse11 (= ~wb_st~0 0)) (.cse12 (= ~c_req_up~0 ~r_i~0)) (.cse13 (= ~wb_i~0 1))) (or (and (not (= 0 ~wl_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~d~0 0) .cse0 (= ~c2_pc~0 0) (= ~c1_pc~0 0) (= ~t_b~0 0) (= ~data~0 0) .cse1 (= ~wb_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~processed~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~r_st~0 ~e_f~0)))) [2021-08-26 09:14:02,154 INFO L857 garLoopResultBuilder]: For program point L469(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,154 INFO L857 garLoopResultBuilder]: For program point L436-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,154 INFO L857 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-08-26 09:14:02,154 INFO L857 garLoopResultBuilder]: For program point L304-1(lines 290 388) no Hoare annotation was computed. [2021-08-26 09:14:02,154 INFO L857 garLoopResultBuilder]: For program point L668(lines 668 672) no Hoare annotation was computed. [2021-08-26 09:14:02,154 INFO L857 garLoopResultBuilder]: For program point L668-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,154 INFO L857 garLoopResultBuilder]: For program point L470(lines 470 474) no Hoare annotation was computed. [2021-08-26 09:14:02,154 INFO L857 garLoopResultBuilder]: For program point L636-1(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,154 INFO L857 garLoopResultBuilder]: For program point L538(line 538) no Hoare annotation was computed. [2021-08-26 09:14:02,154 INFO L857 garLoopResultBuilder]: For program point L571-1(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,155 INFO L853 garLoopResultBuilder]: At program point L373(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse20 (= ~c1_st~0 0)) (.cse40 (+ ~t_b~0 1)) (.cse47 (+ ~t_b~0 2))) (let ((.cse43 (= 2 ~wl_pc~0)) (.cse45 (= .cse47 ~data~0)) (.cse33 (= ~data~0 .cse40)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse27 (not .cse20)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse38 (= ~data~0 ~t_b~0)) (.cse17 (= ~e_f~0 2)) (.cse29 (= ~c1_pc~0 1)) (.cse30 (not .cse21)) (.cse32 (not (= ~r_st~0 0))) (.cse18 (= ~c2_pc~0 1)) (.cse31 (not (= ~e_wl~0 0))) (.cse23 (= ~wb_i~0 1)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0))) (let ((.cse46 (= .cse47 ~c~0)) (.cse48 (= .cse47 ~c_t~0)) (.cse41 (<= .cse40 ~c~0)) (.cse42 (<= ~c~0 .cse40)) (.cse54 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse40)) (.cse35 (<= .cse40 ~c_t~0)) (.cse36 (<= .cse40 ~data~0)) (.cse37 (<= ~data~0 .cse40)) (.cse49 (<= 1 ~c~0)) (.cse50 (<= 1 ~c_t~0)) (.cse51 (<= ~c_t~0 1)) (.cse52 (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse33 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39))) (.cse53 (<= ~c~0 1)) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse43)) (.cse2 (= ~d~0 0)) (.cse4 (= ~c1_pc~0 0)) (.cse6 (= ~t_b~0 0)) (.cse8 (= ~data~0 0)) (.cse19 (= ~processed~0 0)) (.cse44 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse24 (= ~r_st~0 ~e_f~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 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse33 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse40) .cse10 .cse41 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse42 (<= .cse40 ~d~0) .cse43 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse44 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse46 .cse30 .cse32 .cse18 (= .cse47 ~d~0) .cse48 .cse31 .cse43 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse46 .cse30 .cse18 .cse48 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse54 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse44 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse48 .cse31 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse44 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse41 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse42 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse54 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse2 .cse6 .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse44 .cse22 .cse23 .cse24))))) [2021-08-26 09:14:02,155 INFO L857 garLoopResultBuilder]: For program point L506-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,155 INFO L857 garLoopResultBuilder]: For program point L441-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,155 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 121) no Hoare annotation was computed. [2021-08-26 09:14:02,155 INFO L853 garLoopResultBuilder]: At program point L343(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse42 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse40 (<= .cse33 ~c~0)) (.cse41 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse38 (= ~data~0 ~t_b~0)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse33)) (.cse35 (<= .cse33 ~c_t~0)) (.cse36 (<= .cse33 ~data~0)) (.cse37 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse42)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~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 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse41 (<= .cse33 ~d~0) .cse42 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse41 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-08-26 09:14:02,155 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 186) no Hoare annotation was computed. [2021-08-26 09:14:02,155 INFO L857 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2021-08-26 09:14:02,155 INFO L857 garLoopResultBuilder]: For program point L608(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,155 INFO L857 garLoopResultBuilder]: For program point L641-1(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,155 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 384) no Hoare annotation was computed. [2021-08-26 09:14:02,155 INFO L857 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2021-08-26 09:14:02,155 INFO L857 garLoopResultBuilder]: For program point L609(lines 609 613) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L576-1(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L411-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 120) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L853 garLoopResultBuilder]: At program point L709(lines 684 711) the Hoare annotation is: (= ~c2_i~0 1) [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L544(lines 544 554) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L511-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L544-2(lines 544 554) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L853 garLoopResultBuilder]: At program point L313(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse41 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse37 (<= .cse33 ~c~0)) (.cse40 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse34 (= ~data~0 ~t_b~0)) (.cse35 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse36 (<= ~c_t~0 .cse33)) (.cse38 (<= .cse33 ~c_t~0)) (.cse39 (<= .cse33 ~data~0)) (.cse42 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse41)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~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 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse34 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse35) (and .cse1 .cse36 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse37 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse32 .cse18 .cse31 .cse40 (<= .cse33 ~d~0) .cse41 .cse42 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse36 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse32 .cse18 .cse31 .cse42 .cse23) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse41 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse39 .cse32 .cse18 .cse19 .cse31 .cse42 .cse21 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse36 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse37 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse18 .cse31 .cse40 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse34 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse35)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse36 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse32 .cse18 .cse31 .cse20 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 185) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L853 garLoopResultBuilder]: At program point L16(lines 57 127) the Hoare annotation is: (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_e~0 1))) (.cse7 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse9 (= ~e_c~0 2)) (.cse10 (= ~c2_i~0 1)) (.cse11 (= ~e_f~0 2)) (.cse12 (= ~c1_pc~0 1)) (.cse13 (not (= ~wb_st~0 0))) (.cse14 (= ~c2_pc~0 1)) (.cse15 (not (= ~e_wl~0 0))) (.cse16 (= ~wb_i~0 1))) (or (and .cse0 .cse1 (not (= ~c1_st~0 0)) (= ~d~0 0) (not (= ~c2_st~0 0)) .cse2 .cse3 (= ~t_b~0 0) .cse4 (= ~data~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~processed~0 0) .cse15 (= ~c_req_up~0 ~r_i~0) .cse16 (= ~r_st~0 ~e_f~0)) (and (let ((.cse17 (not (= ~r_st~0 0)))) (or (and .cse0 .cse1 .cse2 (= (+ ~t_b~0 2) ~data~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~data~0 ~t_b~0) .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 (= ~data~0 (+ ~t_b~0 1)) .cse16))) (= 2 ~wl_pc~0)))) [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L545(lines 545 550) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L479(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L446-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L857 garLoopResultBuilder]: For program point L347(lines 347 354) no Hoare annotation was computed. [2021-08-26 09:14:02,156 INFO L853 garLoopResultBuilder]: At program point L182(lines 177 217) the Hoare annotation is: (let ((.cse19 (= ~c1_st~0 0)) (.cse23 (= ~wb_st~0 0))) (let ((.cse14 (not .cse23)) (.cse22 (not .cse19)) (.cse2 (not (= ~c2_st~0 0))) (.cse10 (= ~e_c~0 2)) (.cse15 (not (= ~r_st~0 0))) (.cse17 (= ~processed~0 0)) (.cse21 (+ ~t_b~0 1)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse3 (= ~wb_pc~0 1)) (.cse4 (not (= ~e_g~0 1))) (.cse5 (not (= ~e_e~0 0))) (.cse24 (not (= ~e_c~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse8 (not (= ~e_wl~0 1))) (.cse9 (= ~c1_i~0 1)) (.cse11 (= ~c2_i~0 1)) (.cse12 (= ~e_f~0 2)) (.cse13 (= ~c1_pc~0 1)) (.cse16 (= ~c2_pc~0 1)) (.cse18 (not (= ~e_wl~0 0))) (.cse20 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~data~0 ~t_b~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (and .cse0 .cse1 (<= ~c_t~0 .cse21) .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse21 ~c_t~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= .cse21 ~data~0) .cse15 .cse16 .cse18 (<= ~data~0 .cse21) .cse20) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 (= ~data~0 .cse21) .cse23 .cse20) (and .cse0 .cse1 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse18 (= 0 ~wl_pc~0) .cse20) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse24 (not (= 2 ~wl_pc~0)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse16 .cse18 .cse20)))) [2021-08-26 09:14:02,157 INFO L853 garLoopResultBuilder]: At program point L678(lines 395 683) the Hoare annotation is: (= ~c2_i~0 1) [2021-08-26 09:14:02,157 INFO L857 garLoopResultBuilder]: For program point L480(lines 480 484) no Hoare annotation was computed. [2021-08-26 09:14:02,157 INFO L857 garLoopResultBuilder]: For program point L646-1(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,157 INFO L853 garLoopResultBuilder]: At program point L151-1(lines 132 172) the Hoare annotation is: (let ((.cse34 (= ~wb_st~0 0)) (.cse31 (= ~c2_st~0 0)) (.cse26 (+ ~t_b~0 1))) (let ((.cse28 (<= .cse26 ~data~0)) (.cse30 (<= ~data~0 .cse26)) (.cse35 (not (= ~e_c~0 0))) (.cse10 (not (= 2 ~wl_pc~0))) (.cse3 (= ~d~0 0)) (.cse32 (= ~c2_pc~0 0)) (.cse7 (= ~t_b~0 0)) (.cse9 (= ~data~0 0)) (.cse33 (= ~wb_pc~0 0)) (.cse20 (= ~processed~0 0)) (.cse25 (= 0 ~wl_pc~0)) (.cse23 (= ~r_st~0 ~e_f~0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse4 (not .cse31)) (.cse5 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse8 (not (= ~e_e~0 0))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse27 (= ~c1_pc~0 1)) (.cse18 (not .cse34)) (.cse29 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse24 (not (= ~e_wl~0 0))) (.cse21 (= ~c_req_up~0 ~r_i~0)) (.cse22 (= ~wb_i~0 1))) (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) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse21 .cse22 .cse23) (and .cse0 .cse1 (<= ~c_t~0 .cse26) .cse2 .cse4 .cse5 .cse6 .cse8 .cse11 .cse12 (<= .cse26 ~c_t~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse28 .cse29 .cse19 .cse24 .cse30 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse34 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse6 .cse8 .cse35 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse24 .cse25 .cse22) (and .cse0 .cse1 .cse2 .cse5 .cse31 .cse6 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse28 .cse29 .cse19 .cse20 .cse24 .cse30 .cse34 .cse22) (and .cse1 .cse2 .cse3 .cse5 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse24 .cse25 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 (= (+ ~t_b~0 2) ~data~0) .cse6 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse29 .cse19 .cse20 .cse24 .cse34 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse34 .cse21 .cse22 .cse23) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse24 .cse25 .cse34 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse5 .cse6 .cse8 .cse35 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse27 .cse19 .cse24 .cse22) (and .cse1 .cse2 .cse3 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse24 .cse25 .cse34 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse29 .cse19 .cse24 .cse21 .cse22)))) [2021-08-26 09:14:02,157 INFO L857 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2021-08-26 09:14:02,157 INFO L857 garLoopResultBuilder]: For program point L85-1(lines 79 122) no Hoare annotation was computed. [2021-08-26 09:14:02,157 INFO L857 garLoopResultBuilder]: For program point L416-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,157 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 09:14:02,157 INFO L857 garLoopResultBuilder]: For program point L317(lines 317 324) no Hoare annotation was computed. [2021-08-26 09:14:02,157 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2021-08-26 09:14:02,157 INFO L857 garLoopResultBuilder]: For program point L582(lines 582 586) no Hoare annotation was computed. [2021-08-26 09:14:02,157 INFO L857 garLoopResultBuilder]: For program point L516-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,157 INFO L857 garLoopResultBuilder]: For program point L451-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,158 INFO L857 garLoopResultBuilder]: For program point L154(lines 154 162) no Hoare annotation was computed. [2021-08-26 09:14:02,158 INFO L857 garLoopResultBuilder]: For program point L154-1(lines 154 162) no Hoare annotation was computed. [2021-08-26 09:14:02,158 INFO L857 garLoopResultBuilder]: For program point L617(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,158 INFO L857 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2021-08-26 09:14:02,158 INFO L857 garLoopResultBuilder]: For program point L618(lines 618 622) no Hoare annotation was computed. [2021-08-26 09:14:02,158 INFO L857 garLoopResultBuilder]: For program point L651-1(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,158 INFO L857 garLoopResultBuilder]: For program point L421-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,158 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 09:14:02,158 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 231) no Hoare annotation was computed. [2021-08-26 09:14:02,158 INFO L857 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2021-08-26 09:14:02,159 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2021-08-26 09:14:02,159 INFO L857 garLoopResultBuilder]: For program point L488(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,159 INFO L857 garLoopResultBuilder]: For program point L521-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,159 INFO L853 garLoopResultBuilder]: At program point L389(lines 281 394) the Hoare annotation is: (let ((.cse32 (+ ~t_b~0 2))) (let ((.cse31 (= .cse32 ~data~0)) (.cse22 (+ ~t_b~0 1)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse4 (not (= ~c2_st~0 0))) (.cse5 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse8 (not (= ~e_e~0 0))) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~e_wl~0 1))) (.cse13 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse15 (= ~c2_i~0 1)) (.cse16 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~wb_st~0 0))) (.cse25 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse26 (not (= ~e_wl~0 0))) (.cse21 (= ~wb_i~0 1))) (let ((.cse9 (not (= 2 ~wl_pc~0))) (.cse24 (not (= ~e_c~0 0))) (.cse3 (= ~d~0 0)) (.cse7 (= ~t_b~0 0)) (.cse27 (<= 1 ~c~0)) (.cse28 (<= 1 ~c_t~0)) (.cse29 (<= ~c_t~0 1)) (.cse23 (or (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse31 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 (= ~data~0 .cse22) .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~data~0 ~t_b~0) .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 .cse21 (= ULTIMATE.start_write_loop_~t~0 ~data~0)))) (.cse30 (<= ~c~0 1)) (.cse20 (= ~c_req_up~0 ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~data~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ~processed~0 0) .cse20 .cse21 (= ~r_st~0 ~e_f~0)) (and (<= ~c_t~0 .cse22) (<= .cse22 ~c_t~0) .cse23 (<= .cse22 ~data~0) (<= ~data~0 .cse22)) (and .cse0 .cse1 .cse5 .cse6 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse25 .cse19 .cse26 .cse21) (and (<= 1 ~d~0) .cse7 (<= ~d~0 1) .cse27 .cse28 .cse29 .cse23 .cse30) (and .cse0 .cse1 .cse6 .cse8 .cse24 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse26 (= 0 ~wl_pc~0) .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse31 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 (= .cse32 ~c_t~0) .cse26 .cse21) (and .cse3 .cse7 .cse27 .cse28 .cse29 .cse23 .cse30) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 .cse20 .cse21))))) [2021-08-26 09:14:02,159 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 274) no Hoare annotation was computed. [2021-08-26 09:14:02,159 INFO L853 garLoopResultBuilder]: At program point L588(lines 581 598) the Hoare annotation is: (let ((.cse5 (not (= ~e_c~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse17 (not (= ~c1_st~0 0))) (.cse18 (not (= ~c2_st~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse16 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse9 (= ~c2_i~0 1)) (.cse10 (= ~e_f~0 2)) (.cse11 (= ~c1_pc~0 1)) (.cse20 (not (= ~wb_st~0 0))) (.cse12 (not (= ~r_st~0 0))) (.cse13 (= ~c2_pc~0 1)) (.cse14 (not (= ~e_wl~0 0))) (.cse15 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 2 ~wl_pc~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse14 (= 0 ~wl_pc~0) .cse15) (let ((.cse19 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse17 .cse18 .cse2 (= .cse19 ~data~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 (= .cse19 ~c~0) .cse20 .cse12 .cse13 (= .cse19 ~c_t~0) .cse14 .cse15)) (let ((.cse21 (+ ~t_b~0 1))) (and .cse0 .cse1 (<= ~c_t~0 .cse21) .cse17 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse21 ~c~0) .cse7 (<= .cse21 ~c_t~0) .cse16 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 (= ~data~0 .cse21) (<= ~c~0 .cse21) .cse15)) (and .cse0 .cse1 .cse17 .cse18 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 (= ~e_c~0 2) .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15))) [2021-08-26 09:14:02,159 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-08-26 09:14:02,159 INFO L857 garLoopResultBuilder]: For program point L456-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,159 INFO L857 garLoopResultBuilder]: For program point L291(lines 290 388) no Hoare annotation was computed. [2021-08-26 09:14:02,159 INFO L857 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2021-08-26 09:14:02,159 INFO L857 garLoopResultBuilder]: For program point L589(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,159 INFO L857 garLoopResultBuilder]: For program point L556(lines 556 560) no Hoare annotation was computed. [2021-08-26 09:14:02,159 INFO L857 garLoopResultBuilder]: For program point L556-2(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,160 INFO L853 garLoopResultBuilder]: At program point L358(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse42 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse40 (<= .cse33 ~c~0)) (.cse41 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse38 (= ~data~0 ~t_b~0)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse33)) (.cse35 (<= .cse33 ~c_t~0)) (.cse36 (<= .cse33 ~data~0)) (.cse37 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse42)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~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 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse41 (<= .cse33 ~d~0) .cse42 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse47 .cse31 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse41 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-08-26 09:14:02,160 INFO L857 garLoopResultBuilder]: For program point L226(lines 226 230) no Hoare annotation was computed. [2021-08-26 09:14:02,160 INFO L857 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2021-08-26 09:14:02,160 INFO L857 garLoopResultBuilder]: For program point L61(lines 61 69) no Hoare annotation was computed. [2021-08-26 09:14:02,160 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 09:14:02,160 INFO L857 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-08-26 09:14:02,160 INFO L853 garLoopResultBuilder]: At program point L227(lines 222 249) the Hoare annotation is: (let ((.cse22 (= ~c2_st~0 0)) (.cse24 (= ~c1_st~0 0))) (let ((.cse13 (not .cse24)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse14 (not .cse22)) (.cse15 (= ~wb_pc~0 1)) (.cse2 (not (= ~e_g~0 1))) (.cse3 (not (= ~e_e~0 0))) (.cse4 (not (= ~e_c~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_e~0 1))) (.cse7 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse9 (= ~c2_i~0 1)) (.cse10 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~wb_st~0 0))) (.cse19 (not (= ~r_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse21 (= ~processed~0 0)) (.cse11 (not (= ~e_wl~0 0))) (.cse23 (+ ~t_b~0 1)) (.cse12 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ~wl_pc~0) .cse12) (and .cse0 .cse1 .cse13 .cse14 .cse15 (= (+ ~t_b~0 2) ~data~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 .cse19 .cse20 .cse21 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse15 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 (<= .cse23 ~data~0) .cse19 .cse20 .cse21 .cse11 (<= ~data~0 .cse23) .cse12) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 (not (= 2 ~wl_pc~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse20 .cse11 .cse12) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 .cse19 .cse20 .cse21 .cse11 (= ~data~0 .cse23) .cse24 .cse12)))) [2021-08-26 09:14:02,160 INFO L857 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2021-08-26 09:14:02,161 INFO L853 garLoopResultBuilder]: At program point L62(lines 57 127) the Hoare annotation is: (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse4 (not (= ~e_g~0 1))) (.cse5 (not (= ~e_e~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse8 (not (= ~e_wl~0 1))) (.cse9 (= ~c1_i~0 1)) (.cse10 (= ~e_c~0 2)) (.cse11 (= ~c2_i~0 1)) (.cse12 (= ~e_f~0 2)) (.cse13 (= ~c1_pc~0 1)) (.cse14 (not (= ~wb_st~0 0))) (.cse15 (not (= ~r_st~0 0))) (.cse16 (= ~c2_pc~0 1)) (.cse17 (not (= ~e_wl~0 0))) (.cse18 (= 2 ~wl_pc~0)) (.cse19 (= ~wb_i~0 1))) (or (let ((.cse3 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse2 (= .cse3 ~data~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= .cse3 ~c~0) .cse14 .cse15 .cse16 (= .cse3 ~d~0) (= .cse3 ~c_t~0) .cse17 .cse18 .cse19)) (let ((.cse20 (+ ~t_b~0 1))) (and .cse0 .cse1 (<= ~c_t~0 .cse20) .cse2 .cse4 .cse5 (<= ~d~0 .cse20) .cse6 (<= .cse20 ~c~0) .cse7 (<= .cse20 ~c_t~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= .cse20 ~data~0) .cse15 .cse16 .cse17 (<= ~c~0 .cse20) (<= .cse20 ~d~0) .cse18 (<= ~data~0 .cse20) .cse19)))) [2021-08-26 09:14:02,161 INFO L857 garLoopResultBuilder]: For program point L426-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,161 INFO L857 garLoopResultBuilder]: For program point L526-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,161 INFO L853 garLoopResultBuilder]: At program point L328(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse42 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse40 (<= .cse33 ~c~0)) (.cse41 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse38 (= ~data~0 ~t_b~0)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse33)) (.cse35 (<= .cse33 ~c_t~0)) (.cse36 (<= .cse33 ~data~0)) (.cse37 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse42)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~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 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse41 (<= .cse33 ~d~0) .cse42 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse41 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-08-26 09:14:02,161 INFO L857 garLoopResultBuilder]: For program point L295(lines 295 311) no Hoare annotation was computed. [2021-08-26 09:14:02,161 INFO L853 garLoopResultBuilder]: At program point L196-1(lines 177 217) the Hoare annotation is: (let ((.cse20 (= ~wb_st~0 0)) (.cse19 (= ~c1_st~0 0))) (let ((.cse18 (+ ~t_b~0 1)) (.cse32 (= ~wb_pc~0 0)) (.cse27 (= 0 ~wl_pc~0)) (.cse33 (not (= ~e_c~0 0))) (.cse30 (not .cse19)) (.cse13 (= ~c1_pc~0 1)) (.cse14 (not (= ~r_st~0 0))) (.cse15 (= ~c2_pc~0 1)) (.cse17 (not (= ~e_wl~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse22 (= ~d~0 0)) (.cse2 (not (= ~c2_st~0 0))) (.cse3 (= ~wb_pc~0 1)) (.cse23 (= ~c1_pc~0 0)) (.cse4 (not (= ~e_g~0 1))) (.cse24 (= ~t_b~0 0)) (.cse5 (not (= ~e_e~0 0))) (.cse25 (= ~data~0 0)) (.cse31 (not (= 2 ~wl_pc~0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse8 (not (= ~e_wl~0 1))) (.cse9 (= ~c1_i~0 1)) (.cse10 (= ~e_c~0 2)) (.cse11 (= ~c2_i~0 1)) (.cse12 (= ~e_f~0 2)) (.cse26 (not .cse20)) (.cse16 (= ~processed~0 0)) (.cse28 (= ~c_req_up~0 ~r_i~0)) (.cse21 (= ~wb_i~0 1)) (.cse29 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~data~0 .cse18) .cse19 .cse20 .cse21) (and .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse16 .cse17 .cse19 .cse27 .cse28 .cse21 .cse29) (and .cse0 .cse1 (<= ~c_t~0 .cse18) .cse30 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse18 ~c_t~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 (<= .cse18 ~data~0) .cse14 .cse15 .cse17 (<= ~data~0 .cse18) .cse21) (and .cse0 .cse1 .cse30 .cse22 .cse2 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse20 .cse28 .cse21 .cse29) (and .cse1 .cse30 .cse22 .cse2 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse27 .cse20 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse22 .cse2 .cse23 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse19 .cse20 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse4 .cse5 .cse33 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17 .cse27 .cse21) (and .cse1 .cse22 .cse2 .cse23 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28 .cse21 .cse29) (and .cse1 .cse30 .cse22 .cse2 .cse3 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse16 .cse17 .cse27 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse30 .cse2 .cse3 (= (+ ~t_b~0 2) ~data~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse0 .cse1 .cse30 .cse22 .cse2 .cse3 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse16 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse33 .cse31 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 .cse21) (and .cse0 .cse1 .cse30 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse17 .cse28 .cse21) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse16 .cse19 .cse28 .cse21 .cse29)))) [2021-08-26 09:14:02,162 INFO L857 garLoopResultBuilder]: For program point L64(lines 64 68) no Hoare annotation was computed. [2021-08-26 09:14:02,162 INFO L857 garLoopResultBuilder]: For program point L659(lines 659 675) no Hoare annotation was computed. [2021-08-26 09:14:02,162 INFO L857 garLoopResultBuilder]: For program point L626-1(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,162 INFO L857 garLoopResultBuilder]: For program point L362(lines 362 369) no Hoare annotation was computed. [2021-08-26 09:14:02,162 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 09:14:02,162 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2021-08-26 09:14:02,162 INFO L857 garLoopResultBuilder]: For program point L561-1(lines 537 677) no Hoare annotation was computed. [2021-08-26 09:14:02,162 INFO L857 garLoopResultBuilder]: For program point L462(lines 462 466) no Hoare annotation was computed. [2021-08-26 09:14:02,162 INFO L853 garLoopResultBuilder]: At program point L264(lines 257 274) the Hoare annotation is: (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse13 (not (= ~c1_st~0 0))) (.cse14 (not (= ~c2_st~0 0))) (.cse15 (= ~wb_pc~0 1)) (.cse2 (not (= ~e_g~0 1))) (.cse3 (not (= ~e_e~0 0))) (.cse4 (not (= ~e_c~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_wl~0 1))) (.cse7 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse8 (= ~c2_i~0 1)) (.cse9 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~wb_st~0 0))) (.cse19 (not (= ~r_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse10 (not (= ~e_wl~0 0))) (.cse11 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ~wl_pc~0) .cse11) (let ((.cse12 (+ ~t_b~0 1))) (and .cse0 .cse1 (<= ~c_t~0 .cse12) .cse13 .cse14 .cse15 .cse2 .cse3 .cse4 (<= ~d~0 .cse12) .cse5 (<= .cse12 ~c~0) (<= .cse12 ~c_t~0) .cse6 .cse7 .cse16 .cse8 .cse9 .cse17 .cse18 (<= .cse12 ~data~0) .cse19 .cse20 .cse10 (<= ~c~0 .cse12) (<= .cse12 ~d~0) (<= ~data~0 .cse12) .cse11)) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 (not (= 2 ~wl_pc~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse19 .cse20 .cse10 .cse11) (let ((.cse21 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse13 .cse14 .cse15 (= .cse21 ~data~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse17 (= .cse21 ~c~0) .cse18 .cse19 .cse20 (= .cse21 ~d~0) (= .cse21 ~c_t~0) .cse10 .cse11)))) [2021-08-26 09:14:02,163 INFO L857 garLoopResultBuilder]: For program point L298(lines 298 310) no Hoare annotation was computed. [2021-08-26 09:14:02,163 INFO L857 garLoopResultBuilder]: For program point L265(lines 257 274) no Hoare annotation was computed. [2021-08-26 09:14:02,163 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2021-08-26 09:14:02,163 INFO L857 garLoopResultBuilder]: For program point L199-1(lines 199 207) no Hoare annotation was computed. [2021-08-26 09:14:02,163 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 141) no Hoare annotation was computed. [2021-08-26 09:14:02,163 INFO L857 garLoopResultBuilder]: For program point L662(lines 662 674) no Hoare annotation was computed. [2021-08-26 09:14:02,163 INFO L857 garLoopResultBuilder]: For program point L497(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,163 INFO L857 garLoopResultBuilder]: For program point L431-1(lines 398 682) no Hoare annotation was computed. [2021-08-26 09:14:02,163 INFO L857 garLoopResultBuilder]: For program point L332(lines 332 339) no Hoare annotation was computed. [2021-08-26 09:14:02,163 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2021-08-26 09:14:02,163 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 204) no Hoare annotation was computed. [2021-08-26 09:14:02,166 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 09:14:02,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:14:02 BoogieIcfgContainer [2021-08-26 09:14:02,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 09:14:02,273 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 09:14:02,273 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 09:14:02,273 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 09:14:02,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:13:09" (3/4) ... [2021-08-26 09:14:02,276 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 09:14:02,290 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 09:14:02,290 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 09:14:02,291 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 09:14:02,291 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 09:14:02,374 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 09:14:02,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 09:14:02,376 INFO L168 Benchmark]: Toolchain (without parser) took 53402.68 ms. Allocated memory was 58.7 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 37.4 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. [2021-08-26 09:14:02,376 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 58.7 MB. Free memory was 40.6 MB in the beginning and 40.6 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 09:14:02,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.38 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 37.1 MB in the beginning and 52.7 MB in the end (delta: -15.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 09:14:02,377 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.04 ms. Allocated memory is still 71.3 MB. Free memory was 52.7 MB in the beginning and 50.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 09:14:02,377 INFO L168 Benchmark]: Boogie Preprocessor took 34.13 ms. Allocated memory is still 71.3 MB. Free memory was 50.4 MB in the beginning and 48.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 09:14:02,377 INFO L168 Benchmark]: RCFGBuilder took 568.99 ms. Allocated memory is still 71.3 MB. Free memory was 48.3 MB in the beginning and 42.8 MB in the end (delta: 5.5 MB). Peak memory consumption was 19.3 MB. Max. memory is 16.1 GB. [2021-08-26 09:14:02,377 INFO L168 Benchmark]: TraceAbstraction took 52417.92 ms. Allocated memory was 71.3 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 42.3 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. [2021-08-26 09:14:02,378 INFO L168 Benchmark]: Witness Printer took 102.47 ms. Allocated memory is still 2.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-08-26 09:14:02,379 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.14 ms. Allocated memory is still 58.7 MB. Free memory was 40.6 MB in the beginning and 40.6 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 245.38 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 37.1 MB in the beginning and 52.7 MB in the end (delta: -15.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 29.04 ms. Allocated memory is still 71.3 MB. Free memory was 52.7 MB in the beginning and 50.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.13 ms. Allocated memory is still 71.3 MB. Free memory was 50.4 MB in the beginning and 48.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 568.99 ms. Allocated memory is still 71.3 MB. Free memory was 48.3 MB in the beginning and 42.8 MB in the end (delta: 5.5 MB). Peak memory consumption was 19.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 52417.92 ms. Allocated memory was 71.3 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 42.3 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. * Witness Printer took 102.47 ms. Allocated memory is still 2.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: 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, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52258.9ms, OverallIterations: 37, TraceHistogramMax: 10, EmptinessCheckTime: 83.3ms, AutomataDifference: 5701.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 37182.4ms, InitialAbstractionConstructionTime: 7.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7966 SDtfs, 10702 SDslu, 14350 SDs, 0 SdLazy, 1550 SolverSat, 298 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 880.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 906 GetRequests, 765 SyntacticMatches, 4 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 960.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5290occurred in iteration=21, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3531.7ms AutomataMinimizationTime, 37 MinimizatonAttempts, 7464 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 867 NumberOfFragments, 21159 HoareAnnotationTreeSize, 20 FomulaSimplifications, 28919915 FormulaSimplificationTreeSizeReduction, 4337.3ms HoareSimplificationTime, 20 FomulaSimplificationsInter, 1256104 FormulaSimplificationTreeSizeReductionInter, 32813.9ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 127.4ms SsaConstructionTime, 418.8ms SatisfiabilityAnalysisTime, 3860.6ms InterpolantComputationTime, 4397 NumberOfCodeBlocks, 4397 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4357 ConstructedInterpolants, 0 QuantifiedInterpolants, 11459 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1821 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 2353/2774 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: 395]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) && 2 == wl_pc) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((!(0 == wl_st) && c2_st == 0) && !(r_i == 1)) && e_g == e_f) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_wl == e_c) && e_f == 2) && e_e == e_f) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) || (((((((((((((((((((((d == 0 && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && t_b == 0) && data == 0) && !(r_i == 1)) && wb_pc == 0) && e_g == e_f) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_wl == e_c) && e_f == 2) && processed == 0) && e_e == e_f) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c1_st == 0) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && c <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c1_st == 0) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1) || ((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_i == 1) && t == data)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_i == 1) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1) || (((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((c_t <= t_b + 1 && t_b + 1 <= c_t) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && t_b + 1 <= data) && data <= t_b + 1)) || (((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((d == 0 && t_b == 0) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1) || (((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((d == 0 && t_b == 0) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) RESULT: Ultimate proved your program to be correct! [2021-08-26 09:14:02,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...