./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fe89a4d2a95a491ef7d92e5c5358d7d6e257149 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 12:10:34,398 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:10:34,399 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:10:34,406 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:10:34,406 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:10:34,407 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:10:34,408 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:10:34,409 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:10:34,410 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:10:34,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:10:34,410 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:10:34,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:10:34,411 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:10:34,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:10:34,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:10:34,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:10:34,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:10:34,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:10:34,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:10:34,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:10:34,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:10:34,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:10:34,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:10:34,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:10:34,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:10:34,418 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:10:34,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:10:34,419 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:10:34,419 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:10:34,420 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:10:34,420 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:10:34,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:10:34,420 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:10:34,421 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:10:34,421 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:10:34,421 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:10:34,421 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 12:10:34,428 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:10:34,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:10:34,429 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:10:34,429 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:10:34,429 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 12:10:34,429 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 12:10:34,429 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 12:10:34,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:10:34,430 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:10:34,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:10:34,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:10:34,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:10:34,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:10:34,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:10:34,431 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:10:34,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:10:34,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:10:34,431 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 12:10:34,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:10:34,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:10:34,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:10:34,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:10:34,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:10:34,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:10:34,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:10:34,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:10:34,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:10:34,433 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 12:10:34,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:10:34,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:10:34,433 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/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(__VERIFIER_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 -> 9fe89a4d2a95a491ef7d92e5c5358d7d6e257149 [2018-12-02 12:10:34,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:10:34,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:10:34,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:10:34,465 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:10:34,466 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:10:34,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe030_rmo.opt_false-unreach-call.i [2018-12-02 12:10:34,499 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer/data/37d9e14f8/a5e12a03a54f44fca2ef1e20dbd0f227/FLAGd8c10d485 [2018-12-02 12:10:34,943 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:10:34,943 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/sv-benchmarks/c/pthread-wmm/safe030_rmo.opt_false-unreach-call.i [2018-12-02 12:10:34,950 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer/data/37d9e14f8/a5e12a03a54f44fca2ef1e20dbd0f227/FLAGd8c10d485 [2018-12-02 12:10:34,958 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer/data/37d9e14f8/a5e12a03a54f44fca2ef1e20dbd0f227 [2018-12-02 12:10:34,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:10:34,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:10:34,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:10:34,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:10:34,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:10:34,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:10:34" (1/1) ... [2018-12-02 12:10:34,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:34, skipping insertion in model container [2018-12-02 12:10:34,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:10:34" (1/1) ... [2018-12-02 12:10:34,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:10:34,991 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:10:35,219 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:10:35,230 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:10:35,327 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:10:35,359 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:10:35,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35 WrapperNode [2018-12-02 12:10:35,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:10:35,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:10:35,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:10:35,360 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:10:35,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35" (1/1) ... [2018-12-02 12:10:35,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35" (1/1) ... [2018-12-02 12:10:35,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:10:35,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:10:35,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:10:35,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:10:35,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35" (1/1) ... [2018-12-02 12:10:35,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35" (1/1) ... [2018-12-02 12:10:35,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35" (1/1) ... [2018-12-02 12:10:35,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35" (1/1) ... [2018-12-02 12:10:35,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35" (1/1) ... [2018-12-02 12:10:35,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35" (1/1) ... [2018-12-02 12:10:35,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35" (1/1) ... [2018-12-02 12:10:35,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:10:35,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:10:35,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:10:35,418 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:10:35,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/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 [2018-12-02 12:10:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:10:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 12:10:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 12:10:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:10:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 12:10:35,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 12:10:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 12:10:35,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 12:10:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 12:10:35,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 12:10:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 12:10:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:10:35,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:10:35,452 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 12:10:35,754 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:10:35,754 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 12:10:35,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:10:35 BoogieIcfgContainer [2018-12-02 12:10:35,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:10:35,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:10:35,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:10:35,757 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:10:35,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:10:34" (1/3) ... [2018-12-02 12:10:35,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782dc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:10:35, skipping insertion in model container [2018-12-02 12:10:35,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:10:35" (2/3) ... [2018-12-02 12:10:35,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1782dc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:10:35, skipping insertion in model container [2018-12-02 12:10:35,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:10:35" (3/3) ... [2018-12-02 12:10:35,759 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt_false-unreach-call.i [2018-12-02 12:10:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,781 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,781 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,782 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,782 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,782 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,783 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,784 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,785 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,785 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,785 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,785 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,785 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,785 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,785 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,785 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,785 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,786 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,786 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,786 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,787 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,788 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:10:35,793 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 12:10:35,793 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:10:35,798 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 12:10:35,808 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 12:10:35,823 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 12:10:35,823 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:10:35,823 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 12:10:35,823 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:10:35,823 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:10:35,823 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:10:35,823 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:10:35,824 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:10:35,824 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:10:35,831 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154places, 191 transitions [2018-12-02 12:10:51,824 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128911 states. [2018-12-02 12:10:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 128911 states. [2018-12-02 12:10:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 12:10:51,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:10:51,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:10:51,835 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:10:51,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:10:51,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1836791117, now seen corresponding path program 1 times [2018-12-02 12:10:51,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:10:51,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:10:51,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:10:51,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:10:51,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:10:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:10:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:10:51,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:10:51,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:10:51,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:10:51,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:10:51,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:10:51,995 INFO L87 Difference]: Start difference. First operand 128911 states. Second operand 4 states. [2018-12-02 12:10:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:10:53,365 INFO L93 Difference]: Finished difference Result 233471 states and 1098323 transitions. [2018-12-02 12:10:53,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:10:53,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-02 12:10:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:10:54,137 INFO L225 Difference]: With dead ends: 233471 [2018-12-02 12:10:54,137 INFO L226 Difference]: Without dead ends: 203721 [2018-12-02 12:10:54,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:10:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203721 states. [2018-12-02 12:10:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203721 to 118891. [2018-12-02 12:10:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-02 12:10:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559774 transitions. [2018-12-02 12:10:59,360 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559774 transitions. Word has length 42 [2018-12-02 12:10:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:10:59,361 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559774 transitions. [2018-12-02 12:10:59,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:10:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559774 transitions. [2018-12-02 12:10:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 12:10:59,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:10:59,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:10:59,369 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:10:59,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:10:59,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1696589112, now seen corresponding path program 1 times [2018-12-02 12:10:59,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:10:59,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:10:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:10:59,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:10:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:10:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:10:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:10:59,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:10:59,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:10:59,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:10:59,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:10:59,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:10:59,412 INFO L87 Difference]: Start difference. First operand 118891 states and 559774 transitions. Second operand 3 states. [2018-12-02 12:11:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:00,429 INFO L93 Difference]: Finished difference Result 118891 states and 559659 transitions. [2018-12-02 12:11:00,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:11:00,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 12:11:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:00,768 INFO L225 Difference]: With dead ends: 118891 [2018-12-02 12:11:00,768 INFO L226 Difference]: Without dead ends: 118891 [2018-12-02 12:11:00,769 INFO L631 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 [2018-12-02 12:11:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118891 states. [2018-12-02 12:11:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118891 to 118891. [2018-12-02 12:11:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-02 12:11:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559659 transitions. [2018-12-02 12:11:03,379 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559659 transitions. Word has length 49 [2018-12-02 12:11:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:03,379 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559659 transitions. [2018-12-02 12:11:03,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:11:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559659 transitions. [2018-12-02 12:11:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 12:11:03,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:03,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:03,384 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:11:03,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:03,384 INFO L82 PathProgramCache]: Analyzing trace with hash 46221223, now seen corresponding path program 1 times [2018-12-02 12:11:03,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:11:03,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:11:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:03,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:03,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:03,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:03,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:11:03,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:11:03,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:11:03,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:11:03,435 INFO L87 Difference]: Start difference. First operand 118891 states and 559659 transitions. Second operand 5 states. [2018-12-02 12:11:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:07,147 INFO L93 Difference]: Finished difference Result 325271 states and 1470363 transitions. [2018-12-02 12:11:07,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:11:07,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-02 12:11:07,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:08,020 INFO L225 Difference]: With dead ends: 325271 [2018-12-02 12:11:08,021 INFO L226 Difference]: Without dead ends: 324271 [2018-12-02 12:11:08,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:11:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324271 states. [2018-12-02 12:11:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324271 to 186421. [2018-12-02 12:11:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186421 states. [2018-12-02 12:11:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186421 states to 186421 states and 842758 transitions. [2018-12-02 12:11:13,141 INFO L78 Accepts]: Start accepts. Automaton has 186421 states and 842758 transitions. Word has length 49 [2018-12-02 12:11:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:13,141 INFO L480 AbstractCegarLoop]: Abstraction has 186421 states and 842758 transitions. [2018-12-02 12:11:13,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:11:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 186421 states and 842758 transitions. [2018-12-02 12:11:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 12:11:13,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:13,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:13,146 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:11:13,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:13,146 INFO L82 PathProgramCache]: Analyzing trace with hash 764594298, now seen corresponding path program 1 times [2018-12-02 12:11:13,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:11:13,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:11:13,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:13,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:13,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:13,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:13,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:11:13,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:11:13,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:11:13,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:11:13,179 INFO L87 Difference]: Start difference. First operand 186421 states and 842758 transitions. Second operand 4 states. [2018-12-02 12:11:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:13,918 INFO L93 Difference]: Finished difference Result 163597 states and 726959 transitions. [2018-12-02 12:11:13,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:11:13,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-02 12:11:13,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:14,318 INFO L225 Difference]: With dead ends: 163597 [2018-12-02 12:11:14,318 INFO L226 Difference]: Without dead ends: 160992 [2018-12-02 12:11:14,319 INFO L631 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 [2018-12-02 12:11:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160992 states. [2018-12-02 12:11:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160992 to 160992. [2018-12-02 12:11:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160992 states. [2018-12-02 12:11:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160992 states to 160992 states and 718277 transitions. [2018-12-02 12:11:20,526 INFO L78 Accepts]: Start accepts. Automaton has 160992 states and 718277 transitions. Word has length 50 [2018-12-02 12:11:20,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:20,526 INFO L480 AbstractCegarLoop]: Abstraction has 160992 states and 718277 transitions. [2018-12-02 12:11:20,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:11:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 160992 states and 718277 transitions. [2018-12-02 12:11:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 12:11:20,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:20,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:20,531 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:11:20,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:20,532 INFO L82 PathProgramCache]: Analyzing trace with hash 315183364, now seen corresponding path program 1 times [2018-12-02 12:11:20,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:11:20,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:11:20,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:20,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:20,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:20,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:20,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:11:20,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:11:20,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:11:20,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:11:20,568 INFO L87 Difference]: Start difference. First operand 160992 states and 718277 transitions. Second operand 5 states. [2018-12-02 12:11:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:22,049 INFO L93 Difference]: Finished difference Result 289848 states and 1287330 transitions. [2018-12-02 12:11:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:11:22,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-02 12:11:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:23,144 INFO L225 Difference]: With dead ends: 289848 [2018-12-02 12:11:23,144 INFO L226 Difference]: Without dead ends: 289008 [2018-12-02 12:11:23,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:11:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289008 states. [2018-12-02 12:11:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289008 to 169612. [2018-12-02 12:11:26,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169612 states. [2018-12-02 12:11:27,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169612 states to 169612 states and 753930 transitions. [2018-12-02 12:11:27,401 INFO L78 Accepts]: Start accepts. Automaton has 169612 states and 753930 transitions. Word has length 51 [2018-12-02 12:11:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:27,402 INFO L480 AbstractCegarLoop]: Abstraction has 169612 states and 753930 transitions. [2018-12-02 12:11:27,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:11:27,402 INFO L276 IsEmpty]: Start isEmpty. Operand 169612 states and 753930 transitions. [2018-12-02 12:11:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 12:11:27,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:27,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:27,424 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:11:27,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:27,424 INFO L82 PathProgramCache]: Analyzing trace with hash 336759908, now seen corresponding path program 1 times [2018-12-02 12:11:27,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:11:27,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:11:27,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:27,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:27,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:27,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:27,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:11:27,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:11:27,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:11:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:11:27,488 INFO L87 Difference]: Start difference. First operand 169612 states and 753930 transitions. Second operand 6 states. [2018-12-02 12:11:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:29,452 INFO L93 Difference]: Finished difference Result 292568 states and 1275883 transitions. [2018-12-02 12:11:29,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:11:29,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-02 12:11:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:30,231 INFO L225 Difference]: With dead ends: 292568 [2018-12-02 12:11:30,231 INFO L226 Difference]: Without dead ends: 291728 [2018-12-02 12:11:30,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-02 12:11:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291728 states. [2018-12-02 12:11:36,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291728 to 164644. [2018-12-02 12:11:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164644 states. [2018-12-02 12:11:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164644 states to 164644 states and 731936 transitions. [2018-12-02 12:11:36,785 INFO L78 Accepts]: Start accepts. Automaton has 164644 states and 731936 transitions. Word has length 58 [2018-12-02 12:11:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:36,785 INFO L480 AbstractCegarLoop]: Abstraction has 164644 states and 731936 transitions. [2018-12-02 12:11:36,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:11:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 164644 states and 731936 transitions. [2018-12-02 12:11:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 12:11:36,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:36,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:36,849 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:11:36,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash 655738884, now seen corresponding path program 1 times [2018-12-02 12:11:36,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:11:36,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:11:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:36,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:36,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:36,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:36,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:11:36,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:11:36,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:11:36,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:11:36,895 INFO L87 Difference]: Start difference. First operand 164644 states and 731936 transitions. Second operand 4 states. [2018-12-02 12:11:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:38,671 INFO L93 Difference]: Finished difference Result 264420 states and 1161188 transitions. [2018-12-02 12:11:38,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:11:38,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 12:11:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:39,368 INFO L225 Difference]: With dead ends: 264420 [2018-12-02 12:11:39,369 INFO L226 Difference]: Without dead ends: 263060 [2018-12-02 12:11:39,369 INFO L631 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 [2018-12-02 12:11:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263060 states. [2018-12-02 12:11:43,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263060 to 220276. [2018-12-02 12:11:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220276 states. [2018-12-02 12:11:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220276 states to 220276 states and 976572 transitions. [2018-12-02 12:11:44,732 INFO L78 Accepts]: Start accepts. Automaton has 220276 states and 976572 transitions. Word has length 65 [2018-12-02 12:11:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:44,732 INFO L480 AbstractCegarLoop]: Abstraction has 220276 states and 976572 transitions. [2018-12-02 12:11:44,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:11:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 220276 states and 976572 transitions. [2018-12-02 12:11:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 12:11:44,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:44,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:44,819 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:11:44,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2009048581, now seen corresponding path program 1 times [2018-12-02 12:11:44,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:11:44,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:11:44,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:44,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:44,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:44,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:44,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:11:44,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:11:44,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:11:44,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:11:44,867 INFO L87 Difference]: Start difference. First operand 220276 states and 976572 transitions. Second operand 5 states. [2018-12-02 12:11:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:45,189 INFO L93 Difference]: Finished difference Result 78044 states and 314282 transitions. [2018-12-02 12:11:45,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:11:45,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 12:11:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:45,346 INFO L225 Difference]: With dead ends: 78044 [2018-12-02 12:11:45,346 INFO L226 Difference]: Without dead ends: 75732 [2018-12-02 12:11:45,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:11:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75732 states. [2018-12-02 12:11:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75732 to 75732. [2018-12-02 12:11:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75732 states. [2018-12-02 12:11:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75732 states to 75732 states and 305620 transitions. [2018-12-02 12:11:46,478 INFO L78 Accepts]: Start accepts. Automaton has 75732 states and 305620 transitions. Word has length 65 [2018-12-02 12:11:46,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:46,478 INFO L480 AbstractCegarLoop]: Abstraction has 75732 states and 305620 transitions. [2018-12-02 12:11:46,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:11:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 75732 states and 305620 transitions. [2018-12-02 12:11:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 12:11:46,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:46,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:46,530 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:11:46,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:46,530 INFO L82 PathProgramCache]: Analyzing trace with hash 493391520, now seen corresponding path program 1 times [2018-12-02 12:11:46,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:11:46,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:11:46,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:46,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:46,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:46,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:46,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:11:46,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:11:46,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:11:46,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:11:46,574 INFO L87 Difference]: Start difference. First operand 75732 states and 305620 transitions. Second operand 4 states. [2018-12-02 12:11:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:48,087 INFO L93 Difference]: Finished difference Result 105528 states and 420009 transitions. [2018-12-02 12:11:48,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:11:48,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 12:11:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:48,324 INFO L225 Difference]: With dead ends: 105528 [2018-12-02 12:11:48,324 INFO L226 Difference]: Without dead ends: 105528 [2018-12-02 12:11:48,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:11:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105528 states. [2018-12-02 12:11:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105528 to 81080. [2018-12-02 12:11:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81080 states. [2018-12-02 12:11:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81080 states to 81080 states and 325641 transitions. [2018-12-02 12:11:49,889 INFO L78 Accepts]: Start accepts. Automaton has 81080 states and 325641 transitions. Word has length 78 [2018-12-02 12:11:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:49,889 INFO L480 AbstractCegarLoop]: Abstraction has 81080 states and 325641 transitions. [2018-12-02 12:11:49,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:11:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 81080 states and 325641 transitions. [2018-12-02 12:11:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 12:11:49,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:49,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:49,948 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:11:49,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:49,948 INFO L82 PathProgramCache]: Analyzing trace with hash -191355072, now seen corresponding path program 1 times [2018-12-02 12:11:49,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:11:49,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:11:49,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:49,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:49,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:49,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:49,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:11:49,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:11:49,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:11:49,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:11:49,989 INFO L87 Difference]: Start difference. First operand 81080 states and 325641 transitions. Second operand 4 states. [2018-12-02 12:11:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:50,775 INFO L93 Difference]: Finished difference Result 113667 states and 450915 transitions. [2018-12-02 12:11:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:11:50,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 12:11:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:51,013 INFO L225 Difference]: With dead ends: 113667 [2018-12-02 12:11:51,013 INFO L226 Difference]: Without dead ends: 113667 [2018-12-02 12:11:51,013 INFO L631 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 [2018-12-02 12:11:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113667 states. [2018-12-02 12:11:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113667 to 102372. [2018-12-02 12:11:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102372 states. [2018-12-02 12:11:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102372 states to 102372 states and 408718 transitions. [2018-12-02 12:11:52,863 INFO L78 Accepts]: Start accepts. Automaton has 102372 states and 408718 transitions. Word has length 78 [2018-12-02 12:11:52,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:52,863 INFO L480 AbstractCegarLoop]: Abstraction has 102372 states and 408718 transitions. [2018-12-02 12:11:52,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:11:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 102372 states and 408718 transitions. [2018-12-02 12:11:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 12:11:52,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:52,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:52,938 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:11:52,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash 159444865, now seen corresponding path program 1 times [2018-12-02 12:11:52,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:11:52,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:11:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:52,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:53,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:53,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:11:53,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:11:53,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:11:53,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:11:53,028 INFO L87 Difference]: Start difference. First operand 102372 states and 408718 transitions. Second operand 8 states. [2018-12-02 12:11:54,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:54,280 INFO L93 Difference]: Finished difference Result 155234 states and 603182 transitions. [2018-12-02 12:11:54,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 12:11:54,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-02 12:11:54,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:54,600 INFO L225 Difference]: With dead ends: 155234 [2018-12-02 12:11:54,601 INFO L226 Difference]: Without dead ends: 154210 [2018-12-02 12:11:54,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 12:11:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154210 states. [2018-12-02 12:11:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154210 to 113269. [2018-12-02 12:11:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113269 states. [2018-12-02 12:11:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113269 states to 113269 states and 449340 transitions. [2018-12-02 12:11:57,148 INFO L78 Accepts]: Start accepts. Automaton has 113269 states and 449340 transitions. Word has length 78 [2018-12-02 12:11:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:11:57,149 INFO L480 AbstractCegarLoop]: Abstraction has 113269 states and 449340 transitions. [2018-12-02 12:11:57,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:11:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 113269 states and 449340 transitions. [2018-12-02 12:11:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 12:11:57,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:11:57,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:11:57,237 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:11:57,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:11:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash -133958142, now seen corresponding path program 1 times [2018-12-02 12:11:57,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:11:57,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:11:57,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:57,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:11:57,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:11:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:11:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:11:57,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:11:57,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:11:57,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:11:57,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:11:57,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:11:57,314 INFO L87 Difference]: Start difference. First operand 113269 states and 449340 transitions. Second operand 6 states. [2018-12-02 12:11:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:11:58,017 INFO L93 Difference]: Finished difference Result 124463 states and 488873 transitions. [2018-12-02 12:11:58,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:11:58,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-02 12:11:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:11:58,286 INFO L225 Difference]: With dead ends: 124463 [2018-12-02 12:11:58,287 INFO L226 Difference]: Without dead ends: 124463 [2018-12-02 12:11:58,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:11:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124463 states. [2018-12-02 12:12:00,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124463 to 116556. [2018-12-02 12:12:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116556 states. [2018-12-02 12:12:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116556 states to 116556 states and 460918 transitions. [2018-12-02 12:12:00,429 INFO L78 Accepts]: Start accepts. Automaton has 116556 states and 460918 transitions. Word has length 78 [2018-12-02 12:12:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:00,429 INFO L480 AbstractCegarLoop]: Abstraction has 116556 states and 460918 transitions. [2018-12-02 12:12:00,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:12:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 116556 states and 460918 transitions. [2018-12-02 12:12:00,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 12:12:00,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:00,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:00,522 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:00,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:00,522 INFO L82 PathProgramCache]: Analyzing trace with hash 827655875, now seen corresponding path program 1 times [2018-12-02 12:12:00,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:00,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:00,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:00,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:00,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:00,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:00,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:12:00,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:12:00,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:12:00,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:12:00,585 INFO L87 Difference]: Start difference. First operand 116556 states and 460918 transitions. Second operand 7 states. [2018-12-02 12:12:01,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:01,542 INFO L93 Difference]: Finished difference Result 141948 states and 558974 transitions. [2018-12-02 12:12:01,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 12:12:01,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2018-12-02 12:12:01,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:01,846 INFO L225 Difference]: With dead ends: 141948 [2018-12-02 12:12:01,846 INFO L226 Difference]: Without dead ends: 141628 [2018-12-02 12:12:01,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-02 12:12:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141628 states. [2018-12-02 12:12:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141628 to 125100. [2018-12-02 12:12:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125100 states. [2018-12-02 12:12:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125100 states to 125100 states and 493478 transitions. [2018-12-02 12:12:05,280 INFO L78 Accepts]: Start accepts. Automaton has 125100 states and 493478 transitions. Word has length 78 [2018-12-02 12:12:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:05,280 INFO L480 AbstractCegarLoop]: Abstraction has 125100 states and 493478 transitions. [2018-12-02 12:12:05,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:12:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand 125100 states and 493478 transitions. [2018-12-02 12:12:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 12:12:05,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:05,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:05,388 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:05,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1971879058, now seen corresponding path program 1 times [2018-12-02 12:12:05,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:05,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:05,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:05,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:05,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:05,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:05,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:12:05,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:12:05,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:12:05,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:12:05,413 INFO L87 Difference]: Start difference. First operand 125100 states and 493478 transitions. Second operand 3 states. [2018-12-02 12:12:06,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:06,001 INFO L93 Difference]: Finished difference Result 144460 states and 564710 transitions. [2018-12-02 12:12:06,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:12:06,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-02 12:12:06,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:06,313 INFO L225 Difference]: With dead ends: 144460 [2018-12-02 12:12:06,314 INFO L226 Difference]: Without dead ends: 144460 [2018-12-02 12:12:06,314 INFO L631 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 [2018-12-02 12:12:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144460 states. [2018-12-02 12:12:08,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144460 to 131356. [2018-12-02 12:12:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131356 states. [2018-12-02 12:12:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131356 states to 131356 states and 515998 transitions. [2018-12-02 12:12:08,611 INFO L78 Accepts]: Start accepts. Automaton has 131356 states and 515998 transitions. Word has length 80 [2018-12-02 12:12:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:08,611 INFO L480 AbstractCegarLoop]: Abstraction has 131356 states and 515998 transitions. [2018-12-02 12:12:08,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:12:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 131356 states and 515998 transitions. [2018-12-02 12:12:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 12:12:08,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:08,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:08,739 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:08,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1138385650, now seen corresponding path program 1 times [2018-12-02 12:12:08,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:08,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:08,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:08,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:08,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:08,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:12:08,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:12:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:12:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:12:08,810 INFO L87 Difference]: Start difference. First operand 131356 states and 515998 transitions. Second operand 8 states. [2018-12-02 12:12:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:10,402 INFO L93 Difference]: Finished difference Result 149612 states and 583830 transitions. [2018-12-02 12:12:10,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 12:12:10,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-02 12:12:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:10,717 INFO L225 Difference]: With dead ends: 149612 [2018-12-02 12:12:10,717 INFO L226 Difference]: Without dead ends: 149292 [2018-12-02 12:12:10,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-02 12:12:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149292 states. [2018-12-02 12:12:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149292 to 134300. [2018-12-02 12:12:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134300 states. [2018-12-02 12:12:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134300 states to 134300 states and 528142 transitions. [2018-12-02 12:12:13,282 INFO L78 Accepts]: Start accepts. Automaton has 134300 states and 528142 transitions. Word has length 84 [2018-12-02 12:12:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:13,282 INFO L480 AbstractCegarLoop]: Abstraction has 134300 states and 528142 transitions. [2018-12-02 12:12:13,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:12:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 134300 states and 528142 transitions. [2018-12-02 12:12:13,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 12:12:13,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:13,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:13,416 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:13,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:13,417 INFO L82 PathProgramCache]: Analyzing trace with hash -827137735, now seen corresponding path program 1 times [2018-12-02 12:12:13,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:13,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:13,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:13,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:13,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:13,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:13,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:12:13,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:12:13,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:12:13,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:12:13,447 INFO L87 Difference]: Start difference. First operand 134300 states and 528142 transitions. Second operand 4 states. [2018-12-02 12:12:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:14,200 INFO L93 Difference]: Finished difference Result 159012 states and 618564 transitions. [2018-12-02 12:12:14,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:12:14,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-02 12:12:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:14,542 INFO L225 Difference]: With dead ends: 159012 [2018-12-02 12:12:14,542 INFO L226 Difference]: Without dead ends: 158052 [2018-12-02 12:12:14,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:12:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158052 states. [2018-12-02 12:12:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158052 to 151252. [2018-12-02 12:12:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151252 states. [2018-12-02 12:12:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151252 states to 151252 states and 590508 transitions. [2018-12-02 12:12:17,164 INFO L78 Accepts]: Start accepts. Automaton has 151252 states and 590508 transitions. Word has length 86 [2018-12-02 12:12:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:17,164 INFO L480 AbstractCegarLoop]: Abstraction has 151252 states and 590508 transitions. [2018-12-02 12:12:17,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:12:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 151252 states and 590508 transitions. [2018-12-02 12:12:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 12:12:17,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:17,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:17,341 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:17,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1532169274, now seen corresponding path program 1 times [2018-12-02 12:12:17,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:17,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:17,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:17,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:17,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:17,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:17,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:12:17,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:12:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:12:17,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:12:17,372 INFO L87 Difference]: Start difference. First operand 151252 states and 590508 transitions. Second operand 3 states. [2018-12-02 12:12:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:18,111 INFO L93 Difference]: Finished difference Result 159356 states and 620840 transitions. [2018-12-02 12:12:18,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:12:18,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-02 12:12:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:18,462 INFO L225 Difference]: With dead ends: 159356 [2018-12-02 12:12:18,462 INFO L226 Difference]: Without dead ends: 159356 [2018-12-02 12:12:18,462 INFO L631 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 [2018-12-02 12:12:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159356 states. [2018-12-02 12:12:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159356 to 155280. [2018-12-02 12:12:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155280 states. [2018-12-02 12:12:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155280 states to 155280 states and 605540 transitions. [2018-12-02 12:12:21,151 INFO L78 Accepts]: Start accepts. Automaton has 155280 states and 605540 transitions. Word has length 86 [2018-12-02 12:12:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:21,151 INFO L480 AbstractCegarLoop]: Abstraction has 155280 states and 605540 transitions. [2018-12-02 12:12:21,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:12:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 155280 states and 605540 transitions. [2018-12-02 12:12:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 12:12:21,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:21,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:21,337 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:21,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:21,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1381420627, now seen corresponding path program 1 times [2018-12-02 12:12:21,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:21,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:21,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:21,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:21,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:21,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:21,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:12:21,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:12:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:12:21,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:12:21,399 INFO L87 Difference]: Start difference. First operand 155280 states and 605540 transitions. Second operand 6 states. [2018-12-02 12:12:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:22,618 INFO L93 Difference]: Finished difference Result 163731 states and 634865 transitions. [2018-12-02 12:12:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:12:22,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-02 12:12:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:22,946 INFO L225 Difference]: With dead ends: 163731 [2018-12-02 12:12:22,947 INFO L226 Difference]: Without dead ends: 163731 [2018-12-02 12:12:22,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:12:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163731 states. [2018-12-02 12:12:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163731 to 154129. [2018-12-02 12:12:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154129 states. [2018-12-02 12:12:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154129 states to 154129 states and 601338 transitions. [2018-12-02 12:12:27,729 INFO L78 Accepts]: Start accepts. Automaton has 154129 states and 601338 transitions. Word has length 87 [2018-12-02 12:12:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:27,729 INFO L480 AbstractCegarLoop]: Abstraction has 154129 states and 601338 transitions. [2018-12-02 12:12:27,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:12:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 154129 states and 601338 transitions. [2018-12-02 12:12:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 12:12:27,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:27,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:27,903 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:27,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash 977886382, now seen corresponding path program 1 times [2018-12-02 12:12:27,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:27,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:27,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:27,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:27,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:12:27,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:12:27,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:12:27,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:12:27,955 INFO L87 Difference]: Start difference. First operand 154129 states and 601338 transitions. Second operand 7 states. [2018-12-02 12:12:28,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:28,876 INFO L93 Difference]: Finished difference Result 161961 states and 627602 transitions. [2018-12-02 12:12:28,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:12:28,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-12-02 12:12:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:29,231 INFO L225 Difference]: With dead ends: 161961 [2018-12-02 12:12:29,231 INFO L226 Difference]: Without dead ends: 161961 [2018-12-02 12:12:29,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:12:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161961 states. [2018-12-02 12:12:31,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161961 to 149344. [2018-12-02 12:12:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149344 states. [2018-12-02 12:12:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149344 states to 149344 states and 581991 transitions. [2018-12-02 12:12:31,707 INFO L78 Accepts]: Start accepts. Automaton has 149344 states and 581991 transitions. Word has length 87 [2018-12-02 12:12:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:31,707 INFO L480 AbstractCegarLoop]: Abstraction has 149344 states and 581991 transitions. [2018-12-02 12:12:31,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:12:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 149344 states and 581991 transitions. [2018-12-02 12:12:31,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 12:12:31,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:31,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:31,884 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:31,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:31,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1307652143, now seen corresponding path program 1 times [2018-12-02 12:12:31,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:31,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:31,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:31,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:31,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:31,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:31,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:12:31,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:12:31,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:12:31,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:12:31,925 INFO L87 Difference]: Start difference. First operand 149344 states and 581991 transitions. Second operand 6 states. [2018-12-02 12:12:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:32,021 INFO L93 Difference]: Finished difference Result 24944 states and 82271 transitions. [2018-12-02 12:12:32,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:12:32,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-12-02 12:12:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:32,048 INFO L225 Difference]: With dead ends: 24944 [2018-12-02 12:12:32,049 INFO L226 Difference]: Without dead ends: 20548 [2018-12-02 12:12:32,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:12:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20548 states. [2018-12-02 12:12:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20548 to 19468. [2018-12-02 12:12:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19468 states. [2018-12-02 12:12:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19468 states to 19468 states and 64369 transitions. [2018-12-02 12:12:32,261 INFO L78 Accepts]: Start accepts. Automaton has 19468 states and 64369 transitions. Word has length 87 [2018-12-02 12:12:32,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:32,261 INFO L480 AbstractCegarLoop]: Abstraction has 19468 states and 64369 transitions. [2018-12-02 12:12:32,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:12:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 19468 states and 64369 transitions. [2018-12-02 12:12:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 12:12:32,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:32,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:32,277 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:32,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:32,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1057118527, now seen corresponding path program 1 times [2018-12-02 12:12:32,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:32,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:32,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:32,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:32,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:32,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:32,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:12:32,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:12:32,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:12:32,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:12:32,325 INFO L87 Difference]: Start difference. First operand 19468 states and 64369 transitions. Second operand 6 states. [2018-12-02 12:12:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:32,480 INFO L93 Difference]: Finished difference Result 22458 states and 72381 transitions. [2018-12-02 12:12:32,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:12:32,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-02 12:12:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:32,505 INFO L225 Difference]: With dead ends: 22458 [2018-12-02 12:12:32,505 INFO L226 Difference]: Without dead ends: 22458 [2018-12-02 12:12:32,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:12:32,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22458 states. [2018-12-02 12:12:32,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22458 to 20353. [2018-12-02 12:12:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20353 states. [2018-12-02 12:12:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20353 states to 20353 states and 66492 transitions. [2018-12-02 12:12:32,723 INFO L78 Accepts]: Start accepts. Automaton has 20353 states and 66492 transitions. Word has length 97 [2018-12-02 12:12:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:32,724 INFO L480 AbstractCegarLoop]: Abstraction has 20353 states and 66492 transitions. [2018-12-02 12:12:32,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:12:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 20353 states and 66492 transitions. [2018-12-02 12:12:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 12:12:32,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:32,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:32,740 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:32,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash 32424606, now seen corresponding path program 1 times [2018-12-02 12:12:32,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:32,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:32,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:32,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:32,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:32,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:32,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:12:32,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:12:32,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:12:32,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:12:32,786 INFO L87 Difference]: Start difference. First operand 20353 states and 66492 transitions. Second operand 5 states. [2018-12-02 12:12:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:32,953 INFO L93 Difference]: Finished difference Result 24276 states and 78291 transitions. [2018-12-02 12:12:32,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:12:32,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-02 12:12:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:32,981 INFO L225 Difference]: With dead ends: 24276 [2018-12-02 12:12:32,981 INFO L226 Difference]: Without dead ends: 23991 [2018-12-02 12:12:32,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:12:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23991 states. [2018-12-02 12:12:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23991 to 20833. [2018-12-02 12:12:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2018-12-02 12:12:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 67896 transitions. [2018-12-02 12:12:33,325 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 67896 transitions. Word has length 97 [2018-12-02 12:12:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:33,325 INFO L480 AbstractCegarLoop]: Abstraction has 20833 states and 67896 transitions. [2018-12-02 12:12:33,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:12:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 67896 transitions. [2018-12-02 12:12:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:12:33,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:33,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:33,342 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:33,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1707260212, now seen corresponding path program 1 times [2018-12-02 12:12:33,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:33,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:33,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:33,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:33,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:33,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:33,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 12:12:33,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:12:33,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:12:33,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:12:33,408 INFO L87 Difference]: Start difference. First operand 20833 states and 67896 transitions. Second operand 9 states. [2018-12-02 12:12:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:33,920 INFO L93 Difference]: Finished difference Result 37316 states and 119621 transitions. [2018-12-02 12:12:33,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 12:12:33,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-02 12:12:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:33,964 INFO L225 Difference]: With dead ends: 37316 [2018-12-02 12:12:33,964 INFO L226 Difference]: Without dead ends: 37188 [2018-12-02 12:12:33,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-12-02 12:12:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37188 states. [2018-12-02 12:12:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37188 to 23941. [2018-12-02 12:12:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23941 states. [2018-12-02 12:12:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23941 states to 23941 states and 77975 transitions. [2018-12-02 12:12:34,282 INFO L78 Accepts]: Start accepts. Automaton has 23941 states and 77975 transitions. Word has length 99 [2018-12-02 12:12:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:34,282 INFO L480 AbstractCegarLoop]: Abstraction has 23941 states and 77975 transitions. [2018-12-02 12:12:34,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:12:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23941 states and 77975 transitions. [2018-12-02 12:12:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:12:34,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:34,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:34,302 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:34,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash -462495731, now seen corresponding path program 1 times [2018-12-02 12:12:34,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:34,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:34,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:34,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:34,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:34,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:34,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:12:34,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:12:34,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:12:34,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:12:34,370 INFO L87 Difference]: Start difference. First operand 23941 states and 77975 transitions. Second operand 7 states. [2018-12-02 12:12:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:34,742 INFO L93 Difference]: Finished difference Result 36707 states and 119676 transitions. [2018-12-02 12:12:34,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:12:34,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 12:12:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:34,788 INFO L225 Difference]: With dead ends: 36707 [2018-12-02 12:12:34,788 INFO L226 Difference]: Without dead ends: 36332 [2018-12-02 12:12:34,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:12:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36332 states. [2018-12-02 12:12:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36332 to 23996. [2018-12-02 12:12:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23996 states. [2018-12-02 12:12:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23996 states to 23996 states and 77959 transitions. [2018-12-02 12:12:35,122 INFO L78 Accepts]: Start accepts. Automaton has 23996 states and 77959 transitions. Word has length 99 [2018-12-02 12:12:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:35,122 INFO L480 AbstractCegarLoop]: Abstraction has 23996 states and 77959 transitions. [2018-12-02 12:12:35,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:12:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 23996 states and 77959 transitions. [2018-12-02 12:12:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:12:35,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:35,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:35,145 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:35,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1632816658, now seen corresponding path program 1 times [2018-12-02 12:12:35,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:35,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:35,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:35,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:35,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:12:35,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:12:35,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:12:35,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:12:35,208 INFO L87 Difference]: Start difference. First operand 23996 states and 77959 transitions. Second operand 6 states. [2018-12-02 12:12:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:35,336 INFO L93 Difference]: Finished difference Result 19682 states and 64219 transitions. [2018-12-02 12:12:35,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:12:35,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 12:12:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:35,358 INFO L225 Difference]: With dead ends: 19682 [2018-12-02 12:12:35,358 INFO L226 Difference]: Without dead ends: 19682 [2018-12-02 12:12:35,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:12:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19682 states. [2018-12-02 12:12:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19682 to 18282. [2018-12-02 12:12:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18282 states. [2018-12-02 12:12:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18282 states to 18282 states and 60069 transitions. [2018-12-02 12:12:35,553 INFO L78 Accepts]: Start accepts. Automaton has 18282 states and 60069 transitions. Word has length 99 [2018-12-02 12:12:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:35,554 INFO L480 AbstractCegarLoop]: Abstraction has 18282 states and 60069 transitions. [2018-12-02 12:12:35,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:12:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 18282 states and 60069 transitions. [2018-12-02 12:12:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:12:35,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:35,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:35,569 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:35,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:35,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2137804146, now seen corresponding path program 1 times [2018-12-02 12:12:35,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:35,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:35,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:35,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:35,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:35,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:35,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:12:35,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:12:35,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:12:35,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:12:35,614 INFO L87 Difference]: Start difference. First operand 18282 states and 60069 transitions. Second operand 6 states. [2018-12-02 12:12:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:35,864 INFO L93 Difference]: Finished difference Result 19557 states and 63614 transitions. [2018-12-02 12:12:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:12:35,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 12:12:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:35,885 INFO L225 Difference]: With dead ends: 19557 [2018-12-02 12:12:35,885 INFO L226 Difference]: Without dead ends: 19342 [2018-12-02 12:12:35,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:12:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19342 states. [2018-12-02 12:12:36,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19342 to 18907. [2018-12-02 12:12:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18907 states. [2018-12-02 12:12:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18907 states to 18907 states and 61834 transitions. [2018-12-02 12:12:36,079 INFO L78 Accepts]: Start accepts. Automaton has 18907 states and 61834 transitions. Word has length 99 [2018-12-02 12:12:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:36,079 INFO L480 AbstractCegarLoop]: Abstraction has 18907 states and 61834 transitions. [2018-12-02 12:12:36,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:12:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 18907 states and 61834 transitions. [2018-12-02 12:12:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:12:36,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:36,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:36,095 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:36,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash -456422671, now seen corresponding path program 1 times [2018-12-02 12:12:36,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:36,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:36,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:36,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:36,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:36,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:36,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:12:36,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:12:36,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:12:36,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:12:36,149 INFO L87 Difference]: Start difference. First operand 18907 states and 61834 transitions. Second operand 7 states. [2018-12-02 12:12:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:36,379 INFO L93 Difference]: Finished difference Result 20446 states and 66563 transitions. [2018-12-02 12:12:36,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:12:36,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 12:12:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:36,400 INFO L225 Difference]: With dead ends: 20446 [2018-12-02 12:12:36,400 INFO L226 Difference]: Without dead ends: 20446 [2018-12-02 12:12:36,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:12:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20446 states. [2018-12-02 12:12:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20446 to 18817. [2018-12-02 12:12:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18817 states. [2018-12-02 12:12:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18817 states to 18817 states and 61582 transitions. [2018-12-02 12:12:36,593 INFO L78 Accepts]: Start accepts. Automaton has 18817 states and 61582 transitions. Word has length 99 [2018-12-02 12:12:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:36,593 INFO L480 AbstractCegarLoop]: Abstraction has 18817 states and 61582 transitions. [2018-12-02 12:12:36,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:12:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 18817 states and 61582 transitions. [2018-12-02 12:12:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:12:36,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:36,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:36,608 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:36,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:36,608 INFO L82 PathProgramCache]: Analyzing trace with hash 954456849, now seen corresponding path program 1 times [2018-12-02 12:12:36,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:36,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:36,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:36,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:12:36,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:12:36,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:12:36,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:12:36,676 INFO L87 Difference]: Start difference. First operand 18817 states and 61582 transitions. Second operand 8 states. [2018-12-02 12:12:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:36,959 INFO L93 Difference]: Finished difference Result 24020 states and 77950 transitions. [2018-12-02 12:12:36,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:12:36,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-02 12:12:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:36,987 INFO L225 Difference]: With dead ends: 24020 [2018-12-02 12:12:36,987 INFO L226 Difference]: Without dead ends: 23892 [2018-12-02 12:12:36,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-02 12:12:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23892 states. [2018-12-02 12:12:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23892 to 19146. [2018-12-02 12:12:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19146 states. [2018-12-02 12:12:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19146 states to 19146 states and 62381 transitions. [2018-12-02 12:12:37,218 INFO L78 Accepts]: Start accepts. Automaton has 19146 states and 62381 transitions. Word has length 99 [2018-12-02 12:12:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:37,218 INFO L480 AbstractCegarLoop]: Abstraction has 19146 states and 62381 transitions. [2018-12-02 12:12:37,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:12:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 19146 states and 62381 transitions. [2018-12-02 12:12:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:12:37,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:37,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:37,234 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:37,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1916070866, now seen corresponding path program 1 times [2018-12-02 12:12:37,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:37,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:37,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:37,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:37,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:37,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:37,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:12:37,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:12:37,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:12:37,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:12:37,280 INFO L87 Difference]: Start difference. First operand 19146 states and 62381 transitions. Second operand 7 states. [2018-12-02 12:12:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:37,513 INFO L93 Difference]: Finished difference Result 24507 states and 79326 transitions. [2018-12-02 12:12:37,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:12:37,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 12:12:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:37,540 INFO L225 Difference]: With dead ends: 24507 [2018-12-02 12:12:37,540 INFO L226 Difference]: Without dead ends: 24507 [2018-12-02 12:12:37,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:12:37,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24507 states. [2018-12-02 12:12:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24507 to 20553. [2018-12-02 12:12:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20553 states. [2018-12-02 12:12:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20553 states to 20553 states and 67014 transitions. [2018-12-02 12:12:37,771 INFO L78 Accepts]: Start accepts. Automaton has 20553 states and 67014 transitions. Word has length 99 [2018-12-02 12:12:37,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:37,771 INFO L480 AbstractCegarLoop]: Abstraction has 20553 states and 67014 transitions. [2018-12-02 12:12:37,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:12:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 20553 states and 67014 transitions. [2018-12-02 12:12:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:12:37,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:37,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:37,788 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:37,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:37,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1134131949, now seen corresponding path program 1 times [2018-12-02 12:12:37,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:37,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:37,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:37,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:37,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:37,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:37,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:12:37,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:12:37,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:12:37,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:12:37,858 INFO L87 Difference]: Start difference. First operand 20553 states and 67014 transitions. Second operand 8 states. [2018-12-02 12:12:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:38,138 INFO L93 Difference]: Finished difference Result 34736 states and 115396 transitions. [2018-12-02 12:12:38,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:12:38,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-02 12:12:38,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:38,182 INFO L225 Difference]: With dead ends: 34736 [2018-12-02 12:12:38,182 INFO L226 Difference]: Without dead ends: 34736 [2018-12-02 12:12:38,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-02 12:12:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34736 states. [2018-12-02 12:12:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34736 to 20433. [2018-12-02 12:12:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20433 states. [2018-12-02 12:12:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20433 states to 20433 states and 66578 transitions. [2018-12-02 12:12:38,475 INFO L78 Accepts]: Start accepts. Automaton has 20433 states and 66578 transitions. Word has length 99 [2018-12-02 12:12:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:38,475 INFO L480 AbstractCegarLoop]: Abstraction has 20433 states and 66578 transitions. [2018-12-02 12:12:38,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:12:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 20433 states and 66578 transitions. [2018-12-02 12:12:38,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 12:12:38,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:38,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:38,492 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:38,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash -653415533, now seen corresponding path program 1 times [2018-12-02 12:12:38,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:38,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:38,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:38,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:38,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:38,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:38,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:12:38,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:12:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:12:38,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:12:38,559 INFO L87 Difference]: Start difference. First operand 20433 states and 66578 transitions. Second operand 6 states. [2018-12-02 12:12:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:38,678 INFO L93 Difference]: Finished difference Result 18705 states and 59874 transitions. [2018-12-02 12:12:38,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:12:38,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 12:12:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:38,698 INFO L225 Difference]: With dead ends: 18705 [2018-12-02 12:12:38,698 INFO L226 Difference]: Without dead ends: 18705 [2018-12-02 12:12:38,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:12:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18705 states. [2018-12-02 12:12:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18705 to 14628. [2018-12-02 12:12:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14628 states. [2018-12-02 12:12:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14628 states to 14628 states and 47601 transitions. [2018-12-02 12:12:38,869 INFO L78 Accepts]: Start accepts. Automaton has 14628 states and 47601 transitions. Word has length 99 [2018-12-02 12:12:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:38,869 INFO L480 AbstractCegarLoop]: Abstraction has 14628 states and 47601 transitions. [2018-12-02 12:12:38,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:12:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 14628 states and 47601 transitions. [2018-12-02 12:12:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 12:12:38,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:38,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:38,881 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:38,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1543607272, now seen corresponding path program 1 times [2018-12-02 12:12:38,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:38,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:38,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:38,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:38,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:38,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:38,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:12:38,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:12:38,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:12:38,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:12:38,918 INFO L87 Difference]: Start difference. First operand 14628 states and 47601 transitions. Second operand 5 states. [2018-12-02 12:12:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:39,068 INFO L93 Difference]: Finished difference Result 16420 states and 53361 transitions. [2018-12-02 12:12:39,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:12:39,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-02 12:12:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:39,087 INFO L225 Difference]: With dead ends: 16420 [2018-12-02 12:12:39,087 INFO L226 Difference]: Without dead ends: 16292 [2018-12-02 12:12:39,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:12:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16292 states. [2018-12-02 12:12:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16292 to 13852. [2018-12-02 12:12:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13852 states. [2018-12-02 12:12:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13852 states to 13852 states and 45106 transitions. [2018-12-02 12:12:39,287 INFO L78 Accepts]: Start accepts. Automaton has 13852 states and 45106 transitions. Word has length 101 [2018-12-02 12:12:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:39,287 INFO L480 AbstractCegarLoop]: Abstraction has 13852 states and 45106 transitions. [2018-12-02 12:12:39,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:12:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 13852 states and 45106 transitions. [2018-12-02 12:12:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 12:12:39,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:39,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:39,298 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:39,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1506595543, now seen corresponding path program 1 times [2018-12-02 12:12:39,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:39,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:39,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:39,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:39,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:12:39,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:12:39,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:12:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:12:39,349 INFO L87 Difference]: Start difference. First operand 13852 states and 45106 transitions. Second operand 7 states. [2018-12-02 12:12:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:39,551 INFO L93 Difference]: Finished difference Result 26156 states and 85648 transitions. [2018-12-02 12:12:39,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:12:39,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-02 12:12:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:39,567 INFO L225 Difference]: With dead ends: 26156 [2018-12-02 12:12:39,567 INFO L226 Difference]: Without dead ends: 13352 [2018-12-02 12:12:39,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:12:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13352 states. [2018-12-02 12:12:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13352 to 13152. [2018-12-02 12:12:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13152 states. [2018-12-02 12:12:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13152 states to 13152 states and 43042 transitions. [2018-12-02 12:12:39,707 INFO L78 Accepts]: Start accepts. Automaton has 13152 states and 43042 transitions. Word has length 101 [2018-12-02 12:12:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:39,707 INFO L480 AbstractCegarLoop]: Abstraction has 13152 states and 43042 transitions. [2018-12-02 12:12:39,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:12:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 13152 states and 43042 transitions. [2018-12-02 12:12:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 12:12:39,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:39,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:39,719 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:39,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:39,719 INFO L82 PathProgramCache]: Analyzing trace with hash -321724473, now seen corresponding path program 2 times [2018-12-02 12:12:39,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:39,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:39,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:39,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:12:39,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:39,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:39,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:12:39,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:12:39,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:12:39,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:12:39,771 INFO L87 Difference]: Start difference. First operand 13152 states and 43042 transitions. Second operand 7 states. [2018-12-02 12:12:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:39,979 INFO L93 Difference]: Finished difference Result 21308 states and 70353 transitions. [2018-12-02 12:12:39,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:12:39,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-02 12:12:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:39,989 INFO L225 Difference]: With dead ends: 21308 [2018-12-02 12:12:39,989 INFO L226 Difference]: Without dead ends: 8256 [2018-12-02 12:12:39,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:12:40,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8256 states. [2018-12-02 12:12:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8256 to 8256. [2018-12-02 12:12:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8256 states. [2018-12-02 12:12:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8256 states to 8256 states and 27562 transitions. [2018-12-02 12:12:40,070 INFO L78 Accepts]: Start accepts. Automaton has 8256 states and 27562 transitions. Word has length 101 [2018-12-02 12:12:40,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:40,070 INFO L480 AbstractCegarLoop]: Abstraction has 8256 states and 27562 transitions. [2018-12-02 12:12:40,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:12:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 8256 states and 27562 transitions. [2018-12-02 12:12:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 12:12:40,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:40,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:40,077 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:40,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:40,077 INFO L82 PathProgramCache]: Analyzing trace with hash 773161459, now seen corresponding path program 3 times [2018-12-02 12:12:40,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:40,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:40,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:40,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:12:40,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:12:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:12:40,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:12:40,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 12:12:40,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:12:40,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:12:40,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:12:40,162 INFO L87 Difference]: Start difference. First operand 8256 states and 27562 transitions. Second operand 12 states. [2018-12-02 12:12:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:12:40,546 INFO L93 Difference]: Finished difference Result 15724 states and 52835 transitions. [2018-12-02 12:12:40,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 12:12:40,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-12-02 12:12:40,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:12:40,558 INFO L225 Difference]: With dead ends: 15724 [2018-12-02 12:12:40,558 INFO L226 Difference]: Without dead ends: 11180 [2018-12-02 12:12:40,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 12:12:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11180 states. [2018-12-02 12:12:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11180 to 10500. [2018-12-02 12:12:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10500 states. [2018-12-02 12:12:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 34453 transitions. [2018-12-02 12:12:40,664 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 34453 transitions. Word has length 101 [2018-12-02 12:12:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:12:40,664 INFO L480 AbstractCegarLoop]: Abstraction has 10500 states and 34453 transitions. [2018-12-02 12:12:40,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:12:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 34453 transitions. [2018-12-02 12:12:40,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 12:12:40,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:12:40,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:12:40,673 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:12:40,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:12:40,673 INFO L82 PathProgramCache]: Analyzing trace with hash -350606857, now seen corresponding path program 4 times [2018-12-02 12:12:40,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:12:40,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:12:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:40,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:12:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:12:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:12:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:12:40,722 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:12:40,798 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 12:12:40,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:12:40 BasicIcfg [2018-12-02 12:12:40,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:12:40,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:12:40,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:12:40,800 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:12:40,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:10:35" (3/4) ... [2018-12-02 12:12:40,802 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 12:12:40,870 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1b51e775-d3dd-4d8a-ad5d-febe851b1add/bin-2019/uautomizer/witness.graphml [2018-12-02 12:12:40,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:12:40,871 INFO L168 Benchmark]: Toolchain (without parser) took 125910.77 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.2 GB). Free memory was 950.6 MB in the beginning and 4.2 GB in the end (delta: -3.3 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2018-12-02 12:12:40,872 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:12:40,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:12:40,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:12:40,873 INFO L168 Benchmark]: Boogie Preprocessor took 21.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:12:40,873 INFO L168 Benchmark]: RCFGBuilder took 337.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:12:40,873 INFO L168 Benchmark]: TraceAbstraction took 125044.25 ms. Allocated memory was 1.2 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-02 12:12:40,873 INFO L168 Benchmark]: Witness Printer took 71.06 ms. Allocated memory is still 7.2 GB. Free memory was 4.3 GB in the beginning and 4.2 GB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. [2018-12-02 12:12:40,874 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 398.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 337.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 125044.25 ms. Allocated memory was 1.2 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 71.06 ms. Allocated memory is still 7.2 GB. Free memory was 4.3 GB in the beginning and 4.2 GB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L674] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L676] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L679] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L680] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L681] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L682] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L683] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L684] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L689] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L690] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L691] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L692] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L693] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L694] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L697] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L698] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] -1 pthread_t t2506; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] FCALL, FORK -1 pthread_create(&t2506, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t2507; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t2507, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t2508; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t2508, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 y$w_buff1 = y$w_buff0 [L738] 0 y$w_buff0 = 2 [L739] 0 y$w_buff1_used = y$w_buff0_used [L740] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L743] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L744] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L745] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L746] 0 y$r_buff0_thd3 = (_Bool)1 [L749] 0 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L702] 1 z = 2 [L705] 1 x = 1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L717] 2 x = 2 [L720] 2 y = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L753] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L759] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=2] [L723] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L724] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L724] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L725] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L726] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L727] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L730] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L786] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L787] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L788] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L793] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L794] -1 y$flush_delayed = weak$$choice2 [L795] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L798] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L802] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] -1 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y = y$flush_delayed ? y$mem_tmp : y [L805] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 197 locations, 3 error locations. UNSAFE Result, 124.9s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 36.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9571 SDtfs, 10136 SDslu, 24138 SDs, 0 SdLazy, 9914 SolverSat, 569 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 112 SyntacticMatches, 25 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220276occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 68.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 740044 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3006 NumberOfCodeBlocks, 3006 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2870 ConstructedInterpolants, 0 QuantifiedInterpolants, 642861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...