./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.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/toy2.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 0f721563b23ef637d292551ef1a662f821e744b5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:52:53,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:52:53,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:52:53,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:52:53,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:52:53,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:52:53,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:52:53,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:52:53,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:52:53,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:52:53,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:52:53,230 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:52:53,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:52:53,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:52:53,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:52:53,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:52:53,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:52:53,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:52:53,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:52:53,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:52:53,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:52:53,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:52:53,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:52:53,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:52:53,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:52:53,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:52:53,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:52:53,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:52:53,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:52:53,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:52:53,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:52:53,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:52:53,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:52:53,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:52:53,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:52:53,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:52:53,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:52:53,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:52:53,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:52:53,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:52:53,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:52:53,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:52:53,321 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:52:53,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:52:53,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:52:53,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:52:53,326 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:52:53,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:52:53,326 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:52:53,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:52:53,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:52:53,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:52:53,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:52:53,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:52:53,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:52:53,329 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:52:53,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:52:53,330 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:52:53,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:52:53,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:52:53,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:52:53,331 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:52:53,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:52:53,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:52:53,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:52:53,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:52:53,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:52:53,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:52:53,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:52:53,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:52:53,333 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:52:53,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 0f721563b23ef637d292551ef1a662f821e744b5 [2020-10-20 01:52:53,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:52:53,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:52:53,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:52:53,588 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:52:53,588 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:52:53,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2020-10-20 01:52:53,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4fe1b154/604246eefce64b3a80f51d4b1978235c/FLAGfec8971d1 [2020-10-20 01:52:54,156 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:52:54,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2020-10-20 01:52:54,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4fe1b154/604246eefce64b3a80f51d4b1978235c/FLAGfec8971d1 [2020-10-20 01:52:54,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4fe1b154/604246eefce64b3a80f51d4b1978235c [2020-10-20 01:52:54,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:52:54,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:52:54,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:52:54,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:52:54,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:52:54,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:52:54" (1/1) ... [2020-10-20 01:52:54,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be20985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:54, skipping insertion in model container [2020-10-20 01:52:54,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:52:54" (1/1) ... [2020-10-20 01:52:54,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:52:54,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:52:54,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:52:54,913 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:52:54,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:52:55,002 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:52:55,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55 WrapperNode [2020-10-20 01:52:55,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:52:55,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:52:55,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:52:55,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:52:55,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55" (1/1) ... [2020-10-20 01:52:55,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55" (1/1) ... [2020-10-20 01:52:55,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:52:55,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:52:55,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:52:55,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:52:55,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55" (1/1) ... [2020-10-20 01:52:55,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55" (1/1) ... [2020-10-20 01:52:55,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55" (1/1) ... [2020-10-20 01:52:55,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55" (1/1) ... [2020-10-20 01:52:55,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55" (1/1) ... [2020-10-20 01:52:55,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55" (1/1) ... [2020-10-20 01:52:55,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55" (1/1) ... [2020-10-20 01:52:55,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:52:55,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:52:55,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:52:55,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:52:55,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:52:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:52:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:52:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:52:55,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:52:55,923 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:52:55,924 INFO L298 CfgBuilder]: Removed 28 assume(true) statements. [2020-10-20 01:52:55,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:52:55 BoogieIcfgContainer [2020-10-20 01:52:55,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:52:55,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:52:55,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:52:55,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:52:55,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:52:54" (1/3) ... [2020-10-20 01:52:55,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7111fb68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:52:55, skipping insertion in model container [2020-10-20 01:52:55,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:52:55" (2/3) ... [2020-10-20 01:52:55,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7111fb68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:52:55, skipping insertion in model container [2020-10-20 01:52:55,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:52:55" (3/3) ... [2020-10-20 01:52:55,937 INFO L111 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2020-10-20 01:52:55,949 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:52:55,958 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 01:52:55,974 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 01:52:56,006 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:52:56,007 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:52:56,007 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:52:56,008 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:52:56,008 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:52:56,008 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:52:56,009 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:52:56,009 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:52:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2020-10-20 01:52:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:56,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:56,051 INFO L422 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] [2020-10-20 01:52:56,052 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:56,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1633671955, now seen corresponding path program 1 times [2020-10-20 01:52:56,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:56,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013716001] [2020-10-20 01:52:56,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:56,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013716001] [2020-10-20 01:52:56,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:56,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:52:56,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120218122] [2020-10-20 01:52:56,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:52:56,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:56,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:52:56,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:56,321 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2020-10-20 01:52:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:56,381 INFO L93 Difference]: Finished difference Result 243 states and 450 transitions. [2020-10-20 01:52:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:52:56,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-20 01:52:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:56,395 INFO L225 Difference]: With dead ends: 243 [2020-10-20 01:52:56,395 INFO L226 Difference]: Without dead ends: 121 [2020-10-20 01:52:56,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-20 01:52:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-10-20 01:52:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-20 01:52:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 213 transitions. [2020-10-20 01:52:56,448 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 213 transitions. Word has length 35 [2020-10-20 01:52:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:56,448 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 213 transitions. [2020-10-20 01:52:56,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:52:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 213 transitions. [2020-10-20 01:52:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:56,450 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:56,450 INFO L422 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] [2020-10-20 01:52:56,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:52:56,451 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:56,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:56,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1611039701, now seen corresponding path program 1 times [2020-10-20 01:52:56,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:56,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364641385] [2020-10-20 01:52:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:56,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364641385] [2020-10-20 01:52:56,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:56,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:52:56,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5260862] [2020-10-20 01:52:56,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:52:56,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:52:56,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:52:56,567 INFO L87 Difference]: Start difference. First operand 121 states and 213 transitions. Second operand 4 states. [2020-10-20 01:52:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:56,670 INFO L93 Difference]: Finished difference Result 325 states and 571 transitions. [2020-10-20 01:52:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:52:56,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-20 01:52:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:56,673 INFO L225 Difference]: With dead ends: 325 [2020-10-20 01:52:56,674 INFO L226 Difference]: Without dead ends: 207 [2020-10-20 01:52:56,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:52:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-10-20 01:52:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2020-10-20 01:52:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-10-20 01:52:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 357 transitions. [2020-10-20 01:52:56,705 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 357 transitions. Word has length 35 [2020-10-20 01:52:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:56,706 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 357 transitions. [2020-10-20 01:52:56,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:52:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 357 transitions. [2020-10-20 01:52:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:56,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:56,708 INFO L422 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] [2020-10-20 01:52:56,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:52:56,708 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:56,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:56,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1101566611, now seen corresponding path program 1 times [2020-10-20 01:52:56,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:56,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363323362] [2020-10-20 01:52:56,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:56,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363323362] [2020-10-20 01:52:56,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:56,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:52:56,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856019253] [2020-10-20 01:52:56,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:52:56,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:56,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:52:56,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:56,760 INFO L87 Difference]: Start difference. First operand 204 states and 357 transitions. Second operand 3 states. [2020-10-20 01:52:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:56,826 INFO L93 Difference]: Finished difference Result 399 states and 701 transitions. [2020-10-20 01:52:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:52:56,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-20 01:52:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:56,828 INFO L225 Difference]: With dead ends: 399 [2020-10-20 01:52:56,829 INFO L226 Difference]: Without dead ends: 204 [2020-10-20 01:52:56,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-20 01:52:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2020-10-20 01:52:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-10-20 01:52:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 345 transitions. [2020-10-20 01:52:56,850 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 345 transitions. Word has length 35 [2020-10-20 01:52:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:56,850 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 345 transitions. [2020-10-20 01:52:56,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:52:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 345 transitions. [2020-10-20 01:52:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:56,852 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:56,852 INFO L422 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] [2020-10-20 01:52:56,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:52:56,853 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1744930967, now seen corresponding path program 1 times [2020-10-20 01:52:56,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:56,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056659040] [2020-10-20 01:52:56,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:56,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056659040] [2020-10-20 01:52:56,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:56,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:52:56,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499525366] [2020-10-20 01:52:56,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:52:56,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:56,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:52:56,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:52:56,919 INFO L87 Difference]: Start difference. First operand 204 states and 345 transitions. Second operand 4 states. [2020-10-20 01:52:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:57,043 INFO L93 Difference]: Finished difference Result 553 states and 938 transitions. [2020-10-20 01:52:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:52:57,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-20 01:52:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:57,046 INFO L225 Difference]: With dead ends: 553 [2020-10-20 01:52:57,047 INFO L226 Difference]: Without dead ends: 359 [2020-10-20 01:52:57,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:52:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-10-20 01:52:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 204. [2020-10-20 01:52:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-10-20 01:52:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 342 transitions. [2020-10-20 01:52:57,071 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 342 transitions. Word has length 35 [2020-10-20 01:52:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:57,071 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 342 transitions. [2020-10-20 01:52:57,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:52:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 342 transitions. [2020-10-20 01:52:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:57,073 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:57,073 INFO L422 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] [2020-10-20 01:52:57,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:52:57,074 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:57,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:57,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1806970581, now seen corresponding path program 1 times [2020-10-20 01:52:57,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:57,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26852471] [2020-10-20 01:52:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:57,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26852471] [2020-10-20 01:52:57,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:57,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:52:57,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891836914] [2020-10-20 01:52:57,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:52:57,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:57,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:52:57,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:52:57,169 INFO L87 Difference]: Start difference. First operand 204 states and 342 transitions. Second operand 4 states. [2020-10-20 01:52:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:57,298 INFO L93 Difference]: Finished difference Result 556 states and 934 transitions. [2020-10-20 01:52:57,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:52:57,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-20 01:52:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:57,302 INFO L225 Difference]: With dead ends: 556 [2020-10-20 01:52:57,303 INFO L226 Difference]: Without dead ends: 363 [2020-10-20 01:52:57,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:52:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-10-20 01:52:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 204. [2020-10-20 01:52:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-10-20 01:52:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 339 transitions. [2020-10-20 01:52:57,335 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 339 transitions. Word has length 35 [2020-10-20 01:52:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:57,336 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 339 transitions. [2020-10-20 01:52:57,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:52:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 339 transitions. [2020-10-20 01:52:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:57,340 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:57,340 INFO L422 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] [2020-10-20 01:52:57,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:52:57,341 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:57,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1947519191, now seen corresponding path program 1 times [2020-10-20 01:52:57,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:57,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987524428] [2020-10-20 01:52:57,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:57,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987524428] [2020-10-20 01:52:57,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:57,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:52:57,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129563973] [2020-10-20 01:52:57,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:52:57,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:57,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:52:57,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:52:57,428 INFO L87 Difference]: Start difference. First operand 204 states and 339 transitions. Second operand 4 states. [2020-10-20 01:52:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:57,535 INFO L93 Difference]: Finished difference Result 568 states and 945 transitions. [2020-10-20 01:52:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:52:57,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-20 01:52:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:57,540 INFO L225 Difference]: With dead ends: 568 [2020-10-20 01:52:57,540 INFO L226 Difference]: Without dead ends: 376 [2020-10-20 01:52:57,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:52:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-10-20 01:52:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 210. [2020-10-20 01:52:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-20 01:52:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 343 transitions. [2020-10-20 01:52:57,557 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 343 transitions. Word has length 35 [2020-10-20 01:52:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:57,558 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 343 transitions. [2020-10-20 01:52:57,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:52:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 343 transitions. [2020-10-20 01:52:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:57,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:57,560 INFO L422 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] [2020-10-20 01:52:57,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:52:57,560 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:57,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1813505685, now seen corresponding path program 1 times [2020-10-20 01:52:57,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:57,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768541874] [2020-10-20 01:52:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:57,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768541874] [2020-10-20 01:52:57,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:57,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:52:57,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709839162] [2020-10-20 01:52:57,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:52:57,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:57,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:52:57,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:52:57,614 INFO L87 Difference]: Start difference. First operand 210 states and 343 transitions. Second operand 4 states. [2020-10-20 01:52:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:57,727 INFO L93 Difference]: Finished difference Result 713 states and 1165 transitions. [2020-10-20 01:52:57,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:52:57,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-20 01:52:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:57,733 INFO L225 Difference]: With dead ends: 713 [2020-10-20 01:52:57,733 INFO L226 Difference]: Without dead ends: 516 [2020-10-20 01:52:57,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:52:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-10-20 01:52:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 341. [2020-10-20 01:52:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-10-20 01:52:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 554 transitions. [2020-10-20 01:52:57,771 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 554 transitions. Word has length 35 [2020-10-20 01:52:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:57,772 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 554 transitions. [2020-10-20 01:52:57,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:52:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 554 transitions. [2020-10-20 01:52:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:57,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:57,774 INFO L422 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] [2020-10-20 01:52:57,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:52:57,774 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:57,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:57,775 INFO L82 PathProgramCache]: Analyzing trace with hash 8067351, now seen corresponding path program 1 times [2020-10-20 01:52:57,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:57,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866271419] [2020-10-20 01:52:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:57,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866271419] [2020-10-20 01:52:57,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:57,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:52:57,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690681837] [2020-10-20 01:52:57,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:52:57,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:57,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:52:57,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:57,807 INFO L87 Difference]: Start difference. First operand 341 states and 554 transitions. Second operand 3 states. [2020-10-20 01:52:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:57,862 INFO L93 Difference]: Finished difference Result 812 states and 1325 transitions. [2020-10-20 01:52:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:52:57,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-20 01:52:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:57,866 INFO L225 Difference]: With dead ends: 812 [2020-10-20 01:52:57,866 INFO L226 Difference]: Without dead ends: 495 [2020-10-20 01:52:57,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-10-20 01:52:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2020-10-20 01:52:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-10-20 01:52:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 800 transitions. [2020-10-20 01:52:57,912 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 800 transitions. Word has length 35 [2020-10-20 01:52:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:57,912 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 800 transitions. [2020-10-20 01:52:57,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:52:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 800 transitions. [2020-10-20 01:52:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:57,913 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:57,914 INFO L422 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] [2020-10-20 01:52:57,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:52:57,914 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:57,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:57,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2127880731, now seen corresponding path program 1 times [2020-10-20 01:52:57,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:57,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262892893] [2020-10-20 01:52:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:57,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262892893] [2020-10-20 01:52:57,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:57,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:52:57,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831438879] [2020-10-20 01:52:57,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:52:57,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:57,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:52:57,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:52:57,953 INFO L87 Difference]: Start difference. First operand 493 states and 800 transitions. Second operand 4 states. [2020-10-20 01:52:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:58,065 INFO L93 Difference]: Finished difference Result 1255 states and 2037 transitions. [2020-10-20 01:52:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:52:58,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-20 01:52:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:58,091 INFO L225 Difference]: With dead ends: 1255 [2020-10-20 01:52:58,092 INFO L226 Difference]: Without dead ends: 779 [2020-10-20 01:52:58,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:52:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-10-20 01:52:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 493. [2020-10-20 01:52:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-10-20 01:52:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 792 transitions. [2020-10-20 01:52:58,129 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 792 transitions. Word has length 35 [2020-10-20 01:52:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:58,129 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 792 transitions. [2020-10-20 01:52:58,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:52:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 792 transitions. [2020-10-20 01:52:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:58,130 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:58,131 INFO L422 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] [2020-10-20 01:52:58,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:52:58,131 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:58,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1106812377, now seen corresponding path program 1 times [2020-10-20 01:52:58,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:58,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124645746] [2020-10-20 01:52:58,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:58,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124645746] [2020-10-20 01:52:58,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:58,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:52:58,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131240438] [2020-10-20 01:52:58,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:52:58,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:58,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:52:58,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:52:58,167 INFO L87 Difference]: Start difference. First operand 493 states and 792 transitions. Second operand 4 states. [2020-10-20 01:52:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:58,310 INFO L93 Difference]: Finished difference Result 1251 states and 2010 transitions. [2020-10-20 01:52:58,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:52:58,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-20 01:52:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:58,316 INFO L225 Difference]: With dead ends: 1251 [2020-10-20 01:52:58,316 INFO L226 Difference]: Without dead ends: 781 [2020-10-20 01:52:58,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:52:58,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-10-20 01:52:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 493. [2020-10-20 01:52:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-10-20 01:52:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 784 transitions. [2020-10-20 01:52:58,352 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 784 transitions. Word has length 35 [2020-10-20 01:52:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:58,352 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 784 transitions. [2020-10-20 01:52:58,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:52:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 784 transitions. [2020-10-20 01:52:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:58,353 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:58,353 INFO L422 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] [2020-10-20 01:52:58,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:52:58,354 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash 95695127, now seen corresponding path program 1 times [2020-10-20 01:52:58,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:58,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939857610] [2020-10-20 01:52:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:58,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939857610] [2020-10-20 01:52:58,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:58,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:52:58,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605050940] [2020-10-20 01:52:58,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:52:58,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:58,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:52:58,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:52:58,385 INFO L87 Difference]: Start difference. First operand 493 states and 784 transitions. Second operand 4 states. [2020-10-20 01:52:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:58,511 INFO L93 Difference]: Finished difference Result 1192 states and 1892 transitions. [2020-10-20 01:52:58,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:52:58,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-20 01:52:58,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:58,516 INFO L225 Difference]: With dead ends: 1192 [2020-10-20 01:52:58,516 INFO L226 Difference]: Without dead ends: 716 [2020-10-20 01:52:58,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:52:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-10-20 01:52:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 541. [2020-10-20 01:52:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-10-20 01:52:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 841 transitions. [2020-10-20 01:52:58,553 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 841 transitions. Word has length 35 [2020-10-20 01:52:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:58,554 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 841 transitions. [2020-10-20 01:52:58,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:52:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 841 transitions. [2020-10-20 01:52:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:52:58,555 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:58,555 INFO L422 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] [2020-10-20 01:52:58,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:52:58,556 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:58,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:58,556 INFO L82 PathProgramCache]: Analyzing trace with hash 353860565, now seen corresponding path program 1 times [2020-10-20 01:52:58,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:58,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031901376] [2020-10-20 01:52:58,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:58,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031901376] [2020-10-20 01:52:58,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:58,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:52:58,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644474444] [2020-10-20 01:52:58,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:52:58,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:58,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:52:58,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:58,584 INFO L87 Difference]: Start difference. First operand 541 states and 841 transitions. Second operand 3 states. [2020-10-20 01:52:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:58,674 INFO L93 Difference]: Finished difference Result 1288 states and 2008 transitions. [2020-10-20 01:52:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:52:58,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-20 01:52:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:58,679 INFO L225 Difference]: With dead ends: 1288 [2020-10-20 01:52:58,680 INFO L226 Difference]: Without dead ends: 761 [2020-10-20 01:52:58,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-10-20 01:52:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 758. [2020-10-20 01:52:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2020-10-20 01:52:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1165 transitions. [2020-10-20 01:52:58,727 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1165 transitions. Word has length 35 [2020-10-20 01:52:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:58,727 INFO L481 AbstractCegarLoop]: Abstraction has 758 states and 1165 transitions. [2020-10-20 01:52:58,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:52:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1165 transitions. [2020-10-20 01:52:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-20 01:52:58,728 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:58,729 INFO L422 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] [2020-10-20 01:52:58,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:52:58,729 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:58,730 INFO L82 PathProgramCache]: Analyzing trace with hash -230098911, now seen corresponding path program 1 times [2020-10-20 01:52:58,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:58,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26686571] [2020-10-20 01:52:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:58,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26686571] [2020-10-20 01:52:58,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:58,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:52:58,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364242755] [2020-10-20 01:52:58,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:52:58,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:52:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:58,766 INFO L87 Difference]: Start difference. First operand 758 states and 1165 transitions. Second operand 3 states. [2020-10-20 01:52:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:58,850 INFO L93 Difference]: Finished difference Result 1864 states and 2903 transitions. [2020-10-20 01:52:58,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:52:58,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-10-20 01:52:58,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:58,857 INFO L225 Difference]: With dead ends: 1864 [2020-10-20 01:52:58,857 INFO L226 Difference]: Without dead ends: 1133 [2020-10-20 01:52:58,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2020-10-20 01:52:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1131. [2020-10-20 01:52:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2020-10-20 01:52:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1752 transitions. [2020-10-20 01:52:58,944 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1752 transitions. Word has length 45 [2020-10-20 01:52:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:58,945 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1752 transitions. [2020-10-20 01:52:58,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:52:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1752 transitions. [2020-10-20 01:52:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-20 01:52:58,946 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:58,947 INFO L422 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] [2020-10-20 01:52:58,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:52:58,947 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:58,948 INFO L82 PathProgramCache]: Analyzing trace with hash 193547811, now seen corresponding path program 1 times [2020-10-20 01:52:58,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:58,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92608656] [2020-10-20 01:52:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:52:58,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92608656] [2020-10-20 01:52:58,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:58,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:52:58,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177312365] [2020-10-20 01:52:58,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:52:58,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:52:58,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:58,969 INFO L87 Difference]: Start difference. First operand 1131 states and 1752 transitions. Second operand 3 states. [2020-10-20 01:52:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:59,050 INFO L93 Difference]: Finished difference Result 2213 states and 3445 transitions. [2020-10-20 01:52:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:52:59,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-10-20 01:52:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:59,057 INFO L225 Difference]: With dead ends: 2213 [2020-10-20 01:52:59,057 INFO L226 Difference]: Without dead ends: 1109 [2020-10-20 01:52:59,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2020-10-20 01:52:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2020-10-20 01:52:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2020-10-20 01:52:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1725 transitions. [2020-10-20 01:52:59,134 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1725 transitions. Word has length 45 [2020-10-20 01:52:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:59,135 INFO L481 AbstractCegarLoop]: Abstraction has 1109 states and 1725 transitions. [2020-10-20 01:52:59,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:52:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1725 transitions. [2020-10-20 01:52:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-20 01:52:59,137 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:59,137 INFO L422 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] [2020-10-20 01:52:59,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:52:59,138 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:59,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:59,139 INFO L82 PathProgramCache]: Analyzing trace with hash 668512427, now seen corresponding path program 1 times [2020-10-20 01:52:59,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:59,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725637406] [2020-10-20 01:52:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:59,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725637406] [2020-10-20 01:52:59,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:59,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:52:59,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885988356] [2020-10-20 01:52:59,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:52:59,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:59,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:52:59,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:59,202 INFO L87 Difference]: Start difference. First operand 1109 states and 1725 transitions. Second operand 3 states. [2020-10-20 01:52:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:59,420 INFO L93 Difference]: Finished difference Result 2813 states and 4432 transitions. [2020-10-20 01:52:59,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:52:59,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-10-20 01:52:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:59,435 INFO L225 Difference]: With dead ends: 2813 [2020-10-20 01:52:59,435 INFO L226 Difference]: Without dead ends: 1731 [2020-10-20 01:52:59,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2020-10-20 01:52:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1729. [2020-10-20 01:52:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2020-10-20 01:52:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2711 transitions. [2020-10-20 01:52:59,621 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2711 transitions. Word has length 46 [2020-10-20 01:52:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:52:59,622 INFO L481 AbstractCegarLoop]: Abstraction has 1729 states and 2711 transitions. [2020-10-20 01:52:59,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:52:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2711 transitions. [2020-10-20 01:52:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-20 01:52:59,623 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:52:59,623 INFO L422 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] [2020-10-20 01:52:59,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:52:59,624 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:52:59,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:52:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash -710212426, now seen corresponding path program 1 times [2020-10-20 01:52:59,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:52:59,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543869759] [2020-10-20 01:52:59,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:52:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:52:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:52:59,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543869759] [2020-10-20 01:52:59,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:52:59,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:52:59,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810601457] [2020-10-20 01:52:59,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:52:59,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:52:59,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:52:59,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:59,667 INFO L87 Difference]: Start difference. First operand 1729 states and 2711 transitions. Second operand 3 states. [2020-10-20 01:52:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:52:59,895 INFO L93 Difference]: Finished difference Result 4644 states and 7373 transitions. [2020-10-20 01:52:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:52:59,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-10-20 01:52:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:52:59,913 INFO L225 Difference]: With dead ends: 4644 [2020-10-20 01:52:59,913 INFO L226 Difference]: Without dead ends: 2944 [2020-10-20 01:52:59,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:52:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-10-20 01:53:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2942. [2020-10-20 01:53:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2020-10-20 01:53:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4650 transitions. [2020-10-20 01:53:00,140 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4650 transitions. Word has length 47 [2020-10-20 01:53:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:00,140 INFO L481 AbstractCegarLoop]: Abstraction has 2942 states and 4650 transitions. [2020-10-20 01:53:00,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4650 transitions. [2020-10-20 01:53:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-20 01:53:00,142 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:00,142 INFO L422 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] [2020-10-20 01:53:00,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:53:00,143 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash -286565704, now seen corresponding path program 1 times [2020-10-20 01:53:00,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:00,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286618624] [2020-10-20 01:53:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:53:00,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286618624] [2020-10-20 01:53:00,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:00,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:00,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739672624] [2020-10-20 01:53:00,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:00,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:00,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:00,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:00,163 INFO L87 Difference]: Start difference. First operand 2942 states and 4650 transitions. Second operand 3 states. [2020-10-20 01:53:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:00,561 INFO L93 Difference]: Finished difference Result 5833 states and 9241 transitions. [2020-10-20 01:53:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:00,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-10-20 01:53:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:00,576 INFO L225 Difference]: With dead ends: 5833 [2020-10-20 01:53:00,577 INFO L226 Difference]: Without dead ends: 2920 [2020-10-20 01:53:00,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-10-20 01:53:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2020-10-20 01:53:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2020-10-20 01:53:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4624 transitions. [2020-10-20 01:53:00,778 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4624 transitions. Word has length 47 [2020-10-20 01:53:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:00,779 INFO L481 AbstractCegarLoop]: Abstraction has 2920 states and 4624 transitions. [2020-10-20 01:53:00,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4624 transitions. [2020-10-20 01:53:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-20 01:53:00,780 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:00,781 INFO L422 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] [2020-10-20 01:53:00,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:53:00,781 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:00,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1167001578, now seen corresponding path program 1 times [2020-10-20 01:53:00,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:00,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020057665] [2020-10-20 01:53:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:00,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020057665] [2020-10-20 01:53:00,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:00,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:00,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002868588] [2020-10-20 01:53:00,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:00,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:00,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:00,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:00,815 INFO L87 Difference]: Start difference. First operand 2920 states and 4624 transitions. Second operand 4 states. [2020-10-20 01:53:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:01,398 INFO L93 Difference]: Finished difference Result 7421 states and 11813 transitions. [2020-10-20 01:53:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:01,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-10-20 01:53:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:01,425 INFO L225 Difference]: With dead ends: 7421 [2020-10-20 01:53:01,426 INFO L226 Difference]: Without dead ends: 3797 [2020-10-20 01:53:01,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:01,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2020-10-20 01:53:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3797. [2020-10-20 01:53:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2020-10-20 01:53:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 5990 transitions. [2020-10-20 01:53:01,786 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 5990 transitions. Word has length 48 [2020-10-20 01:53:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:01,787 INFO L481 AbstractCegarLoop]: Abstraction has 3797 states and 5990 transitions. [2020-10-20 01:53:01,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 5990 transitions. [2020-10-20 01:53:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-20 01:53:01,789 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:01,789 INFO L422 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] [2020-10-20 01:53:01,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:53:01,790 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:01,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:01,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1620471122, now seen corresponding path program 1 times [2020-10-20 01:53:01,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:01,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501779332] [2020-10-20 01:53:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:01,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501779332] [2020-10-20 01:53:01,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:01,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:01,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254956411] [2020-10-20 01:53:01,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:01,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:01,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:01,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:01,860 INFO L87 Difference]: Start difference. First operand 3797 states and 5990 transitions. Second operand 5 states. [2020-10-20 01:53:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:02,461 INFO L93 Difference]: Finished difference Result 9692 states and 15178 transitions. [2020-10-20 01:53:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:53:02,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-10-20 01:53:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:02,512 INFO L225 Difference]: With dead ends: 9692 [2020-10-20 01:53:02,513 INFO L226 Difference]: Without dead ends: 5918 [2020-10-20 01:53:02,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2020-10-20 01:53:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 4440. [2020-10-20 01:53:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4440 states. [2020-10-20 01:53:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6847 transitions. [2020-10-20 01:53:02,895 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6847 transitions. Word has length 53 [2020-10-20 01:53:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:02,896 INFO L481 AbstractCegarLoop]: Abstraction has 4440 states and 6847 transitions. [2020-10-20 01:53:02,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6847 transitions. [2020-10-20 01:53:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-20 01:53:02,899 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:02,899 INFO L422 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] [2020-10-20 01:53:02,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 01:53:02,900 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:02,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:02,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2101139439, now seen corresponding path program 1 times [2020-10-20 01:53:02,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:02,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716555509] [2020-10-20 01:53:02,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:02,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716555509] [2020-10-20 01:53:02,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:02,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:02,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40926101] [2020-10-20 01:53:02,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:02,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:02,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:02,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:02,951 INFO L87 Difference]: Start difference. First operand 4440 states and 6847 transitions. Second operand 3 states. [2020-10-20 01:53:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:03,374 INFO L93 Difference]: Finished difference Result 9203 states and 14160 transitions. [2020-10-20 01:53:03,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:03,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-10-20 01:53:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:03,387 INFO L225 Difference]: With dead ends: 9203 [2020-10-20 01:53:03,387 INFO L226 Difference]: Without dead ends: 4792 [2020-10-20 01:53:03,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2020-10-20 01:53:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4760. [2020-10-20 01:53:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4760 states. [2020-10-20 01:53:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 7096 transitions. [2020-10-20 01:53:03,980 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 7096 transitions. Word has length 85 [2020-10-20 01:53:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:03,980 INFO L481 AbstractCegarLoop]: Abstraction has 4760 states and 7096 transitions. [2020-10-20 01:53:03,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 7096 transitions. [2020-10-20 01:53:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-20 01:53:03,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:03,984 INFO L422 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] [2020-10-20 01:53:03,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:53:03,985 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:03,985 INFO L82 PathProgramCache]: Analyzing trace with hash 378663463, now seen corresponding path program 1 times [2020-10-20 01:53:03,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:03,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632580165] [2020-10-20 01:53:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:04,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632580165] [2020-10-20 01:53:04,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:04,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:04,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276256514] [2020-10-20 01:53:04,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:04,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:04,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:04,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:04,022 INFO L87 Difference]: Start difference. First operand 4760 states and 7096 transitions. Second operand 3 states. [2020-10-20 01:53:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:04,442 INFO L93 Difference]: Finished difference Result 10001 states and 14870 transitions. [2020-10-20 01:53:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:04,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-10-20 01:53:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:04,454 INFO L225 Difference]: With dead ends: 10001 [2020-10-20 01:53:04,454 INFO L226 Difference]: Without dead ends: 5282 [2020-10-20 01:53:04,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2020-10-20 01:53:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5234. [2020-10-20 01:53:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2020-10-20 01:53:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7539 transitions. [2020-10-20 01:53:05,066 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7539 transitions. Word has length 86 [2020-10-20 01:53:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:05,067 INFO L481 AbstractCegarLoop]: Abstraction has 5234 states and 7539 transitions. [2020-10-20 01:53:05,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7539 transitions. [2020-10-20 01:53:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-10-20 01:53:05,072 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:05,073 INFO L422 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] [2020-10-20 01:53:05,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:53:05,074 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:05,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:05,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2102863697, now seen corresponding path program 1 times [2020-10-20 01:53:05,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:05,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268620341] [2020-10-20 01:53:05,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:05,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268620341] [2020-10-20 01:53:05,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:05,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:05,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939495173] [2020-10-20 01:53:05,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:05,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:05,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:05,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:05,135 INFO L87 Difference]: Start difference. First operand 5234 states and 7539 transitions. Second operand 3 states. [2020-10-20 01:53:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:05,611 INFO L93 Difference]: Finished difference Result 10775 states and 15529 transitions. [2020-10-20 01:53:05,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:05,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-10-20 01:53:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:05,626 INFO L225 Difference]: With dead ends: 10775 [2020-10-20 01:53:05,627 INFO L226 Difference]: Without dead ends: 5602 [2020-10-20 01:53:05,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2020-10-20 01:53:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 5024. [2020-10-20 01:53:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5024 states. [2020-10-20 01:53:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5024 states to 5024 states and 6917 transitions. [2020-10-20 01:53:06,159 INFO L78 Accepts]: Start accepts. Automaton has 5024 states and 6917 transitions. Word has length 87 [2020-10-20 01:53:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:06,159 INFO L481 AbstractCegarLoop]: Abstraction has 5024 states and 6917 transitions. [2020-10-20 01:53:06,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:06,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5024 states and 6917 transitions. [2020-10-20 01:53:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-20 01:53:06,165 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:06,165 INFO L422 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] [2020-10-20 01:53:06,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 01:53:06,166 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:06,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1080949445, now seen corresponding path program 1 times [2020-10-20 01:53:06,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:06,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035656521] [2020-10-20 01:53:06,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 01:53:06,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035656521] [2020-10-20 01:53:06,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:06,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:06,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476176736] [2020-10-20 01:53:06,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:06,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:06,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:06,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:06,215 INFO L87 Difference]: Start difference. First operand 5024 states and 6917 transitions. Second operand 4 states. [2020-10-20 01:53:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:06,782 INFO L93 Difference]: Finished difference Result 9412 states and 12909 transitions. [2020-10-20 01:53:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:06,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-10-20 01:53:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:06,792 INFO L225 Difference]: With dead ends: 9412 [2020-10-20 01:53:06,792 INFO L226 Difference]: Without dead ends: 4839 [2020-10-20 01:53:06,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2020-10-20 01:53:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 4725. [2020-10-20 01:53:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2020-10-20 01:53:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 6299 transitions. [2020-10-20 01:53:07,316 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 6299 transitions. Word has length 88 [2020-10-20 01:53:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:07,317 INFO L481 AbstractCegarLoop]: Abstraction has 4725 states and 6299 transitions. [2020-10-20 01:53:07,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 6299 transitions. [2020-10-20 01:53:07,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-10-20 01:53:07,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:07,327 INFO L422 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] [2020-10-20 01:53:07,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 01:53:07,327 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:07,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:07,328 INFO L82 PathProgramCache]: Analyzing trace with hash -273115530, now seen corresponding path program 1 times [2020-10-20 01:53:07,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:07,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499305822] [2020-10-20 01:53:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-20 01:53:07,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499305822] [2020-10-20 01:53:07,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:07,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:07,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795330863] [2020-10-20 01:53:07,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:07,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:07,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:07,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:07,384 INFO L87 Difference]: Start difference. First operand 4725 states and 6299 transitions. Second operand 3 states. [2020-10-20 01:53:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:07,710 INFO L93 Difference]: Finished difference Result 9005 states and 11995 transitions. [2020-10-20 01:53:07,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:07,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-10-20 01:53:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:07,720 INFO L225 Difference]: With dead ends: 9005 [2020-10-20 01:53:07,720 INFO L226 Difference]: Without dead ends: 4671 [2020-10-20 01:53:07,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2020-10-20 01:53:08,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4671. [2020-10-20 01:53:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4671 states. [2020-10-20 01:53:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 6193 transitions. [2020-10-20 01:53:08,047 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 6193 transitions. Word has length 115 [2020-10-20 01:53:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:08,047 INFO L481 AbstractCegarLoop]: Abstraction has 4671 states and 6193 transitions. [2020-10-20 01:53:08,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 6193 transitions. [2020-10-20 01:53:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-10-20 01:53:08,059 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:08,059 INFO L422 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] [2020-10-20 01:53:08,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 01:53:08,060 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:08,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:08,060 INFO L82 PathProgramCache]: Analyzing trace with hash -471932119, now seen corresponding path program 1 times [2020-10-20 01:53:08,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:08,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224101095] [2020-10-20 01:53:08,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-20 01:53:08,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224101095] [2020-10-20 01:53:08,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:08,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:08,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643860197] [2020-10-20 01:53:08,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:08,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:08,139 INFO L87 Difference]: Start difference. First operand 4671 states and 6193 transitions. Second operand 4 states. [2020-10-20 01:53:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:08,660 INFO L93 Difference]: Finished difference Result 8293 states and 11017 transitions. [2020-10-20 01:53:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:08,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2020-10-20 01:53:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:08,670 INFO L225 Difference]: With dead ends: 8293 [2020-10-20 01:53:08,671 INFO L226 Difference]: Without dead ends: 4591 [2020-10-20 01:53:08,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2020-10-20 01:53:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4589. [2020-10-20 01:53:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4589 states. [2020-10-20 01:53:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 5972 transitions. [2020-10-20 01:53:09,238 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 5972 transitions. Word has length 127 [2020-10-20 01:53:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:09,238 INFO L481 AbstractCegarLoop]: Abstraction has 4589 states and 5972 transitions. [2020-10-20 01:53:09,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 5972 transitions. [2020-10-20 01:53:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-20 01:53:09,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:09,251 INFO L422 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] [2020-10-20 01:53:09,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-20 01:53:09,252 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:09,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1801789853, now seen corresponding path program 1 times [2020-10-20 01:53:09,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:09,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221035823] [2020-10-20 01:53:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-20 01:53:09,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221035823] [2020-10-20 01:53:09,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:09,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:09,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786162133] [2020-10-20 01:53:09,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:09,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:09,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:09,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:09,317 INFO L87 Difference]: Start difference. First operand 4589 states and 5972 transitions. Second operand 3 states. [2020-10-20 01:53:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:09,895 INFO L93 Difference]: Finished difference Result 8791 states and 11432 transitions. [2020-10-20 01:53:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:09,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-10-20 01:53:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:09,909 INFO L225 Difference]: With dead ends: 8791 [2020-10-20 01:53:09,910 INFO L226 Difference]: Without dead ends: 4588 [2020-10-20 01:53:09,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2020-10-20 01:53:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 4548. [2020-10-20 01:53:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2020-10-20 01:53:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 5889 transitions. [2020-10-20 01:53:10,292 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 5889 transitions. Word has length 133 [2020-10-20 01:53:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:10,292 INFO L481 AbstractCegarLoop]: Abstraction has 4548 states and 5889 transitions. [2020-10-20 01:53:10,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 5889 transitions. [2020-10-20 01:53:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-10-20 01:53:10,300 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:10,300 INFO L422 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] [2020-10-20 01:53:10,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-20 01:53:10,301 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash -142067203, now seen corresponding path program 1 times [2020-10-20 01:53:10,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:10,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659182524] [2020-10-20 01:53:10,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-20 01:53:10,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659182524] [2020-10-20 01:53:10,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:10,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:10,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206230047] [2020-10-20 01:53:10,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:10,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:10,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:10,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:10,343 INFO L87 Difference]: Start difference. First operand 4548 states and 5889 transitions. Second operand 3 states. [2020-10-20 01:53:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:10,684 INFO L93 Difference]: Finished difference Result 8730 states and 11293 transitions. [2020-10-20 01:53:10,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:10,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-10-20 01:53:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:10,727 INFO L225 Difference]: With dead ends: 8730 [2020-10-20 01:53:10,727 INFO L226 Difference]: Without dead ends: 4558 [2020-10-20 01:53:10,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2020-10-20 01:53:11,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 4518. [2020-10-20 01:53:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4518 states. [2020-10-20 01:53:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 5818 transitions. [2020-10-20 01:53:11,111 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 5818 transitions. Word has length 133 [2020-10-20 01:53:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:11,111 INFO L481 AbstractCegarLoop]: Abstraction has 4518 states and 5818 transitions. [2020-10-20 01:53:11,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 5818 transitions. [2020-10-20 01:53:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-20 01:53:11,120 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:11,120 INFO L422 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] [2020-10-20 01:53:11,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-20 01:53:11,120 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1934957922, now seen corresponding path program 1 times [2020-10-20 01:53:11,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:11,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420735632] [2020-10-20 01:53:11,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-20 01:53:11,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420735632] [2020-10-20 01:53:11,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:11,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:11,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712100743] [2020-10-20 01:53:11,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:11,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:11,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:11,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:11,186 INFO L87 Difference]: Start difference. First operand 4518 states and 5818 transitions. Second operand 4 states. [2020-10-20 01:53:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:11,491 INFO L93 Difference]: Finished difference Result 7327 states and 9468 transitions. [2020-10-20 01:53:11,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:11,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-10-20 01:53:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:11,499 INFO L225 Difference]: With dead ends: 7327 [2020-10-20 01:53:11,499 INFO L226 Difference]: Without dead ends: 3182 [2020-10-20 01:53:11,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2020-10-20 01:53:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3180. [2020-10-20 01:53:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3180 states. [2020-10-20 01:53:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4000 transitions. [2020-10-20 01:53:11,764 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4000 transitions. Word has length 136 [2020-10-20 01:53:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:11,764 INFO L481 AbstractCegarLoop]: Abstraction has 3180 states and 4000 transitions. [2020-10-20 01:53:11,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4000 transitions. [2020-10-20 01:53:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-10-20 01:53:11,769 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:11,769 INFO L422 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] [2020-10-20 01:53:11,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-20 01:53:11,770 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:11,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:11,770 INFO L82 PathProgramCache]: Analyzing trace with hash 133231117, now seen corresponding path program 1 times [2020-10-20 01:53:11,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:11,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898722989] [2020-10-20 01:53:11,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-20 01:53:11,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898722989] [2020-10-20 01:53:11,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:11,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:11,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342575098] [2020-10-20 01:53:11,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:11,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:11,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:11,812 INFO L87 Difference]: Start difference. First operand 3180 states and 4000 transitions. Second operand 4 states. [2020-10-20 01:53:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:12,009 INFO L93 Difference]: Finished difference Result 5150 states and 6486 transitions. [2020-10-20 01:53:12,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:12,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-10-20 01:53:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:12,013 INFO L225 Difference]: With dead ends: 5150 [2020-10-20 01:53:12,013 INFO L226 Difference]: Without dead ends: 2043 [2020-10-20 01:53:12,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2020-10-20 01:53:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2041. [2020-10-20 01:53:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2020-10-20 01:53:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2486 transitions. [2020-10-20 01:53:12,168 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2486 transitions. Word has length 136 [2020-10-20 01:53:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:12,169 INFO L481 AbstractCegarLoop]: Abstraction has 2041 states and 2486 transitions. [2020-10-20 01:53:12,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2486 transitions. [2020-10-20 01:53:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-10-20 01:53:12,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:12,171 INFO L422 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] [2020-10-20 01:53:12,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-20 01:53:12,172 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1652555523, now seen corresponding path program 1 times [2020-10-20 01:53:12,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:12,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696168063] [2020-10-20 01:53:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-20 01:53:12,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696168063] [2020-10-20 01:53:12,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:12,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:12,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130349129] [2020-10-20 01:53:12,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:12,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:12,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:12,230 INFO L87 Difference]: Start difference. First operand 2041 states and 2486 transitions. Second operand 3 states. [2020-10-20 01:53:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:12,404 INFO L93 Difference]: Finished difference Result 3699 states and 4535 transitions. [2020-10-20 01:53:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:12,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-10-20 01:53:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:12,408 INFO L225 Difference]: With dead ends: 3699 [2020-10-20 01:53:12,408 INFO L226 Difference]: Without dead ends: 1999 [2020-10-20 01:53:12,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2020-10-20 01:53:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1931. [2020-10-20 01:53:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2020-10-20 01:53:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2328 transitions. [2020-10-20 01:53:12,579 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2328 transitions. Word has length 175 [2020-10-20 01:53:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:12,580 INFO L481 AbstractCegarLoop]: Abstraction has 1931 states and 2328 transitions. [2020-10-20 01:53:12,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2328 transitions. [2020-10-20 01:53:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-10-20 01:53:12,583 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:12,583 INFO L422 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] [2020-10-20 01:53:12,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-20 01:53:12,584 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:12,584 INFO L82 PathProgramCache]: Analyzing trace with hash 919917832, now seen corresponding path program 1 times [2020-10-20 01:53:12,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:12,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730108622] [2020-10-20 01:53:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 01:53:12,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730108622] [2020-10-20 01:53:12,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:12,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:12,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521562845] [2020-10-20 01:53:12,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:12,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:12,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:12,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:12,647 INFO L87 Difference]: Start difference. First operand 1931 states and 2328 transitions. Second operand 3 states. [2020-10-20 01:53:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:12,866 INFO L93 Difference]: Finished difference Result 4154 states and 5043 transitions. [2020-10-20 01:53:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:12,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2020-10-20 01:53:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:12,870 INFO L225 Difference]: With dead ends: 4154 [2020-10-20 01:53:12,870 INFO L226 Difference]: Without dead ends: 2560 [2020-10-20 01:53:12,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:12,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2020-10-20 01:53:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2209. [2020-10-20 01:53:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2020-10-20 01:53:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2628 transitions. [2020-10-20 01:53:13,090 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2628 transitions. Word has length 181 [2020-10-20 01:53:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:13,090 INFO L481 AbstractCegarLoop]: Abstraction has 2209 states and 2628 transitions. [2020-10-20 01:53:13,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2628 transitions. [2020-10-20 01:53:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-20 01:53:13,094 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:13,095 INFO L422 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] [2020-10-20 01:53:13,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-20 01:53:13,097 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash 929862786, now seen corresponding path program 1 times [2020-10-20 01:53:13,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:13,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342093101] [2020-10-20 01:53:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:53:13,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:53:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:53:13,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:53:13,316 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:53:13,316 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:53:13,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-20 01:53:13,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:53:13 BoogieIcfgContainer [2020-10-20 01:53:13,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:53:13,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:53:13,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:53:13,583 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:53:13,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:52:55" (3/4) ... [2020-10-20 01:53:13,586 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:53:13,812 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:53:13,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:53:13,815 INFO L168 Benchmark]: Toolchain (without parser) took 19327.46 ms. Allocated memory was 35.7 MB in the beginning and 422.1 MB in the end (delta: 386.4 MB). Free memory was 13.3 MB in the beginning and 116.4 MB in the end (delta: -103.1 MB). Peak memory consumption was 283.3 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:13,815 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 33.6 MB. Free memory was 18.8 MB in the beginning and 18.8 MB in the end (delta: 30.8 kB). Peak memory consumption was 30.8 kB. Max. memory is 14.3 GB. [2020-10-20 01:53:13,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.93 ms. Allocated memory was 35.7 MB in the beginning and 45.1 MB in the end (delta: 9.4 MB). Free memory was 12.3 MB in the beginning and 20.8 MB in the end (delta: -8.5 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:13,816 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.41 ms. Allocated memory is still 45.1 MB. Free memory was 20.8 MB in the beginning and 18.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:13,817 INFO L168 Benchmark]: Boogie Preprocessor took 63.58 ms. Allocated memory is still 45.1 MB. Free memory was 18.2 MB in the beginning and 16.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:13,817 INFO L168 Benchmark]: RCFGBuilder took 805.05 ms. Allocated memory was 45.1 MB in the beginning and 48.2 MB in the end (delta: 3.1 MB). Free memory was 16.0 MB in the beginning and 20.9 MB in the end (delta: -4.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:13,817 INFO L168 Benchmark]: TraceAbstraction took 17654.26 ms. Allocated memory was 48.2 MB in the beginning and 422.1 MB in the end (delta: 373.8 MB). Free memory was 20.6 MB in the beginning and 156.2 MB in the end (delta: -135.6 MB). Peak memory consumption was 238.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:13,818 INFO L168 Benchmark]: Witness Printer took 230.15 ms. Allocated memory is still 422.1 MB. Free memory was 156.2 MB in the beginning and 116.4 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:13,820 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.30 ms. Allocated memory is still 33.6 MB. Free memory was 18.8 MB in the beginning and 18.8 MB in the end (delta: 30.8 kB). Peak memory consumption was 30.8 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 509.93 ms. Allocated memory was 35.7 MB in the beginning and 45.1 MB in the end (delta: 9.4 MB). Free memory was 12.3 MB in the beginning and 20.8 MB in the end (delta: -8.5 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 53.41 ms. Allocated memory is still 45.1 MB. Free memory was 20.8 MB in the beginning and 18.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 63.58 ms. Allocated memory is still 45.1 MB. Free memory was 18.2 MB in the beginning and 16.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 805.05 ms. Allocated memory was 45.1 MB in the beginning and 48.2 MB in the end (delta: 3.1 MB). Free memory was 16.0 MB in the beginning and 20.9 MB in the end (delta: -4.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 14.3 GB. * TraceAbstraction took 17654.26 ms. Allocated memory was 48.2 MB in the beginning and 422.1 MB in the end (delta: 373.8 MB). Free memory was 20.6 MB in the beginning and 156.2 MB in the end (delta: -135.6 MB). Peak memory consumption was 238.2 MB. Max. memory is 14.3 GB. * Witness Printer took 230.15 ms. Allocated memory is still 422.1 MB. Free memory was 156.2 MB in the beginning and 116.4 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L681] int __retres1 ; [L685] e_wl = 2 [L686] e_c = e_wl [L687] e_g = e_c [L688] e_f = e_g [L689] e_e = e_f [L690] wl_pc = 0 [L691] c1_pc = 0 [L692] c2_pc = 0 [L693] wb_pc = 0 [L694] wb_i = 1 [L695] c2_i = wb_i [L696] c1_i = c2_i [L697] wl_i = c1_i [L698] r_i = 0 [L699] c_req_up = 0 [L700] d = 0 [L701] c = 0 [L392] int kernel_st ; [L395] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L396] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L407] COND TRUE (int )wl_i == 1 [L408] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L412] COND TRUE (int )c1_i == 1 [L413] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L417] COND TRUE (int )c2_i == 1 [L418] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L422] COND TRUE (int )wb_i == 1 [L423] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND FALSE !((int )r_i == 1) [L430] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L475] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L484] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L493] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L502] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L507] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L512] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L517] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L58] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L72] wl_st = 2 [L73] wl_pc = 1 [L74] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L129] COND TRUE (int )c1_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L174] COND TRUE (int )c2_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L219] COND TRUE (int )wb_pc == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L540] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L551] kernel_st = 3 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L567] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L572] COND TRUE (int )e_wl == 0 [L573] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L578] COND TRUE (int )e_wl == 1 [L579] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L595] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L596] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L604] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L605] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L613] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L614] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L622] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L627] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L632] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L637] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L642] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L647] COND TRUE (int )e_wl == 1 [L648] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L533] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L61] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L64] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L79] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L81] t = d [L82] data = d [L83] processed = 0 [L84] e_f = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L85] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L86] COND TRUE (int )e_f == 1 [L87] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L95] COND TRUE (int )e_f == 1 [L96] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] e_f = 2 [L104] wl_st = 2 [L105] wl_pc = 2 [L106] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND TRUE (int )c1_st == 0 [L326] tmp___0 = __VERIFIER_nondet_int() [L328] COND TRUE \read(tmp___0) [L330] c1_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L129] COND FALSE !((int )c1_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L132] COND TRUE (int )c1_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L147] COND TRUE ! processed [L148] data += 1 [L149] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L150] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L151] COND TRUE (int )e_g == 1 [L152] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L159] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L140] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L142] c1_st = 2 [L143] c1_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L339] COND TRUE (int )c2_st == 0 [L341] tmp___1 = __VERIFIER_nondet_int() [L343] COND TRUE \read(tmp___1) [L345] c2_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L174] COND FALSE !((int )c2_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L177] COND TRUE (int )c2_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L192] COND TRUE ! processed [L193] data += 1 [L194] e_g = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L195] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L196] COND TRUE (int )e_g == 1 [L197] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L204] e_g = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L185] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L187] c2_st = 2 [L188] c2_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L354] COND TRUE (int )wb_st == 0 [L356] tmp___2 = __VERIFIER_nondet_int() [L358] COND TRUE \read(tmp___2) [L360] wb_st = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L219] COND FALSE !((int )wb_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L222] COND TRUE (int )wb_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L237] c_t = data [L238] c_req_up = 1 [L239] processed = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L230] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L232] wb_st = 2 [L233] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L539] kernel_st = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L540] COND TRUE (int )c_req_up == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L541] COND TRUE c != c_t [L542] c = c_t [L543] e_c = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L547] c_req_up = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L551] kernel_st = 3 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L552] COND FALSE !((int )e_f == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] COND FALSE !((int )e_g == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L562] COND FALSE !((int )e_e == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L567] COND TRUE (int )e_c == 0 [L568] e_c = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L572] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L585] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L586] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L595] COND TRUE (int )c1_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L596] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L604] COND TRUE (int )c2_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L613] COND TRUE (int )wb_pc == 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L614] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L622] COND TRUE (int )e_c == 1 [L623] r_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L627] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L632] COND FALSE !((int )e_f == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L637] COND FALSE !((int )e_g == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L642] COND TRUE (int )e_c == 1 [L643] e_c = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L647] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L655] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L658] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L661] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L664] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L533] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L536] kernel_st = 1 [L278] int tmp ; [L279] int tmp___0 ; [L280] int tmp___1 ; [L281] int tmp___2 ; [L282] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L288] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L291] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L294] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L297] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L300] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L309] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L324] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L339] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L354] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L369] COND TRUE (int )r_st == 0 [L371] tmp___3 = __VERIFIER_nondet_int() [L373] COND TRUE \read(tmp___3) [L375] r_st = 1 [L251] d = c [L252] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L253] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L261] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L262] COND TRUE (int )e_e == 1 [L263] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L271] e_e = 2 [L272] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L288] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L309] COND TRUE (int )wl_st == 0 [L311] tmp = __VERIFIER_nondet_int() [L313] COND TRUE \read(tmp) [L315] wl_st = 1 [L55] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L58] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L61] COND TRUE (int )wl_pc == 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L110] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L111] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L3] __assert_fail("0", "toy2.cil.c", 3, "reach_error") VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.3s, OverallIterations: 32, TraceHistogramMax: 6, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6240 SDtfs, 7475 SDslu, 3708 SDs, 0 SdLazy, 663 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5234occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 4173 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2417 NumberOfCodeBlocks, 2417 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2202 ConstructedInterpolants, 0 QuantifiedInterpolants, 341936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 597/597 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...