./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer --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 f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-69874e2 [2020-12-01 15:39:07,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:39:07,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:39:07,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:39:07,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:39:07,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:39:07,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:39:07,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:39:07,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:39:07,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:39:07,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:39:07,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:39:07,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:39:07,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:39:07,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:39:07,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:39:07,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:39:07,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:39:07,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:39:07,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:39:07,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:39:07,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:39:07,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:39:07,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:39:07,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:39:07,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:39:07,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:39:07,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:39:07,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:39:07,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:39:07,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:39:07,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:39:07,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:39:07,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:39:07,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:39:07,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:39:07,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:39:07,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:39:07,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:39:07,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:39:07,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:39:07,771 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 15:39:07,818 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:39:07,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:39:07,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:39:07,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:39:07,822 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:39:07,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:39:07,828 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:39:07,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:39:07,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:39:07,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:39:07,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:39:07,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:39:07,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:39:07,831 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:39:07,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:39:07,832 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:39:07,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:39:07,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:39:07,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:39:07,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:39:07,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:39:07,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:39:07,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:39:07,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:39:07,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:39:07,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:39:07,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:39:07,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:39:07,836 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:39:07,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer 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 -> f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 [2020-12-01 15:39:08,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:39:08,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:39:08,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:39:08,346 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:39:08,347 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:39:08,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/../../sv-benchmarks/c/systemc/toy1.cil.c [2020-12-01 15:39:08,427 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/data/56431bacc/1846817f98cb4d4fa4543af5e1d4320d/FLAGe61ffd79f [2020-12-01 15:39:09,024 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:39:09,024 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/sv-benchmarks/c/systemc/toy1.cil.c [2020-12-01 15:39:09,043 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/data/56431bacc/1846817f98cb4d4fa4543af5e1d4320d/FLAGe61ffd79f [2020-12-01 15:39:09,458 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/data/56431bacc/1846817f98cb4d4fa4543af5e1d4320d [2020-12-01 15:39:09,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:39:09,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:39:09,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:39:09,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:39:09,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:39:09,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:39:09" (1/1) ... [2020-12-01 15:39:09,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@977aefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:09, skipping insertion in model container [2020-12-01 15:39:09,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:39:09" (1/1) ... [2020-12-01 15:39:09,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:39:09,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:39:09,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:39:09,894 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:39:10,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:39:10,037 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:39:10,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10 WrapperNode [2020-12-01 15:39:10,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:39:10,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:39:10,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:39:10,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:39:10,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10" (1/1) ... [2020-12-01 15:39:10,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10" (1/1) ... [2020-12-01 15:39:10,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:39:10,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:39:10,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:39:10,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:39:10,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10" (1/1) ... [2020-12-01 15:39:10,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10" (1/1) ... [2020-12-01 15:39:10,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10" (1/1) ... [2020-12-01 15:39:10,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10" (1/1) ... [2020-12-01 15:39:10,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10" (1/1) ... [2020-12-01 15:39:10,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10" (1/1) ... [2020-12-01 15:39:10,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10" (1/1) ... [2020-12-01 15:39:10,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:39:10,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:39:10,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:39:10,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:39:10,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/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-12-01 15:39:10,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:39:10,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:39:10,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:39:10,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:39:11,223 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:39:11,233 INFO L298 CfgBuilder]: Removed 32 assume(true) statements. [2020-12-01 15:39:11,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:39:11 BoogieIcfgContainer [2020-12-01 15:39:11,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:39:11,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:39:11,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:39:11,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:39:11,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:39:09" (1/3) ... [2020-12-01 15:39:11,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b37359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:39:11, skipping insertion in model container [2020-12-01 15:39:11,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:39:10" (2/3) ... [2020-12-01 15:39:11,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b37359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:39:11, skipping insertion in model container [2020-12-01 15:39:11,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:39:11" (3/3) ... [2020-12-01 15:39:11,259 INFO L111 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2020-12-01 15:39:11,277 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:39:11,282 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-01 15:39:11,296 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-01 15:39:11,329 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:39:11,330 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:39:11,330 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:39:11,330 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:39:11,331 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:39:11,331 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:39:11,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:39:11,332 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:39:11,354 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2020-12-01 15:39:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:11,363 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:11,365 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, 1] [2020-12-01 15:39:11,365 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash -895778102, now seen corresponding path program 1 times [2020-12-01 15:39:11,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:11,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777264353] [2020-12-01 15:39:11,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:11,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777264353] [2020-12-01 15:39:11,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:11,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:11,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002099172] [2020-12-01 15:39:11,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:11,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:11,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:11,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:11,660 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2020-12-01 15:39:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:11,762 INFO L93 Difference]: Finished difference Result 252 states and 463 transitions. [2020-12-01 15:39:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:11,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-01 15:39:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:11,787 INFO L225 Difference]: With dead ends: 252 [2020-12-01 15:39:11,788 INFO L226 Difference]: Without dead ends: 125 [2020-12-01 15:39:11,792 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-12-01 15:39:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-01 15:39:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-12-01 15:39:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-01 15:39:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 218 transitions. [2020-12-01 15:39:11,850 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 218 transitions. Word has length 36 [2020-12-01 15:39:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:11,851 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 218 transitions. [2020-12-01 15:39:11,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 218 transitions. [2020-12-01 15:39:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:11,854 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:11,855 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, 1] [2020-12-01 15:39:11,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:39:11,855 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:11,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1597377976, now seen corresponding path program 1 times [2020-12-01 15:39:11,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:11,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583008705] [2020-12-01 15:39:11,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:11,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583008705] [2020-12-01 15:39:11,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:11,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:11,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530291675] [2020-12-01 15:39:11,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:11,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:11,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:11,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:11,949 INFO L87 Difference]: Start difference. First operand 125 states and 218 transitions. Second operand 4 states. [2020-12-01 15:39:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:12,040 INFO L93 Difference]: Finished difference Result 337 states and 586 transitions. [2020-12-01 15:39:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:39:12,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-01 15:39:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:12,049 INFO L225 Difference]: With dead ends: 337 [2020-12-01 15:39:12,049 INFO L226 Difference]: Without dead ends: 215 [2020-12-01 15:39:12,051 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-12-01 15:39:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-12-01 15:39:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2020-12-01 15:39:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-01 15:39:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 366 transitions. [2020-12-01 15:39:12,102 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 366 transitions. Word has length 36 [2020-12-01 15:39:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:12,103 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 366 transitions. [2020-12-01 15:39:12,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 366 transitions. [2020-12-01 15:39:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:12,110 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:12,112 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, 1] [2020-12-01 15:39:12,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:39:12,112 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash -211174582, now seen corresponding path program 1 times [2020-12-01 15:39:12,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:12,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445515846] [2020-12-01 15:39:12,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:12,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445515846] [2020-12-01 15:39:12,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:12,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:12,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891933768] [2020-12-01 15:39:12,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:12,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:12,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:12,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:12,283 INFO L87 Difference]: Start difference. First operand 210 states and 366 transitions. Second operand 3 states. [2020-12-01 15:39:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:12,373 INFO L93 Difference]: Finished difference Result 411 states and 719 transitions. [2020-12-01 15:39:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:12,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-01 15:39:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:12,377 INFO L225 Difference]: With dead ends: 411 [2020-12-01 15:39:12,377 INFO L226 Difference]: Without dead ends: 210 [2020-12-01 15:39:12,380 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-12-01 15:39:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-12-01 15:39:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2020-12-01 15:39:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-01 15:39:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 354 transitions. [2020-12-01 15:39:12,441 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 354 transitions. Word has length 36 [2020-12-01 15:39:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:12,442 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 354 transitions. [2020-12-01 15:39:12,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 354 transitions. [2020-12-01 15:39:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:12,448 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:12,448 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, 1] [2020-12-01 15:39:12,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:39:12,450 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:12,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:12,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1741716026, now seen corresponding path program 1 times [2020-12-01 15:39:12,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:12,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720734239] [2020-12-01 15:39:12,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:12,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720734239] [2020-12-01 15:39:12,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:12,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:12,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334682861] [2020-12-01 15:39:12,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:12,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:12,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:12,517 INFO L87 Difference]: Start difference. First operand 210 states and 354 transitions. Second operand 4 states. [2020-12-01 15:39:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:12,670 INFO L93 Difference]: Finished difference Result 571 states and 965 transitions. [2020-12-01 15:39:12,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:39:12,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-01 15:39:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:12,677 INFO L225 Difference]: With dead ends: 571 [2020-12-01 15:39:12,677 INFO L226 Difference]: Without dead ends: 371 [2020-12-01 15:39:12,683 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-12-01 15:39:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-12-01 15:39:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 210. [2020-12-01 15:39:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-01 15:39:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2020-12-01 15:39:12,735 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 36 [2020-12-01 15:39:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:12,736 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2020-12-01 15:39:12,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2020-12-01 15:39:12,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:12,740 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:12,741 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, 1] [2020-12-01 15:39:12,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:39:12,741 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:12,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:12,742 INFO L82 PathProgramCache]: Analyzing trace with hash 181512008, now seen corresponding path program 1 times [2020-12-01 15:39:12,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:12,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763866271] [2020-12-01 15:39:12,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:12,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763866271] [2020-12-01 15:39:12,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:12,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:12,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259513762] [2020-12-01 15:39:12,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:12,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:12,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:12,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:12,838 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 4 states. [2020-12-01 15:39:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:12,959 INFO L93 Difference]: Finished difference Result 574 states and 961 transitions. [2020-12-01 15:39:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:39:12,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-01 15:39:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:12,963 INFO L225 Difference]: With dead ends: 574 [2020-12-01 15:39:12,963 INFO L226 Difference]: Without dead ends: 375 [2020-12-01 15:39:12,964 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-12-01 15:39:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-12-01 15:39:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 210. [2020-12-01 15:39:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-12-01 15:39:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2020-12-01 15:39:13,001 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 36 [2020-12-01 15:39:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:13,002 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2020-12-01 15:39:13,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2020-12-01 15:39:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:13,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:13,008 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, 1] [2020-12-01 15:39:13,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:39:13,009 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:13,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash 243551622, now seen corresponding path program 1 times [2020-12-01 15:39:13,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:13,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614526605] [2020-12-01 15:39:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:13,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614526605] [2020-12-01 15:39:13,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:13,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:13,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103215907] [2020-12-01 15:39:13,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:13,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:13,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:13,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:13,121 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 4 states. [2020-12-01 15:39:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:13,227 INFO L93 Difference]: Finished difference Result 586 states and 972 transitions. [2020-12-01 15:39:13,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:39:13,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-01 15:39:13,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:13,231 INFO L225 Difference]: With dead ends: 586 [2020-12-01 15:39:13,231 INFO L226 Difference]: Without dead ends: 388 [2020-12-01 15:39:13,232 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-12-01 15:39:13,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-01 15:39:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 216. [2020-12-01 15:39:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-12-01 15:39:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 352 transitions. [2020-12-01 15:39:13,251 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 352 transitions. Word has length 36 [2020-12-01 15:39:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:13,258 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 352 transitions. [2020-12-01 15:39:13,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 352 transitions. [2020-12-01 15:39:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:13,263 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:13,264 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, 1] [2020-12-01 15:39:13,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 15:39:13,265 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:13,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:13,268 INFO L82 PathProgramCache]: Analyzing trace with hash 384100232, now seen corresponding path program 1 times [2020-12-01 15:39:13,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:13,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445006698] [2020-12-01 15:39:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:13,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445006698] [2020-12-01 15:39:13,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:13,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:13,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455698359] [2020-12-01 15:39:13,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:13,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:13,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:13,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:13,359 INFO L87 Difference]: Start difference. First operand 216 states and 352 transitions. Second operand 4 states. [2020-12-01 15:39:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:13,489 INFO L93 Difference]: Finished difference Result 737 states and 1201 transitions. [2020-12-01 15:39:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:39:13,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-01 15:39:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:13,494 INFO L225 Difference]: With dead ends: 737 [2020-12-01 15:39:13,494 INFO L226 Difference]: Without dead ends: 534 [2020-12-01 15:39:13,496 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-12-01 15:39:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-12-01 15:39:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 351. [2020-12-01 15:39:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-12-01 15:39:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 571 transitions. [2020-12-01 15:39:13,533 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 571 transitions. Word has length 36 [2020-12-01 15:39:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:13,534 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 571 transitions. [2020-12-01 15:39:13,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 571 transitions. [2020-12-01 15:39:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:13,537 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:13,537 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, 1] [2020-12-01 15:39:13,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:39:13,538 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:13,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:13,539 INFO L82 PathProgramCache]: Analyzing trace with hash 250086726, now seen corresponding path program 1 times [2020-12-01 15:39:13,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:13,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799047396] [2020-12-01 15:39:13,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:13,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799047396] [2020-12-01 15:39:13,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:13,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:13,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86350137] [2020-12-01 15:39:13,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:13,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:13,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:13,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:13,627 INFO L87 Difference]: Start difference. First operand 351 states and 571 transitions. Second operand 3 states. [2020-12-01 15:39:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:13,698 INFO L93 Difference]: Finished difference Result 838 states and 1368 transitions. [2020-12-01 15:39:13,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:13,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-01 15:39:13,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:13,703 INFO L225 Difference]: With dead ends: 838 [2020-12-01 15:39:13,703 INFO L226 Difference]: Without dead ends: 511 [2020-12-01 15:39:13,704 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-12-01 15:39:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-12-01 15:39:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 507. [2020-12-01 15:39:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-01 15:39:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 825 transitions. [2020-12-01 15:39:13,744 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 825 transitions. Word has length 36 [2020-12-01 15:39:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:13,747 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 825 transitions. [2020-12-01 15:39:13,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 825 transitions. [2020-12-01 15:39:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:13,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:13,748 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, 1] [2020-12-01 15:39:13,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:39:13,749 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:13,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1539792066, now seen corresponding path program 1 times [2020-12-01 15:39:13,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:13,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117145062] [2020-12-01 15:39:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:13,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117145062] [2020-12-01 15:39:13,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:13,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:13,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012046310] [2020-12-01 15:39:13,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:13,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:13,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:13,826 INFO L87 Difference]: Start difference. First operand 507 states and 825 transitions. Second operand 4 states. [2020-12-01 15:39:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:13,957 INFO L93 Difference]: Finished difference Result 1293 states and 2104 transitions. [2020-12-01 15:39:13,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:39:13,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-01 15:39:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:13,965 INFO L225 Difference]: With dead ends: 1293 [2020-12-01 15:39:13,965 INFO L226 Difference]: Without dead ends: 803 [2020-12-01 15:39:13,966 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-12-01 15:39:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2020-12-01 15:39:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 507. [2020-12-01 15:39:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-01 15:39:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 817 transitions. [2020-12-01 15:39:14,018 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 817 transitions. Word has length 36 [2020-12-01 15:39:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:14,019 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 817 transitions. [2020-12-01 15:39:14,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 817 transitions. [2020-12-01 15:39:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:14,020 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:14,020 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, 1] [2020-12-01 15:39:14,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:39:14,021 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:14,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:14,022 INFO L82 PathProgramCache]: Analyzing trace with hash -48555836, now seen corresponding path program 1 times [2020-12-01 15:39:14,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:14,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606150401] [2020-12-01 15:39:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:14,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606150401] [2020-12-01 15:39:14,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:14,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:14,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421925596] [2020-12-01 15:39:14,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:14,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:14,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:14,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:14,104 INFO L87 Difference]: Start difference. First operand 507 states and 817 transitions. Second operand 4 states. [2020-12-01 15:39:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:14,241 INFO L93 Difference]: Finished difference Result 1289 states and 2077 transitions. [2020-12-01 15:39:14,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:39:14,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-01 15:39:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:14,251 INFO L225 Difference]: With dead ends: 1289 [2020-12-01 15:39:14,251 INFO L226 Difference]: Without dead ends: 805 [2020-12-01 15:39:14,253 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-12-01 15:39:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-12-01 15:39:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 507. [2020-12-01 15:39:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-01 15:39:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 809 transitions. [2020-12-01 15:39:14,304 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 809 transitions. Word has length 36 [2020-12-01 15:39:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:14,306 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 809 transitions. [2020-12-01 15:39:14,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 809 transitions. [2020-12-01 15:39:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:14,308 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:14,308 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, 1] [2020-12-01 15:39:14,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:39:14,310 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1328419514, now seen corresponding path program 1 times [2020-12-01 15:39:14,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:14,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872516876] [2020-12-01 15:39:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:14,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872516876] [2020-12-01 15:39:14,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:14,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:14,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647690131] [2020-12-01 15:39:14,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:14,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:14,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:14,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:14,377 INFO L87 Difference]: Start difference. First operand 507 states and 809 transitions. Second operand 4 states. [2020-12-01 15:39:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:14,521 INFO L93 Difference]: Finished difference Result 1226 states and 1951 transitions. [2020-12-01 15:39:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:39:14,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-12-01 15:39:14,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:14,528 INFO L225 Difference]: With dead ends: 1226 [2020-12-01 15:39:14,529 INFO L226 Difference]: Without dead ends: 736 [2020-12-01 15:39:14,532 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-12-01 15:39:14,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2020-12-01 15:39:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 555. [2020-12-01 15:39:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-12-01 15:39:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 866 transitions. [2020-12-01 15:39:14,580 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 866 transitions. Word has length 36 [2020-12-01 15:39:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:14,581 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 866 transitions. [2020-12-01 15:39:14,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 866 transitions. [2020-12-01 15:39:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 15:39:14,582 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:14,582 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, 1] [2020-12-01 15:39:14,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 15:39:14,583 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:14,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:14,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1915225528, now seen corresponding path program 1 times [2020-12-01 15:39:14,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:14,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307266181] [2020-12-01 15:39:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:14,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307266181] [2020-12-01 15:39:14,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:14,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:14,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517916929] [2020-12-01 15:39:14,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:14,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:14,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:14,627 INFO L87 Difference]: Start difference. First operand 555 states and 866 transitions. Second operand 3 states. [2020-12-01 15:39:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:14,723 INFO L93 Difference]: Finished difference Result 1316 states and 2058 transitions. [2020-12-01 15:39:14,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:14,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-01 15:39:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:14,730 INFO L225 Difference]: With dead ends: 1316 [2020-12-01 15:39:14,730 INFO L226 Difference]: Without dead ends: 775 [2020-12-01 15:39:14,732 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-12-01 15:39:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-12-01 15:39:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 772. [2020-12-01 15:39:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-12-01 15:39:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1190 transitions. [2020-12-01 15:39:14,813 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1190 transitions. Word has length 36 [2020-12-01 15:39:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:14,814 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1190 transitions. [2020-12-01 15:39:14,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1190 transitions. [2020-12-01 15:39:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-01 15:39:14,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:14,816 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-12-01 15:39:14,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 15:39:14,816 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:14,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1824541764, now seen corresponding path program 1 times [2020-12-01 15:39:14,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:14,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415275523] [2020-12-01 15:39:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:14,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-12-01 15:39:14,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415275523] [2020-12-01 15:39:14,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:14,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:14,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929876320] [2020-12-01 15:39:14,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:14,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:14,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:14,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:14,860 INFO L87 Difference]: Start difference. First operand 772 states and 1190 transitions. Second operand 3 states. [2020-12-01 15:39:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:14,979 INFO L93 Difference]: Finished difference Result 1906 states and 2978 transitions. [2020-12-01 15:39:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:14,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-01 15:39:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:14,988 INFO L225 Difference]: With dead ends: 1906 [2020-12-01 15:39:14,989 INFO L226 Difference]: Without dead ends: 1161 [2020-12-01 15:39:14,990 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-12-01 15:39:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-12-01 15:39:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1157. [2020-12-01 15:39:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2020-12-01 15:39:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1801 transitions. [2020-12-01 15:39:15,087 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1801 transitions. Word has length 46 [2020-12-01 15:39:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:15,087 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1801 transitions. [2020-12-01 15:39:15,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1801 transitions. [2020-12-01 15:39:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-01 15:39:15,091 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:15,091 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-12-01 15:39:15,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 15:39:15,092 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:15,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1576395270, now seen corresponding path program 1 times [2020-12-01 15:39:15,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:15,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003831431] [2020-12-01 15:39:15,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-01 15:39:15,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003831431] [2020-12-01 15:39:15,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:15,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:15,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667363133] [2020-12-01 15:39:15,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:15,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:15,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:15,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:15,131 INFO L87 Difference]: Start difference. First operand 1157 states and 1801 transitions. Second operand 3 states. [2020-12-01 15:39:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:15,249 INFO L93 Difference]: Finished difference Result 2265 states and 3543 transitions. [2020-12-01 15:39:15,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:15,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-01 15:39:15,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:15,257 INFO L225 Difference]: With dead ends: 2265 [2020-12-01 15:39:15,257 INFO L226 Difference]: Without dead ends: 1135 [2020-12-01 15:39:15,263 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-12-01 15:39:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2020-12-01 15:39:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2020-12-01 15:39:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2020-12-01 15:39:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1774 transitions. [2020-12-01 15:39:15,347 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1774 transitions. Word has length 46 [2020-12-01 15:39:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:15,347 INFO L481 AbstractCegarLoop]: Abstraction has 1135 states and 1774 transitions. [2020-12-01 15:39:15,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:15,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1774 transitions. [2020-12-01 15:39:15,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-01 15:39:15,348 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:15,348 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-12-01 15:39:15,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 15:39:15,349 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:15,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash 121182915, now seen corresponding path program 1 times [2020-12-01 15:39:15,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:15,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008517038] [2020-12-01 15:39:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:15,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008517038] [2020-12-01 15:39:15,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:15,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:15,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469236270] [2020-12-01 15:39:15,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:15,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:15,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:15,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:15,395 INFO L87 Difference]: Start difference. First operand 1135 states and 1774 transitions. Second operand 3 states. [2020-12-01 15:39:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:15,556 INFO L93 Difference]: Finished difference Result 2891 states and 4579 transitions. [2020-12-01 15:39:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:15,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-01 15:39:15,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:15,569 INFO L225 Difference]: With dead ends: 2891 [2020-12-01 15:39:15,569 INFO L226 Difference]: Without dead ends: 1783 [2020-12-01 15:39:15,573 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-12-01 15:39:15,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2020-12-01 15:39:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1779. [2020-12-01 15:39:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2020-12-01 15:39:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2808 transitions. [2020-12-01 15:39:15,752 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2808 transitions. Word has length 47 [2020-12-01 15:39:15,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:15,753 INFO L481 AbstractCegarLoop]: Abstraction has 1779 states and 2808 transitions. [2020-12-01 15:39:15,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2808 transitions. [2020-12-01 15:39:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-01 15:39:15,755 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:15,756 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-12-01 15:39:15,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 15:39:15,756 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash 241239015, now seen corresponding path program 1 times [2020-12-01 15:39:15,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:15,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130500852] [2020-12-01 15:39:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:15,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130500852] [2020-12-01 15:39:15,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:15,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:15,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098235811] [2020-12-01 15:39:15,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:15,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:15,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:15,822 INFO L87 Difference]: Start difference. First operand 1779 states and 2808 transitions. Second operand 3 states. [2020-12-01 15:39:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:16,104 INFO L93 Difference]: Finished difference Result 4794 states and 7664 transitions. [2020-12-01 15:39:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:16,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-01 15:39:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:16,125 INFO L225 Difference]: With dead ends: 4794 [2020-12-01 15:39:16,125 INFO L226 Difference]: Without dead ends: 3044 [2020-12-01 15:39:16,129 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-12-01 15:39:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2020-12-01 15:39:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3040. [2020-12-01 15:39:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3040 states. [2020-12-01 15:39:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 4843 transitions. [2020-12-01 15:39:16,385 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 4843 transitions. Word has length 48 [2020-12-01 15:39:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:16,385 INFO L481 AbstractCegarLoop]: Abstraction has 3040 states and 4843 transitions. [2020-12-01 15:39:16,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 4843 transitions. [2020-12-01 15:39:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-01 15:39:16,388 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:16,388 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-12-01 15:39:16,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-01 15:39:16,388 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:16,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:16,389 INFO L82 PathProgramCache]: Analyzing trace with hash 489385509, now seen corresponding path program 1 times [2020-12-01 15:39:16,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:16,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865510322] [2020-12-01 15:39:16,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-01 15:39:16,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865510322] [2020-12-01 15:39:16,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:16,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:16,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2277129] [2020-12-01 15:39:16,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:16,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:16,431 INFO L87 Difference]: Start difference. First operand 3040 states and 4843 transitions. Second operand 3 states. [2020-12-01 15:39:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:16,656 INFO L93 Difference]: Finished difference Result 6029 states and 9627 transitions. [2020-12-01 15:39:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:16,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-01 15:39:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:16,676 INFO L225 Difference]: With dead ends: 6029 [2020-12-01 15:39:16,677 INFO L226 Difference]: Without dead ends: 3018 [2020-12-01 15:39:16,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-12-01 15:39:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-12-01 15:39:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2020-12-01 15:39:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-12-01 15:39:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4817 transitions. [2020-12-01 15:39:16,943 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4817 transitions. Word has length 48 [2020-12-01 15:39:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:16,943 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 4817 transitions. [2020-12-01 15:39:16,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4817 transitions. [2020-12-01 15:39:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-01 15:39:16,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:16,946 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] [2020-12-01 15:39:16,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-01 15:39:16,946 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:16,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:16,947 INFO L82 PathProgramCache]: Analyzing trace with hash 497105560, now seen corresponding path program 1 times [2020-12-01 15:39:16,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:16,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220896004] [2020-12-01 15:39:16,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:16,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220896004] [2020-12-01 15:39:16,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:16,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:16,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972904761] [2020-12-01 15:39:16,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:16,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:16,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:16,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:16,998 INFO L87 Difference]: Start difference. First operand 3018 states and 4817 transitions. Second operand 4 states. [2020-12-01 15:39:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:17,534 INFO L93 Difference]: Finished difference Result 7617 states and 12199 transitions. [2020-12-01 15:39:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:39:17,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-01 15:39:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:17,563 INFO L225 Difference]: With dead ends: 7617 [2020-12-01 15:39:17,563 INFO L226 Difference]: Without dead ends: 3895 [2020-12-01 15:39:17,570 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-12-01 15:39:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2020-12-01 15:39:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 3895. [2020-12-01 15:39:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3895 states. [2020-12-01 15:39:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 6183 transitions. [2020-12-01 15:39:17,922 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 6183 transitions. Word has length 49 [2020-12-01 15:39:17,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:17,922 INFO L481 AbstractCegarLoop]: Abstraction has 3895 states and 6183 transitions. [2020-12-01 15:39:17,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 6183 transitions. [2020-12-01 15:39:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-01 15:39:17,925 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:17,925 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, 1] [2020-12-01 15:39:17,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-01 15:39:17,926 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:17,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:17,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1266326705, now seen corresponding path program 1 times [2020-12-01 15:39:17,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:17,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875667331] [2020-12-01 15:39:17,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:17,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875667331] [2020-12-01 15:39:17,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:17,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:39:17,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331979523] [2020-12-01 15:39:17,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:39:17,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:17,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:39:17,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:39:17,992 INFO L87 Difference]: Start difference. First operand 3895 states and 6183 transitions. Second operand 5 states. [2020-12-01 15:39:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:18,566 INFO L93 Difference]: Finished difference Result 9940 states and 15662 transitions. [2020-12-01 15:39:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:39:18,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-12-01 15:39:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:18,607 INFO L225 Difference]: With dead ends: 9940 [2020-12-01 15:39:18,607 INFO L226 Difference]: Without dead ends: 6068 [2020-12-01 15:39:18,612 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-12-01 15:39:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-12-01 15:39:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 4554. [2020-12-01 15:39:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4554 states. [2020-12-01 15:39:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 7072 transitions. [2020-12-01 15:39:19,090 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 7072 transitions. Word has length 54 [2020-12-01 15:39:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:19,090 INFO L481 AbstractCegarLoop]: Abstraction has 4554 states and 7072 transitions. [2020-12-01 15:39:19,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:39:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 7072 transitions. [2020-12-01 15:39:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-01 15:39:19,095 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:19,096 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-12-01 15:39:19,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-01 15:39:19,096 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:19,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:19,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1019387986, now seen corresponding path program 1 times [2020-12-01 15:39:19,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:19,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857818900] [2020-12-01 15:39:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:19,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857818900] [2020-12-01 15:39:19,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:19,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:19,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994023754] [2020-12-01 15:39:19,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:19,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:19,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:19,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:19,162 INFO L87 Difference]: Start difference. First operand 4554 states and 7072 transitions. Second operand 3 states. [2020-12-01 15:39:19,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:19,612 INFO L93 Difference]: Finished difference Result 9431 states and 14610 transitions. [2020-12-01 15:39:19,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:19,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-01 15:39:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:19,630 INFO L225 Difference]: With dead ends: 9431 [2020-12-01 15:39:19,630 INFO L226 Difference]: Without dead ends: 4906 [2020-12-01 15:39:19,638 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-12-01 15:39:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2020-12-01 15:39:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 4874. [2020-12-01 15:39:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4874 states. [2020-12-01 15:39:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 7321 transitions. [2020-12-01 15:39:20,057 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 7321 transitions. Word has length 86 [2020-12-01 15:39:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:20,057 INFO L481 AbstractCegarLoop]: Abstraction has 4874 states and 7321 transitions. [2020-12-01 15:39:20,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7321 transitions. [2020-12-01 15:39:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-01 15:39:20,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:20,063 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-12-01 15:39:20,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-01 15:39:20,064 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash 359155335, now seen corresponding path program 1 times [2020-12-01 15:39:20,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:20,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268025190] [2020-12-01 15:39:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:20,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268025190] [2020-12-01 15:39:20,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:20,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:20,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430732012] [2020-12-01 15:39:20,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:20,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:20,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:20,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:20,111 INFO L87 Difference]: Start difference. First operand 4874 states and 7321 transitions. Second operand 3 states. [2020-12-01 15:39:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:20,636 INFO L93 Difference]: Finished difference Result 10229 states and 15320 transitions. [2020-12-01 15:39:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:20,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-01 15:39:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:20,658 INFO L225 Difference]: With dead ends: 10229 [2020-12-01 15:39:20,658 INFO L226 Difference]: Without dead ends: 5396 [2020-12-01 15:39:20,665 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-12-01 15:39:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2020-12-01 15:39:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5348. [2020-12-01 15:39:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5348 states. [2020-12-01 15:39:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 7764 transitions. [2020-12-01 15:39:21,065 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 7764 transitions. Word has length 87 [2020-12-01 15:39:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:21,066 INFO L481 AbstractCegarLoop]: Abstraction has 5348 states and 7764 transitions. [2020-12-01 15:39:21,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 7764 transitions. [2020-12-01 15:39:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-01 15:39:21,074 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:21,075 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-12-01 15:39:21,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-01 15:39:21,075 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:21,076 INFO L82 PathProgramCache]: Analyzing trace with hash -503038292, now seen corresponding path program 1 times [2020-12-01 15:39:21,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:21,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959491682] [2020-12-01 15:39:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:39:21,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959491682] [2020-12-01 15:39:21,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:21,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:21,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822938822] [2020-12-01 15:39:21,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:21,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:21,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:21,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:21,121 INFO L87 Difference]: Start difference. First operand 5348 states and 7764 transitions. Second operand 3 states. [2020-12-01 15:39:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:21,547 INFO L93 Difference]: Finished difference Result 11003 states and 15979 transitions. [2020-12-01 15:39:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:21,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-12-01 15:39:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:21,562 INFO L225 Difference]: With dead ends: 11003 [2020-12-01 15:39:21,562 INFO L226 Difference]: Without dead ends: 5716 [2020-12-01 15:39:21,572 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-12-01 15:39:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2020-12-01 15:39:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5130. [2020-12-01 15:39:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5130 states. [2020-12-01 15:39:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5130 states to 5130 states and 7126 transitions. [2020-12-01 15:39:22,115 INFO L78 Accepts]: Start accepts. Automaton has 5130 states and 7126 transitions. Word has length 88 [2020-12-01 15:39:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:22,115 INFO L481 AbstractCegarLoop]: Abstraction has 5130 states and 7126 transitions. [2020-12-01 15:39:22,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 5130 states and 7126 transitions. [2020-12-01 15:39:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-01 15:39:22,124 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:22,124 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, 1] [2020-12-01 15:39:22,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-01 15:39:22,124 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2120110985, now seen corresponding path program 1 times [2020-12-01 15:39:22,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:22,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126888699] [2020-12-01 15:39:22,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-01 15:39:22,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126888699] [2020-12-01 15:39:22,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:22,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:22,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68636571] [2020-12-01 15:39:22,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:22,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:22,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:22,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:22,221 INFO L87 Difference]: Start difference. First operand 5130 states and 7126 transitions. Second operand 4 states. [2020-12-01 15:39:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:23,012 INFO L93 Difference]: Finished difference Result 9554 states and 13184 transitions. [2020-12-01 15:39:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:39:23,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-12-01 15:39:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:23,026 INFO L225 Difference]: With dead ends: 9554 [2020-12-01 15:39:23,026 INFO L226 Difference]: Without dead ends: 4875 [2020-12-01 15:39:23,034 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-12-01 15:39:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2020-12-01 15:39:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4759. [2020-12-01 15:39:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4759 states. [2020-12-01 15:39:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6364 transitions. [2020-12-01 15:39:23,493 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6364 transitions. Word has length 89 [2020-12-01 15:39:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:23,494 INFO L481 AbstractCegarLoop]: Abstraction has 4759 states and 6364 transitions. [2020-12-01 15:39:23,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6364 transitions. [2020-12-01 15:39:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-01 15:39:23,508 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:23,508 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, 1] [2020-12-01 15:39:23,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-01 15:39:23,508 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:23,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:23,509 INFO L82 PathProgramCache]: Analyzing trace with hash 520985863, now seen corresponding path program 1 times [2020-12-01 15:39:23,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:23,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931327267] [2020-12-01 15:39:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 15:39:23,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931327267] [2020-12-01 15:39:23,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:23,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:23,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872851187] [2020-12-01 15:39:23,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:23,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:23,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:23,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:23,564 INFO L87 Difference]: Start difference. First operand 4759 states and 6364 transitions. Second operand 3 states. [2020-12-01 15:39:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:24,000 INFO L93 Difference]: Finished difference Result 9073 states and 12125 transitions. [2020-12-01 15:39:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:24,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-01 15:39:24,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:24,013 INFO L225 Difference]: With dead ends: 9073 [2020-12-01 15:39:24,013 INFO L226 Difference]: Without dead ends: 4705 [2020-12-01 15:39:24,019 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-12-01 15:39:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4705 states. [2020-12-01 15:39:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4705 to 4705. [2020-12-01 15:39:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4705 states. [2020-12-01 15:39:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 6258 transitions. [2020-12-01 15:39:24,489 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 6258 transitions. Word has length 116 [2020-12-01 15:39:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:24,490 INFO L481 AbstractCegarLoop]: Abstraction has 4705 states and 6258 transitions. [2020-12-01 15:39:24,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 6258 transitions. [2020-12-01 15:39:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-01 15:39:24,561 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:24,561 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] [2020-12-01 15:39:24,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-01 15:39:24,561 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:24,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:24,562 INFO L82 PathProgramCache]: Analyzing trace with hash -778538235, now seen corresponding path program 1 times [2020-12-01 15:39:24,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:24,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558451709] [2020-12-01 15:39:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 15:39:24,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558451709] [2020-12-01 15:39:24,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:24,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:24,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990226176] [2020-12-01 15:39:24,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:24,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:24,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:24,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:24,658 INFO L87 Difference]: Start difference. First operand 4705 states and 6258 transitions. Second operand 4 states. [2020-12-01 15:39:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:25,071 INFO L93 Difference]: Finished difference Result 8363 states and 11148 transitions. [2020-12-01 15:39:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:39:25,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2020-12-01 15:39:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:25,080 INFO L225 Difference]: With dead ends: 8363 [2020-12-01 15:39:25,080 INFO L226 Difference]: Without dead ends: 4627 [2020-12-01 15:39:25,086 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-12-01 15:39:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2020-12-01 15:39:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4623. [2020-12-01 15:39:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4623 states. [2020-12-01 15:39:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6037 transitions. [2020-12-01 15:39:25,489 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6037 transitions. Word has length 128 [2020-12-01 15:39:25,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:25,489 INFO L481 AbstractCegarLoop]: Abstraction has 4623 states and 6037 transitions. [2020-12-01 15:39:25,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6037 transitions. [2020-12-01 15:39:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-01 15:39:25,500 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:25,500 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, 1] [2020-12-01 15:39:25,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-01 15:39:25,501 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1096157553, now seen corresponding path program 1 times [2020-12-01 15:39:25,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:25,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513363757] [2020-12-01 15:39:25,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 15:39:25,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513363757] [2020-12-01 15:39:25,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:25,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:25,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266107063] [2020-12-01 15:39:25,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:25,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:25,569 INFO L87 Difference]: Start difference. First operand 4623 states and 6037 transitions. Second operand 3 states. [2020-12-01 15:39:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:26,079 INFO L93 Difference]: Finished difference Result 8859 states and 11562 transitions. [2020-12-01 15:39:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:26,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-12-01 15:39:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:26,089 INFO L225 Difference]: With dead ends: 8859 [2020-12-01 15:39:26,089 INFO L226 Difference]: Without dead ends: 4622 [2020-12-01 15:39:26,095 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-12-01 15:39:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2020-12-01 15:39:26,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 4582. [2020-12-01 15:39:26,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4582 states. [2020-12-01 15:39:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 5954 transitions. [2020-12-01 15:39:26,558 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 5954 transitions. Word has length 134 [2020-12-01 15:39:26,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:26,558 INFO L481 AbstractCegarLoop]: Abstraction has 4582 states and 5954 transitions. [2020-12-01 15:39:26,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 5954 transitions. [2020-12-01 15:39:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-01 15:39:26,569 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:26,570 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, 1] [2020-12-01 15:39:26,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-01 15:39:26,570 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:26,571 INFO L82 PathProgramCache]: Analyzing trace with hash 966130961, now seen corresponding path program 1 times [2020-12-01 15:39:26,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:26,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754685948] [2020-12-01 15:39:26,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-01 15:39:26,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754685948] [2020-12-01 15:39:26,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:26,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:26,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496978814] [2020-12-01 15:39:26,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:26,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:26,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:26,638 INFO L87 Difference]: Start difference. First operand 4582 states and 5954 transitions. Second operand 3 states. [2020-12-01 15:39:27,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:27,025 INFO L93 Difference]: Finished difference Result 8798 states and 11423 transitions. [2020-12-01 15:39:27,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:27,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2020-12-01 15:39:27,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:27,033 INFO L225 Difference]: With dead ends: 8798 [2020-12-01 15:39:27,033 INFO L226 Difference]: Without dead ends: 4592 [2020-12-01 15:39:27,040 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-12-01 15:39:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2020-12-01 15:39:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 4552. [2020-12-01 15:39:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2020-12-01 15:39:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 5883 transitions. [2020-12-01 15:39:27,667 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 5883 transitions. Word has length 134 [2020-12-01 15:39:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:27,667 INFO L481 AbstractCegarLoop]: Abstraction has 4552 states and 5883 transitions. [2020-12-01 15:39:27,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 5883 transitions. [2020-12-01 15:39:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-01 15:39:27,679 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:27,680 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, 1] [2020-12-01 15:39:27,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-01 15:39:27,680 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:27,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:27,681 INFO L82 PathProgramCache]: Analyzing trace with hash -710463440, now seen corresponding path program 1 times [2020-12-01 15:39:27,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:27,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961928125] [2020-12-01 15:39:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-01 15:39:27,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961928125] [2020-12-01 15:39:27,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:27,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:27,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348733511] [2020-12-01 15:39:27,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:27,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:27,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:27,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:27,766 INFO L87 Difference]: Start difference. First operand 4552 states and 5883 transitions. Second operand 4 states. [2020-12-01 15:39:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:28,285 INFO L93 Difference]: Finished difference Result 7425 states and 9645 transitions. [2020-12-01 15:39:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:39:28,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-12-01 15:39:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:28,291 INFO L225 Difference]: With dead ends: 7425 [2020-12-01 15:39:28,292 INFO L226 Difference]: Without dead ends: 3245 [2020-12-01 15:39:28,298 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-12-01 15:39:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2020-12-01 15:39:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 3241. [2020-12-01 15:39:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3241 states. [2020-12-01 15:39:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4085 transitions. [2020-12-01 15:39:28,740 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4085 transitions. Word has length 137 [2020-12-01 15:39:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:28,740 INFO L481 AbstractCegarLoop]: Abstraction has 3241 states and 4085 transitions. [2020-12-01 15:39:28,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4085 transitions. [2020-12-01 15:39:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-01 15:39:28,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:28,749 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, 1] [2020-12-01 15:39:28,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-01 15:39:28,749 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:28,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:28,750 INFO L82 PathProgramCache]: Analyzing trace with hash -691507333, now seen corresponding path program 1 times [2020-12-01 15:39:28,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:28,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200328148] [2020-12-01 15:39:28,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-01 15:39:28,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200328148] [2020-12-01 15:39:28,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:28,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:39:28,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306884118] [2020-12-01 15:39:28,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:39:28,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:28,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:39:28,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:39:28,835 INFO L87 Difference]: Start difference. First operand 3241 states and 4085 transitions. Second operand 4 states. [2020-12-01 15:39:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:29,118 INFO L93 Difference]: Finished difference Result 5244 states and 6615 transitions. [2020-12-01 15:39:29,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:39:29,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-12-01 15:39:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:29,121 INFO L225 Difference]: With dead ends: 5244 [2020-12-01 15:39:29,121 INFO L226 Difference]: Without dead ends: 2075 [2020-12-01 15:39:29,125 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-12-01 15:39:29,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2020-12-01 15:39:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2071. [2020-12-01 15:39:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-12-01 15:39:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2543 transitions. [2020-12-01 15:39:29,391 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2543 transitions. Word has length 137 [2020-12-01 15:39:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:29,391 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 2543 transitions. [2020-12-01 15:39:29,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:39:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2543 transitions. [2020-12-01 15:39:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-01 15:39:29,395 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:29,395 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, 1] [2020-12-01 15:39:29,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-01 15:39:29,396 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:29,397 INFO L82 PathProgramCache]: Analyzing trace with hash -737827078, now seen corresponding path program 1 times [2020-12-01 15:39:29,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:29,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477971992] [2020-12-01 15:39:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-01 15:39:29,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477971992] [2020-12-01 15:39:29,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:29,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:29,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597986017] [2020-12-01 15:39:29,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:29,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:29,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:29,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:29,501 INFO L87 Difference]: Start difference. First operand 2071 states and 2543 transitions. Second operand 3 states. [2020-12-01 15:39:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:29,678 INFO L93 Difference]: Finished difference Result 3759 states and 4649 transitions. [2020-12-01 15:39:29,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:29,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-12-01 15:39:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:29,681 INFO L225 Difference]: With dead ends: 3759 [2020-12-01 15:39:29,681 INFO L226 Difference]: Without dead ends: 2029 [2020-12-01 15:39:29,684 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-12-01 15:39:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2020-12-01 15:39:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1941. [2020-12-01 15:39:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-12-01 15:39:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2345 transitions. [2020-12-01 15:39:29,878 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2345 transitions. Word has length 176 [2020-12-01 15:39:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:29,878 INFO L481 AbstractCegarLoop]: Abstraction has 1941 states and 2345 transitions. [2020-12-01 15:39:29,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2345 transitions. [2020-12-01 15:39:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-01 15:39:29,881 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:29,881 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] [2020-12-01 15:39:29,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-01 15:39:29,882 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:29,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:29,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1218463733, now seen corresponding path program 1 times [2020-12-01 15:39:29,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:29,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756675520] [2020-12-01 15:39:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-01 15:39:29,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756675520] [2020-12-01 15:39:29,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:29,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:29,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612688677] [2020-12-01 15:39:29,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:29,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:29,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:29,954 INFO L87 Difference]: Start difference. First operand 1941 states and 2345 transitions. Second operand 3 states. [2020-12-01 15:39:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:30,230 INFO L93 Difference]: Finished difference Result 4180 states and 5086 transitions. [2020-12-01 15:39:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:30,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2020-12-01 15:39:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:30,234 INFO L225 Difference]: With dead ends: 4180 [2020-12-01 15:39:30,234 INFO L226 Difference]: Without dead ends: 2576 [2020-12-01 15:39:30,236 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-12-01 15:39:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2020-12-01 15:39:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2219. [2020-12-01 15:39:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2020-12-01 15:39:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 2645 transitions. [2020-12-01 15:39:30,401 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 2645 transitions. Word has length 182 [2020-12-01 15:39:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:30,401 INFO L481 AbstractCegarLoop]: Abstraction has 2219 states and 2645 transitions. [2020-12-01 15:39:30,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 2645 transitions. [2020-12-01 15:39:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-01 15:39:30,404 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:30,404 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, 1] [2020-12-01 15:39:30,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-01 15:39:30,405 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:30,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:30,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2019531348, now seen corresponding path program 1 times [2020-12-01 15:39:30,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:30,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569558020] [2020-12-01 15:39:30,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-12-01 15:39:30,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569558020] [2020-12-01 15:39:30,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:39:30,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:39:30,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409371806] [2020-12-01 15:39:30,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:39:30,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:30,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:39:30,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:39:30,486 INFO L87 Difference]: Start difference. First operand 2219 states and 2645 transitions. Second operand 3 states. [2020-12-01 15:39:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:30,834 INFO L93 Difference]: Finished difference Result 2233 states and 2662 transitions. [2020-12-01 15:39:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:39:30,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-12-01 15:39:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:30,838 INFO L225 Difference]: With dead ends: 2233 [2020-12-01 15:39:30,839 INFO L226 Difference]: Without dead ends: 2231 [2020-12-01 15:39:30,841 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-12-01 15:39:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2020-12-01 15:39:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2223. [2020-12-01 15:39:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2020-12-01 15:39:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2649 transitions. [2020-12-01 15:39:31,120 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 2649 transitions. Word has length 185 [2020-12-01 15:39:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:31,120 INFO L481 AbstractCegarLoop]: Abstraction has 2223 states and 2649 transitions. [2020-12-01 15:39:31,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:39:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2649 transitions. [2020-12-01 15:39:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-01 15:39:31,123 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:31,123 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, 1] [2020-12-01 15:39:31,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-01 15:39:31,124 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:31,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2019529810, now seen corresponding path program 1 times [2020-12-01 15:39:31,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:31,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540480858] [2020-12-01 15:39:31,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 15:39:31,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540480858] [2020-12-01 15:39:31,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584067135] [2020-12-01 15:39:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-01 15:39:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:39:31,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-01 15:39:31,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 15:39:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-01 15:39:32,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 15:39:32,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-12-01 15:39:32,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611022719] [2020-12-01 15:39:32,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-01 15:39:32,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:39:32,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-01 15:39:32,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-12-01 15:39:32,431 INFO L87 Difference]: Start difference. First operand 2223 states and 2649 transitions. Second operand 19 states. [2020-12-01 15:39:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:39:34,566 INFO L93 Difference]: Finished difference Result 7200 states and 8561 transitions. [2020-12-01 15:39:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-01 15:39:34,567 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 185 [2020-12-01 15:39:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:39:34,594 INFO L225 Difference]: With dead ends: 7200 [2020-12-01 15:39:34,594 INFO L226 Difference]: Without dead ends: 5301 [2020-12-01 15:39:34,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=1492, Unknown=0, NotChecked=0, Total=1722 [2020-12-01 15:39:34,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2020-12-01 15:39:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 2903. [2020-12-01 15:39:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2903 states. [2020-12-01 15:39:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 3446 transitions. [2020-12-01 15:39:35,056 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 3446 transitions. Word has length 185 [2020-12-01 15:39:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:39:35,057 INFO L481 AbstractCegarLoop]: Abstraction has 2903 states and 3446 transitions. [2020-12-01 15:39:35,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-01 15:39:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 3446 transitions. [2020-12-01 15:39:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-01 15:39:35,061 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:39:35,061 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, 1, 1] [2020-12-01 15:39:35,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-12-01 15:39:35,282 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:39:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:39:35,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1819084020, now seen corresponding path program 1 times [2020-12-01 15:39:35,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:39:35,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217390053] [2020-12-01 15:39:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:39:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:39:35,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:39:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:39:35,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:39:35,493 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:39:35,494 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 15:39:35,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-01 15:39:35,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:39:35 BoogieIcfgContainer [2020-12-01 15:39:35,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:39:35,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:39:35,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:39:35,834 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:39:35,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:39:11" (3/4) ... [2020-12-01 15:39:35,837 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 15:39:36,140 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3cfa67e9-2861-4ecd-a8b1-c71712dd8d1a/bin/uautomizer/witness.graphml [2020-12-01 15:39:36,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:39:36,143 INFO L168 Benchmark]: Toolchain (without parser) took 26663.64 ms. Allocated memory was 92.3 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 56.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 305.5 MB. Max. memory is 16.1 GB. [2020-12-01 15:39:36,144 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 92.3 MB. Free memory is still 73.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:39:36,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 557.86 ms. Allocated memory is still 92.3 MB. Free memory was 56.0 MB in the beginning and 66.0 MB in the end (delta: -10.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:39:36,145 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.71 ms. Allocated memory is still 92.3 MB. Free memory was 66.0 MB in the beginning and 63.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:39:36,146 INFO L168 Benchmark]: Boogie Preprocessor took 92.11 ms. Allocated memory is still 92.3 MB. Free memory was 63.5 MB in the beginning and 61.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:39:36,147 INFO L168 Benchmark]: RCFGBuilder took 999.77 ms. Allocated memory was 92.3 MB in the beginning and 117.4 MB in the end (delta: 25.2 MB). Free memory was 61.4 MB in the beginning and 80.5 MB in the end (delta: -19.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 16.1 GB. [2020-12-01 15:39:36,147 INFO L168 Benchmark]: TraceAbstraction took 24587.21 ms. Allocated memory was 117.4 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 80.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 269.8 MB. Max. memory is 16.1 GB. [2020-12-01 15:39:36,148 INFO L168 Benchmark]: Witness Printer took 307.29 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:39:36,151 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.38 ms. Allocated memory is still 92.3 MB. Free memory is still 73.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 557.86 ms. Allocated memory is still 92.3 MB. Free memory was 56.0 MB in the beginning and 66.0 MB in the end (delta: -10.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 102.71 ms. Allocated memory is still 92.3 MB. Free memory was 66.0 MB in the beginning and 63.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 92.11 ms. Allocated memory is still 92.3 MB. Free memory was 63.5 MB in the beginning and 61.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 999.77 ms. Allocated memory was 92.3 MB in the beginning and 117.4 MB in the end (delta: 25.2 MB). Free memory was 61.4 MB in the beginning and 80.5 MB in the end (delta: -19.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 24587.21 ms. Allocated memory was 117.4 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 80.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 269.8 MB. Max. memory is 16.1 GB. * Witness Printer took 307.29 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 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] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L404] int kernel_st ; [L407] 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] [L408] 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] [L419] COND TRUE (int )wl_i == 1 [L420] 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] [L424] COND TRUE (int )c1_i == 1 [L425] 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] [L429] COND TRUE (int )c2_i == 1 [L430] 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] [L434] COND TRUE (int )wb_i == 1 [L435] 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] [L439] COND FALSE !((int )r_i == 1) [L442] 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] [L444] 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] [L449] 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] [L454] 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] [L459] 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] [L464] 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] [L469] 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] [L477] 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] [L487] 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] [L496] 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] [L505] 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] [L514] 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] [L519] 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] [L524] 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] [L529] 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] [L534] 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] [L539] 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] [L545] 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] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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] [L298] 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] [L300] 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] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] 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] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] 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] [L141] 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] [L152] 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] [L154] c1_st = 2 [L155] 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] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] 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] [L186] 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] [L197] 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] [L199] c2_st = 2 [L200] 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] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] 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] [L231] 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] [L242] 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] [L244] wb_st = 2 [L245] 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] [L381] 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] [L298] 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] [L300] 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] [L303] 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] [L306] 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] [L309] 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] [L312] 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] [L551] 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] [L552] 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] [L563] 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] [L564] 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] [L569] 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] [L574] 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] [L579] 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] [L584] COND TRUE (int )e_wl == 0 [L585] 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] [L589] 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] [L590] COND TRUE (int )e_wl == 1 [L591] 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] [L607] 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] [L608] 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] [L616] 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] [L617] 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] [L625] 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] [L626] 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] [L634] 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] [L639] 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] [L644] 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] [L649] 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] [L654] 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] [L659] COND TRUE (int )e_wl == 1 [L660] 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] [L664] 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] [L545] 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] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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] [L298] 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] [L300] 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] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] 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] [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___0) [L342] 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] [L141] 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] [L144] 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] [L159] COND TRUE ! processed [L160] data += 1 [L161] 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] [L162] 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] [L163] COND TRUE (int )e_g == 1 [L164] 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] [L171] 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] [L152] 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] [L154] c1_st = 2 [L155] 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] [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND TRUE \read(tmp___1) [L357] 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] [L186] 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] [L189] 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] [L204] COND TRUE ! processed [L205] data += 1 [L206] 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] [L207] 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] [L208] COND TRUE (int )e_g == 1 [L209] 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] [L216] 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] [L197] 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] [L199] c2_st = 2 [L200] 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] [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND TRUE \read(tmp___2) [L372] 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] [L231] 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] [L234] 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] [L249] c_t = data [L250] c_req_up = 1 [L251] 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] [L242] 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] [L244] wb_st = 2 [L245] 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] [L381] 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] [L298] 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] [L300] 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] [L303] 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] [L306] 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] [L309] 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] [L312] 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] [L551] 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] [L552] 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] [L553] COND TRUE c != c_t [L554] c = c_t [L555] 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] [L559] 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] [L563] 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] [L564] 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] [L569] 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] [L574] 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] [L579] COND TRUE (int )e_c == 0 [L580] 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] [L584] 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] [L589] 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] [L597] 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] [L598] 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] [L607] 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] [L608] 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] [L616] 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] [L617] 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] [L625] 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] [L626] 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] [L634] COND TRUE (int )e_c == 1 [L635] 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] [L639] 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] [L644] 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] [L649] 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] [L654] COND TRUE (int )e_c == 1 [L655] 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] [L659] 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] [L664] 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] [L667] 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] [L670] 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] [L673] 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] [L676] 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] [L545] 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] [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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] [L298] 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] [L300] 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] [L303] 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] [L306] 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] [L309] 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] [L312] 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] [L321] 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] [L336] 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] [L351] 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] [L366] 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] [L381] COND TRUE (int )r_st == 0 [L383] tmp___3 = __VERIFIER_nondet_int() [L385] COND TRUE \read(tmp___3) [L387] r_st = 1 [L263] d = c [L264] 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] [L265] 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] [L273] 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] [L274] COND TRUE (int )e_e == 1 [L275] 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] [L283] e_e = 2 [L284] 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] [L298] 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] [L300] 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] [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND TRUE \read(tmp) [L327] 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] [L114] COND TRUE d == t + 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] [L122] 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", "toy1.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, 131 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.1s, OverallIterations: 34, TraceHistogramMax: 6, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7076 SDtfs, 10115 SDslu, 8985 SDs, 0 SdLazy, 1146 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5348occurred 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: 7.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 6719 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3005 NumberOfCodeBlocks, 3005 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2785 ConstructedInterpolants, 0 QuantifiedInterpolants, 702999 SizeOfPredicates, 6 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 34 InterpolantComputations, 32 PerfectInterpolantSequences, 807/918 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...