./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_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_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47e0e2e2f593a1c2b5c24aa2d193465263bbddc3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 06:05:24,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:05:24,242 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:05:24,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:05:24,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:05:24,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:05:24,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:05:24,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:05:24,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:05:24,251 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:05:24,252 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:05:24,252 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:05:24,252 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:05:24,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:05:24,253 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:05:24,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:05:24,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:05:24,255 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:05:24,256 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:05:24,257 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:05:24,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:05:24,258 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:05:24,259 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:05:24,259 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:05:24,259 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:05:24,260 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:05:24,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:05:24,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:05:24,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:05:24,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:05:24,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:05:24,262 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:05:24,262 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:05:24,262 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:05:24,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:05:24,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:05:24,263 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 06:05:24,271 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:05:24,271 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:05:24,271 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 06:05:24,271 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 06:05:24,271 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 06:05:24,271 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 06:05:24,272 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 06:05:24,272 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 06:05:24,272 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 06:05:24,272 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 06:05:24,272 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 06:05:24,272 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 06:05:24,272 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 06:05:24,272 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:05:24,273 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:05:24,273 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:05:24,273 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:05:24,273 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:05:24,273 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 06:05:24,273 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 06:05:24,273 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 06:05:24,273 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:05:24,273 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:05:24,273 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 06:05:24,273 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:05:24,273 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:05:24,274 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 06:05:24,274 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 06:05:24,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 06:05:24,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:05:24,274 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 06:05:24,274 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 06:05:24,274 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 06:05:24,274 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 06:05:24,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 06:05:24,274 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 06:05:24,274 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan 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 -> Taipan 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 -> 47e0e2e2f593a1c2b5c24aa2d193465263bbddc3 [2018-12-02 06:05:24,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:05:24,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:05:24,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:05:24,301 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:05:24,301 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:05:24,302 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_false-unreach-call.i [2018-12-02 06:05:24,334 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/data/4a3d8d8ea/3b0034a3dde84b8c8299d469b2d98030/FLAG98e4d0bb5 [2018-12-02 06:05:24,710 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:05:24,710 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/sv-benchmarks/c/pthread-wmm/rfi001_rmo.oepc_false-unreach-call.i [2018-12-02 06:05:24,718 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/data/4a3d8d8ea/3b0034a3dde84b8c8299d469b2d98030/FLAG98e4d0bb5 [2018-12-02 06:05:25,094 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/data/4a3d8d8ea/3b0034a3dde84b8c8299d469b2d98030 [2018-12-02 06:05:25,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:05:25,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:05:25,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:05:25,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:05:25,112 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:05:25,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:05:25" (1/1) ... [2018-12-02 06:05:25,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c01debc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25, skipping insertion in model container [2018-12-02 06:05:25,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:05:25" (1/1) ... [2018-12-02 06:05:25,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:05:25,148 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:05:25,320 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:05:25,327 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:05:25,407 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:05:25,445 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:05:25,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25 WrapperNode [2018-12-02 06:05:25,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:05:25,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:05:25,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:05:25,446 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:05:25,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25" (1/1) ... [2018-12-02 06:05:25,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25" (1/1) ... [2018-12-02 06:05:25,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:05:25,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:05:25,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:05:25,475 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:05:25,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25" (1/1) ... [2018-12-02 06:05:25,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25" (1/1) ... [2018-12-02 06:05:25,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25" (1/1) ... [2018-12-02 06:05:25,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25" (1/1) ... [2018-12-02 06:05:25,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25" (1/1) ... [2018-12-02 06:05:25,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25" (1/1) ... [2018-12-02 06:05:25,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25" (1/1) ... [2018-12-02 06:05:25,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:05:25,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:05:25,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:05:25,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:05:25,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/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 06:05:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:05:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 06:05:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 06:05:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 06:05:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 06:05:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 06:05:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 06:05:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 06:05:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 06:05:25,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:05:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:05:25,529 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 06:05:25,824 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:05:25,824 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 06:05:25,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:05:25 BoogieIcfgContainer [2018-12-02 06:05:25,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:05:25,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 06:05:25,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 06:05:25,827 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 06:05:25,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:05:25" (1/3) ... [2018-12-02 06:05:25,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0c3883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:05:25, skipping insertion in model container [2018-12-02 06:05:25,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:05:25" (2/3) ... [2018-12-02 06:05:25,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0c3883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:05:25, skipping insertion in model container [2018-12-02 06:05:25,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:05:25" (3/3) ... [2018-12-02 06:05:25,829 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.oepc_false-unreach-call.i [2018-12-02 06:05:25,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,852 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,852 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,852 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,853 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,853 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,856 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,864 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:05:25,874 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 06:05:25,874 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 06:05:25,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 06:05:25,889 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 06:05:25,904 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 06:05:25,904 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 06:05:25,904 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 06:05:25,904 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:05:25,904 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:05:25,904 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 06:05:25,904 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:05:25,904 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 06:05:25,911 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 06:05:27,575 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-02 06:05:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-02 06:05:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 06:05:27,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:27,582 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] [2018-12-02 06:05:27,584 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:27,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash 314479455, now seen corresponding path program 1 times [2018-12-02 06:05:27,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:27,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:27,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:27,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:27,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:27,723 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 06:05:27,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:27,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:05:27,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:27,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:05:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:05:27,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:05:27,738 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-02 06:05:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:28,190 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-02 06:05:28,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:05:28,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-02 06:05:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:28,340 INFO L225 Difference]: With dead ends: 60791 [2018-12-02 06:05:28,340 INFO L226 Difference]: Without dead ends: 44271 [2018-12-02 06:05:28,341 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 06:05:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-02 06:05:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-02 06:05:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-02 06:05:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-02 06:05:29,101 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-02 06:05:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:29,101 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-02 06:05:29,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:05:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-02 06:05:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 06:05:29,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:29,106 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] [2018-12-02 06:05:29,106 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:29,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash -494436635, now seen corresponding path program 1 times [2018-12-02 06:05:29,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:29,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:29,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:29,147 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 06:05:29,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:29,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:05:29,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:29,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:05:29,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:05:29,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:05:29,149 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 3 states. [2018-12-02 06:05:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:29,325 INFO L93 Difference]: Finished difference Result 27339 states and 105223 transitions. [2018-12-02 06:05:29,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:05:29,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-02 06:05:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:29,380 INFO L225 Difference]: With dead ends: 27339 [2018-12-02 06:05:29,381 INFO L226 Difference]: Without dead ends: 27339 [2018-12-02 06:05:29,381 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 06:05:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2018-12-02 06:05:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 27339. [2018-12-02 06:05:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-02 06:05:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105223 transitions. [2018-12-02 06:05:29,901 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105223 transitions. Word has length 46 [2018-12-02 06:05:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:29,902 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105223 transitions. [2018-12-02 06:05:29,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:05:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105223 transitions. [2018-12-02 06:05:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 06:05:29,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:29,904 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] [2018-12-02 06:05:29,905 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:29,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:29,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1248373700, now seen corresponding path program 1 times [2018-12-02 06:05:29,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:29,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:29,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:29,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 06:05:29,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:29,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:05:29,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:29,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:05:29,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:05:29,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:05:29,955 INFO L87 Difference]: Start difference. First operand 27339 states and 105223 transitions. Second operand 5 states. [2018-12-02 06:05:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:30,460 INFO L93 Difference]: Finished difference Result 64005 states and 235022 transitions. [2018-12-02 06:05:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:05:30,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 06:05:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:30,578 INFO L225 Difference]: With dead ends: 64005 [2018-12-02 06:05:30,578 INFO L226 Difference]: Without dead ends: 63453 [2018-12-02 06:05:30,578 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 06:05:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-02 06:05:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-02 06:05:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-02 06:05:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152053 transitions. [2018-12-02 06:05:31,521 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152053 transitions. Word has length 46 [2018-12-02 06:05:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:31,522 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152053 transitions. [2018-12-02 06:05:31,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:05:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152053 transitions. [2018-12-02 06:05:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 06:05:31,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:31,526 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] [2018-12-02 06:05:31,526 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:31,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:31,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1026875031, now seen corresponding path program 1 times [2018-12-02 06:05:31,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:31,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:31,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:31,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:31,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:31,583 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 06:05:31,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:31,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:05:31,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:31,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:05:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:05:31,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:05:31,584 INFO L87 Difference]: Start difference. First operand 41421 states and 152053 transitions. Second operand 5 states. [2018-12-02 06:05:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:32,013 INFO L93 Difference]: Finished difference Result 81367 states and 297636 transitions. [2018-12-02 06:05:32,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:05:32,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 06:05:32,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:32,156 INFO L225 Difference]: With dead ends: 81367 [2018-12-02 06:05:32,156 INFO L226 Difference]: Without dead ends: 80855 [2018-12-02 06:05:32,157 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 06:05:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-02 06:05:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-02 06:05:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-02 06:05:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 165678 transitions. [2018-12-02 06:05:33,122 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 165678 transitions. Word has length 47 [2018-12-02 06:05:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:33,122 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 165678 transitions. [2018-12-02 06:05:33,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:05:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 165678 transitions. [2018-12-02 06:05:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 06:05:33,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:33,127 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 06:05:33,128 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:33,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:33,128 INFO L82 PathProgramCache]: Analyzing trace with hash -43389411, now seen corresponding path program 1 times [2018-12-02 06:05:33,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:33,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:33,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:33,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:33,147 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 06:05:33,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:33,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:05:33,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:33,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:05:33,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:05:33,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:05:33,148 INFO L87 Difference]: Start difference. First operand 45375 states and 165678 transitions. Second operand 3 states. [2018-12-02 06:05:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:33,362 INFO L93 Difference]: Finished difference Result 65251 states and 235338 transitions. [2018-12-02 06:05:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:05:33,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 06:05:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:33,476 INFO L225 Difference]: With dead ends: 65251 [2018-12-02 06:05:33,476 INFO L226 Difference]: Without dead ends: 65251 [2018-12-02 06:05:33,476 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 06:05:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-02 06:05:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-02 06:05:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-02 06:05:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 183963 transitions. [2018-12-02 06:05:34,451 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 183963 transitions. Word has length 49 [2018-12-02 06:05:34,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:34,451 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 183963 transitions. [2018-12-02 06:05:34,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:05:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 183963 transitions. [2018-12-02 06:05:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:05:34,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:34,460 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] [2018-12-02 06:05:34,460 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:34,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash -860096332, now seen corresponding path program 1 times [2018-12-02 06:05:34,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:34,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:34,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:34,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:34,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:34,523 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 06:05:34,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:34,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:05:34,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:34,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:05:34,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:05:34,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:05:34,524 INFO L87 Difference]: Start difference. First operand 50945 states and 183963 transitions. Second operand 6 states. [2018-12-02 06:05:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:35,033 INFO L93 Difference]: Finished difference Result 67511 states and 241920 transitions. [2018-12-02 06:05:35,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:05:35,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 06:05:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:35,149 INFO L225 Difference]: With dead ends: 67511 [2018-12-02 06:05:35,150 INFO L226 Difference]: Without dead ends: 67511 [2018-12-02 06:05:35,150 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 06:05:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-02 06:05:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-02 06:05:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-02 06:05:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227319 transitions. [2018-12-02 06:05:36,207 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227319 transitions. Word has length 53 [2018-12-02 06:05:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:36,208 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227319 transitions. [2018-12-02 06:05:36,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:05:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227319 transitions. [2018-12-02 06:05:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:05:36,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:36,217 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] [2018-12-02 06:05:36,217 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:36,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:36,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1637919605, now seen corresponding path program 1 times [2018-12-02 06:05:36,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:36,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:36,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:36,282 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 06:05:36,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:36,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:05:36,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:36,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:05:36,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:05:36,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:05:36,283 INFO L87 Difference]: Start difference. First operand 63436 states and 227319 transitions. Second operand 7 states. [2018-12-02 06:05:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:37,021 INFO L93 Difference]: Finished difference Result 88528 states and 305936 transitions. [2018-12-02 06:05:37,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:05:37,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-02 06:05:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:37,167 INFO L225 Difference]: With dead ends: 88528 [2018-12-02 06:05:37,167 INFO L226 Difference]: Without dead ends: 88528 [2018-12-02 06:05:37,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 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 06:05:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-02 06:05:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-02 06:05:38,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-02 06:05:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262722 transitions. [2018-12-02 06:05:38,379 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262722 transitions. Word has length 53 [2018-12-02 06:05:38,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:38,380 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262722 transitions. [2018-12-02 06:05:38,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:05:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262722 transitions. [2018-12-02 06:05:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:05:38,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:38,389 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] [2018-12-02 06:05:38,389 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:38,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:38,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1769544010, now seen corresponding path program 1 times [2018-12-02 06:05:38,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:38,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:38,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:38,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:38,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:38,428 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 06:05:38,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:38,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:05:38,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:38,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:05:38,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:05:38,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:05:38,429 INFO L87 Difference]: Start difference. First operand 74881 states and 262722 transitions. Second operand 4 states. [2018-12-02 06:05:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:38,485 INFO L93 Difference]: Finished difference Result 15375 states and 48802 transitions. [2018-12-02 06:05:38,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:05:38,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-02 06:05:38,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:38,503 INFO L225 Difference]: With dead ends: 15375 [2018-12-02 06:05:38,503 INFO L226 Difference]: Without dead ends: 13789 [2018-12-02 06:05:38,503 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 06:05:38,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-02 06:05:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2018-12-02 06:05:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-02 06:05:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43328 transitions. [2018-12-02 06:05:38,734 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43328 transitions. Word has length 53 [2018-12-02 06:05:38,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:38,735 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43328 transitions. [2018-12-02 06:05:38,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:05:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43328 transitions. [2018-12-02 06:05:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:05:38,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:38,736 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] [2018-12-02 06:05:38,736 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:38,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:38,736 INFO L82 PathProgramCache]: Analyzing trace with hash -431668952, now seen corresponding path program 1 times [2018-12-02 06:05:38,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:38,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:38,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:38,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:38,779 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 06:05:38,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:38,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:05:38,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:38,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:05:38,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:05:38,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:05:38,780 INFO L87 Difference]: Start difference. First operand 13740 states and 43328 transitions. Second operand 6 states. [2018-12-02 06:05:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:39,032 INFO L93 Difference]: Finished difference Result 19970 states and 62557 transitions. [2018-12-02 06:05:39,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:05:39,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 06:05:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:39,055 INFO L225 Difference]: With dead ends: 19970 [2018-12-02 06:05:39,055 INFO L226 Difference]: Without dead ends: 19898 [2018-12-02 06:05:39,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:05:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2018-12-02 06:05:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2018-12-02 06:05:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2018-12-02 06:05:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45025 transitions. [2018-12-02 06:05:39,229 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45025 transitions. Word has length 53 [2018-12-02 06:05:39,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:39,230 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45025 transitions. [2018-12-02 06:05:39,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:05:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45025 transitions. [2018-12-02 06:05:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 06:05:39,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:39,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] [2018-12-02 06:05:39,233 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:39,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash -488484476, now seen corresponding path program 1 times [2018-12-02 06:05:39,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:39,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:39,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:39,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:39,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:39,270 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 06:05:39,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:39,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:05:39,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:39,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:05:39,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:05:39,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:05:39,271 INFO L87 Difference]: Start difference. First operand 14314 states and 45025 transitions. Second operand 4 states. [2018-12-02 06:05:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:39,355 INFO L93 Difference]: Finished difference Result 16617 states and 52353 transitions. [2018-12-02 06:05:39,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:05:39,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 06:05:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:39,374 INFO L225 Difference]: With dead ends: 16617 [2018-12-02 06:05:39,374 INFO L226 Difference]: Without dead ends: 16617 [2018-12-02 06:05:39,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 06:05:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2018-12-02 06:05:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2018-12-02 06:05:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2018-12-02 06:05:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47615 transitions. [2018-12-02 06:05:39,542 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47615 transitions. Word has length 61 [2018-12-02 06:05:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:39,542 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47615 transitions. [2018-12-02 06:05:39,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:05:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47615 transitions. [2018-12-02 06:05:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 06:05:39,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:39,545 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] [2018-12-02 06:05:39,545 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:39,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1254325859, now seen corresponding path program 1 times [2018-12-02 06:05:39,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:39,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:39,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:39,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:39,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:39,588 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 06:05:39,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:39,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:05:39,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:39,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:05:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:05:39,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:05:39,588 INFO L87 Difference]: Start difference. First operand 15134 states and 47615 transitions. Second operand 6 states. [2018-12-02 06:05:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:39,847 INFO L93 Difference]: Finished difference Result 28106 states and 88091 transitions. [2018-12-02 06:05:39,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:05:39,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 06:05:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:39,881 INFO L225 Difference]: With dead ends: 28106 [2018-12-02 06:05:39,881 INFO L226 Difference]: Without dead ends: 28035 [2018-12-02 06:05:39,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:05:39,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2018-12-02 06:05:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2018-12-02 06:05:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2018-12-02 06:05:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54277 transitions. [2018-12-02 06:05:40,122 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54277 transitions. Word has length 61 [2018-12-02 06:05:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:40,122 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54277 transitions. [2018-12-02 06:05:40,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:05:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54277 transitions. [2018-12-02 06:05:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 06:05:40,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:40,127 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 06:05:40,127 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:40,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:40,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1214039529, now seen corresponding path program 1 times [2018-12-02 06:05:40,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:40,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:40,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:40,152 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 06:05:40,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:40,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:05:40,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:40,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:05:40,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:05:40,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:05:40,153 INFO L87 Difference]: Start difference. First operand 17412 states and 54277 transitions. Second operand 3 states. [2018-12-02 06:05:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:40,291 INFO L93 Difference]: Finished difference Result 18092 states and 56109 transitions. [2018-12-02 06:05:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:05:40,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-02 06:05:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:40,312 INFO L225 Difference]: With dead ends: 18092 [2018-12-02 06:05:40,312 INFO L226 Difference]: Without dead ends: 18092 [2018-12-02 06:05:40,312 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 06:05:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2018-12-02 06:05:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2018-12-02 06:05:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2018-12-02 06:05:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55193 transitions. [2018-12-02 06:05:40,493 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55193 transitions. Word has length 65 [2018-12-02 06:05:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:40,494 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55193 transitions. [2018-12-02 06:05:40,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:05:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55193 transitions. [2018-12-02 06:05:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 06:05:40,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:40,498 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 06:05:40,498 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:40,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash 863169814, now seen corresponding path program 1 times [2018-12-02 06:05:40,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:40,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:40,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:40,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:40,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:40,538 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 06:05:40,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:40,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:05:40,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:40,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:05:40,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:05:40,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:05:40,539 INFO L87 Difference]: Start difference. First operand 17752 states and 55193 transitions. Second operand 4 states. [2018-12-02 06:05:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:40,699 INFO L93 Difference]: Finished difference Result 21696 states and 66682 transitions. [2018-12-02 06:05:40,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:05:40,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 06:05:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:40,723 INFO L225 Difference]: With dead ends: 21696 [2018-12-02 06:05:40,723 INFO L226 Difference]: Without dead ends: 21696 [2018-12-02 06:05:40,723 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 06:05:40,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2018-12-02 06:05:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2018-12-02 06:05:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-02 06:05:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60572 transitions. [2018-12-02 06:05:40,933 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60572 transitions. Word has length 65 [2018-12-02 06:05:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:40,933 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60572 transitions. [2018-12-02 06:05:40,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:05:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60572 transitions. [2018-12-02 06:05:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:05:40,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:40,940 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] [2018-12-02 06:05:40,940 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:40,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:40,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1085072735, now seen corresponding path program 1 times [2018-12-02 06:05:40,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:40,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:40,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:40,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:40,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:40,996 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 06:05:40,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:40,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:05:40,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:40,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:05:40,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:05:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:05:40,997 INFO L87 Difference]: Start difference. First operand 19646 states and 60572 transitions. Second operand 6 states. [2018-12-02 06:05:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:41,570 INFO L93 Difference]: Finished difference Result 23814 states and 72270 transitions. [2018-12-02 06:05:41,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:05:41,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 06:05:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:41,597 INFO L225 Difference]: With dead ends: 23814 [2018-12-02 06:05:41,597 INFO L226 Difference]: Without dead ends: 23814 [2018-12-02 06:05:41,598 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 06:05:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-12-02 06:05:41,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2018-12-02 06:05:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2018-12-02 06:05:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68700 transitions. [2018-12-02 06:05:41,845 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68700 transitions. Word has length 67 [2018-12-02 06:05:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:41,845 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68700 transitions. [2018-12-02 06:05:41,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:05:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68700 transitions. [2018-12-02 06:05:41,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:05:41,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:41,852 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] [2018-12-02 06:05:41,852 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:41,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash -992136608, now seen corresponding path program 1 times [2018-12-02 06:05:41,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:41,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:41,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:41,903 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 06:05:41,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:41,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:05:41,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:41,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:05:41,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:05:41,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:05:41,904 INFO L87 Difference]: Start difference. First operand 22474 states and 68700 transitions. Second operand 6 states. [2018-12-02 06:05:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:42,192 INFO L93 Difference]: Finished difference Result 25702 states and 76160 transitions. [2018-12-02 06:05:42,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:05:42,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 06:05:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:42,221 INFO L225 Difference]: With dead ends: 25702 [2018-12-02 06:05:42,221 INFO L226 Difference]: Without dead ends: 25702 [2018-12-02 06:05:42,221 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 06:05:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2018-12-02 06:05:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2018-12-02 06:05:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2018-12-02 06:05:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68806 transitions. [2018-12-02 06:05:42,468 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68806 transitions. Word has length 67 [2018-12-02 06:05:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:42,468 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68806 transitions. [2018-12-02 06:05:42,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:05:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68806 transitions. [2018-12-02 06:05:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:05:42,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:42,476 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] [2018-12-02 06:05:42,476 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:42,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash -780785695, now seen corresponding path program 1 times [2018-12-02 06:05:42,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:42,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:42,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:42,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:42,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:42,517 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 06:05:42,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:42,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:05:42,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:42,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:05:42,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:05:42,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:05:42,518 INFO L87 Difference]: Start difference. First operand 22858 states and 68806 transitions. Second operand 5 states. [2018-12-02 06:05:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:42,750 INFO L93 Difference]: Finished difference Result 29793 states and 89371 transitions. [2018-12-02 06:05:42,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:05:42,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 06:05:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:42,785 INFO L225 Difference]: With dead ends: 29793 [2018-12-02 06:05:42,785 INFO L226 Difference]: Without dead ends: 29793 [2018-12-02 06:05:42,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 06:05:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2018-12-02 06:05:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2018-12-02 06:05:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2018-12-02 06:05:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80315 transitions. [2018-12-02 06:05:43,090 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80315 transitions. Word has length 67 [2018-12-02 06:05:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:43,090 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80315 transitions. [2018-12-02 06:05:43,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:05:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80315 transitions. [2018-12-02 06:05:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:05:43,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:43,099 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] [2018-12-02 06:05:43,099 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:43,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:43,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1291319872, now seen corresponding path program 1 times [2018-12-02 06:05:43,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:43,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:43,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:43,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:43,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:43,142 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 06:05:43,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:43,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:05:43,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:43,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:05:43,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:05:43,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:05:43,143 INFO L87 Difference]: Start difference. First operand 26814 states and 80315 transitions. Second operand 5 states. [2018-12-02 06:05:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:43,456 INFO L93 Difference]: Finished difference Result 36420 states and 108385 transitions. [2018-12-02 06:05:43,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:05:43,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 06:05:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:43,495 INFO L225 Difference]: With dead ends: 36420 [2018-12-02 06:05:43,495 INFO L226 Difference]: Without dead ends: 36420 [2018-12-02 06:05:43,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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 06:05:43,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2018-12-02 06:05:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2018-12-02 06:05:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2018-12-02 06:05:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87791 transitions. [2018-12-02 06:05:43,846 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87791 transitions. Word has length 67 [2018-12-02 06:05:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:43,846 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87791 transitions. [2018-12-02 06:05:43,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:05:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87791 transitions. [2018-12-02 06:05:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:05:43,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:43,854 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] [2018-12-02 06:05:43,854 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:43,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:43,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1196192961, now seen corresponding path program 1 times [2018-12-02 06:05:43,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:43,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:43,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:43,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:43,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:43,890 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 06:05:43,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:43,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:05:43,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:43,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:05:43,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:05:43,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:05:43,891 INFO L87 Difference]: Start difference. First operand 29428 states and 87791 transitions. Second operand 4 states. [2018-12-02 06:05:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:44,259 INFO L93 Difference]: Finished difference Result 38892 states and 116477 transitions. [2018-12-02 06:05:44,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:05:44,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 06:05:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:44,304 INFO L225 Difference]: With dead ends: 38892 [2018-12-02 06:05:44,304 INFO L226 Difference]: Without dead ends: 38660 [2018-12-02 06:05:44,304 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 06:05:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38660 states. [2018-12-02 06:05:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38660 to 35784. [2018-12-02 06:05:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2018-12-02 06:05:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 107258 transitions. [2018-12-02 06:05:44,712 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 107258 transitions. Word has length 67 [2018-12-02 06:05:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:44,712 INFO L480 AbstractCegarLoop]: Abstraction has 35784 states and 107258 transitions. [2018-12-02 06:05:44,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:05:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 107258 transitions. [2018-12-02 06:05:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:05:44,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:44,723 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] [2018-12-02 06:05:44,723 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:44,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:44,723 INFO L82 PathProgramCache]: Analyzing trace with hash -600758398, now seen corresponding path program 1 times [2018-12-02 06:05:44,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:44,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:44,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:44,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:44,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:44,753 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 06:05:44,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:44,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:05:44,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:44,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:05:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:05:44,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:05:44,754 INFO L87 Difference]: Start difference. First operand 35784 states and 107258 transitions. Second operand 5 states. [2018-12-02 06:05:44,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:44,797 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2018-12-02 06:05:44,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:05:44,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 06:05:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:44,803 INFO L225 Difference]: With dead ends: 9316 [2018-12-02 06:05:44,803 INFO L226 Difference]: Without dead ends: 7464 [2018-12-02 06:05:44,803 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 06:05:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2018-12-02 06:05:44,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2018-12-02 06:05:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2018-12-02 06:05:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2018-12-02 06:05:44,870 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2018-12-02 06:05:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:44,871 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2018-12-02 06:05:44,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:05:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2018-12-02 06:05:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:05:44,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:44,875 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] [2018-12-02 06:05:44,875 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:44,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:44,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1144549580, now seen corresponding path program 1 times [2018-12-02 06:05:44,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:44,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:44,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:44,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:44,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:44,898 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 06:05:44,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:44,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:05:44,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:44,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:05:44,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:05:44,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:05:44,900 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2018-12-02 06:05:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:44,937 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2018-12-02 06:05:44,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:05:44,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 06:05:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:44,944 INFO L225 Difference]: With dead ends: 8820 [2018-12-02 06:05:44,944 INFO L226 Difference]: Without dead ends: 8820 [2018-12-02 06:05:44,944 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 06:05:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2018-12-02 06:05:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2018-12-02 06:05:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2018-12-02 06:05:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2018-12-02 06:05:45,004 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2018-12-02 06:05:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:45,004 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2018-12-02 06:05:45,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:05:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2018-12-02 06:05:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 06:05:45,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:45,008 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] [2018-12-02 06:05:45,008 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:45,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1467487719, now seen corresponding path program 1 times [2018-12-02 06:05:45,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:45,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:45,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:45,045 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 06:05:45,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:45,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:05:45,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:45,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:05:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:05:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:05:45,046 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2018-12-02 06:05:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:45,144 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2018-12-02 06:05:45,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:05:45,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 06:05:45,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:45,149 INFO L225 Difference]: With dead ends: 7470 [2018-12-02 06:05:45,149 INFO L226 Difference]: Without dead ends: 7470 [2018-12-02 06:05:45,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:05:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-02 06:05:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2018-12-02 06:05:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2018-12-02 06:05:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2018-12-02 06:05:45,198 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2018-12-02 06:05:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:45,198 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2018-12-02 06:05:45,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:05:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2018-12-02 06:05:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 06:05:45,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:45,202 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] [2018-12-02 06:05:45,202 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:45,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1084669242, now seen corresponding path program 1 times [2018-12-02 06:05:45,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:45,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:45,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:45,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:45,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:45,237 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 06:05:45,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:45,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:05:45,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:45,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:05:45,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:05:45,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:05:45,237 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2018-12-02 06:05:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:45,480 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2018-12-02 06:05:45,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:05:45,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-02 06:05:45,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:45,487 INFO L225 Difference]: With dead ends: 7881 [2018-12-02 06:05:45,487 INFO L226 Difference]: Without dead ends: 7762 [2018-12-02 06:05:45,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 06:05:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2018-12-02 06:05:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2018-12-02 06:05:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-12-02 06:05:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2018-12-02 06:05:45,562 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2018-12-02 06:05:45,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:45,563 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2018-12-02 06:05:45,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:05:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2018-12-02 06:05:45,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 06:05:45,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:45,568 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] [2018-12-02 06:05:45,568 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:45,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:45,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1510650383, now seen corresponding path program 1 times [2018-12-02 06:05:45,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:45,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:45,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:45,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:45,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:45,616 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 06:05:45,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:45,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:05:45,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:45,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:05:45,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:05:45,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:05:45,617 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2018-12-02 06:05:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:45,781 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2018-12-02 06:05:45,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:05:45,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 06:05:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:45,788 INFO L225 Difference]: With dead ends: 10608 [2018-12-02 06:05:45,788 INFO L226 Difference]: Without dead ends: 10608 [2018-12-02 06:05:45,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:05:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2018-12-02 06:05:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2018-12-02 06:05:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2018-12-02 06:05:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2018-12-02 06:05:45,853 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2018-12-02 06:05:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:45,854 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2018-12-02 06:05:45,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:05:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2018-12-02 06:05:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 06:05:45,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:45,859 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] [2018-12-02 06:05:45,859 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:45,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:45,859 INFO L82 PathProgramCache]: Analyzing trace with hash 859083880, now seen corresponding path program 1 times [2018-12-02 06:05:45,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:45,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:45,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:45,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:45,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:45,895 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 06:05:45,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:45,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:05:45,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:45,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:05:45,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:05:45,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:05:45,896 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2018-12-02 06:05:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:45,966 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2018-12-02 06:05:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:05:45,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 06:05:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:45,974 INFO L225 Difference]: With dead ends: 8526 [2018-12-02 06:05:45,974 INFO L226 Difference]: Without dead ends: 8526 [2018-12-02 06:05:45,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 06:05:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-12-02 06:05:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2018-12-02 06:05:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2018-12-02 06:05:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2018-12-02 06:05:46,039 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2018-12-02 06:05:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:46,039 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2018-12-02 06:05:46,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:05:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2018-12-02 06:05:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:46,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:46,045 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] [2018-12-02 06:05:46,045 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:46,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1302041195, now seen corresponding path program 1 times [2018-12-02 06:05:46,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:46,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:46,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:46,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:46,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:46,094 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 06:05:46,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:46,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:05:46,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:46,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:05:46,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:05:46,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:05:46,095 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 5 states. [2018-12-02 06:05:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:46,168 INFO L93 Difference]: Finished difference Result 9015 states and 20390 transitions. [2018-12-02 06:05:46,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:05:46,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 06:05:46,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:46,174 INFO L225 Difference]: With dead ends: 9015 [2018-12-02 06:05:46,174 INFO L226 Difference]: Without dead ends: 9015 [2018-12-02 06:05:46,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 06:05:46,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9015 states. [2018-12-02 06:05:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9015 to 6969. [2018-12-02 06:05:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6969 states. [2018-12-02 06:05:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6969 states to 6969 states and 15888 transitions. [2018-12-02 06:05:46,231 INFO L78 Accepts]: Start accepts. Automaton has 6969 states and 15888 transitions. Word has length 94 [2018-12-02 06:05:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:46,232 INFO L480 AbstractCegarLoop]: Abstraction has 6969 states and 15888 transitions. [2018-12-02 06:05:46,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:05:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 6969 states and 15888 transitions. [2018-12-02 06:05:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:46,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:05:46,237 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:46,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:46,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1556777740, now seen corresponding path program 1 times [2018-12-02 06:05:46,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:46,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:46,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:46,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:46,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:46,274 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 06:05:46,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:46,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:05:46,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:46,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:05:46,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:05:46,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:05:46,275 INFO L87 Difference]: Start difference. First operand 6969 states and 15888 transitions. Second operand 5 states. [2018-12-02 06:05:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:46,544 INFO L93 Difference]: Finished difference Result 13317 states and 30551 transitions. [2018-12-02 06:05:46,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:05:46,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 06:05:46,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:46,552 INFO L225 Difference]: With dead ends: 13317 [2018-12-02 06:05:46,552 INFO L226 Difference]: Without dead ends: 13317 [2018-12-02 06:05:46,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:05:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13317 states. [2018-12-02 06:05:46,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13317 to 8041. [2018-12-02 06:05:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8041 states. [2018-12-02 06:05:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8041 states to 8041 states and 18325 transitions. [2018-12-02 06:05:46,630 INFO L78 Accepts]: Start accepts. Automaton has 8041 states and 18325 transitions. Word has length 94 [2018-12-02 06:05:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:46,631 INFO L480 AbstractCegarLoop]: Abstraction has 8041 states and 18325 transitions. [2018-12-02 06:05:46,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:05:46,631 INFO L276 IsEmpty]: Start isEmpty. Operand 8041 states and 18325 transitions. [2018-12-02 06:05:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:46,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:46,636 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] [2018-12-02 06:05:46,636 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:46,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:46,636 INFO L82 PathProgramCache]: Analyzing trace with hash -312013259, now seen corresponding path program 1 times [2018-12-02 06:05:46,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:46,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:46,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:46,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:46,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:46,713 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 06:05:46,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:46,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 06:05:46,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:46,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:05:46,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:05:46,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:05:46,714 INFO L87 Difference]: Start difference. First operand 8041 states and 18325 transitions. Second operand 8 states. [2018-12-02 06:05:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:46,990 INFO L93 Difference]: Finished difference Result 11629 states and 26298 transitions. [2018-12-02 06:05:46,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 06:05:46,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-02 06:05:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:46,997 INFO L225 Difference]: With dead ends: 11629 [2018-12-02 06:05:46,997 INFO L226 Difference]: Without dead ends: 11597 [2018-12-02 06:05:46,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-12-02 06:05:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11597 states. [2018-12-02 06:05:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11597 to 10054. [2018-12-02 06:05:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10054 states. [2018-12-02 06:05:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10054 states to 10054 states and 22699 transitions. [2018-12-02 06:05:47,076 INFO L78 Accepts]: Start accepts. Automaton has 10054 states and 22699 transitions. Word has length 94 [2018-12-02 06:05:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:47,076 INFO L480 AbstractCegarLoop]: Abstraction has 10054 states and 22699 transitions. [2018-12-02 06:05:47,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:05:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 10054 states and 22699 transitions. [2018-12-02 06:05:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:47,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:47,083 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] [2018-12-02 06:05:47,083 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:47,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:47,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2108964618, now seen corresponding path program 1 times [2018-12-02 06:05:47,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:47,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:47,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:47,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:47,140 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 06:05:47,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:47,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 06:05:47,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:47,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:05:47,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:05:47,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:05:47,141 INFO L87 Difference]: Start difference. First operand 10054 states and 22699 transitions. Second operand 8 states. [2018-12-02 06:05:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:47,377 INFO L93 Difference]: Finished difference Result 16042 states and 36876 transitions. [2018-12-02 06:05:47,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:05:47,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-02 06:05:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:47,388 INFO L225 Difference]: With dead ends: 16042 [2018-12-02 06:05:47,388 INFO L226 Difference]: Without dead ends: 16042 [2018-12-02 06:05:47,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 06:05:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16042 states. [2018-12-02 06:05:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16042 to 11490. [2018-12-02 06:05:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11490 states. [2018-12-02 06:05:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11490 states to 11490 states and 26152 transitions. [2018-12-02 06:05:47,494 INFO L78 Accepts]: Start accepts. Automaton has 11490 states and 26152 transitions. Word has length 94 [2018-12-02 06:05:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:47,494 INFO L480 AbstractCegarLoop]: Abstraction has 11490 states and 26152 transitions. [2018-12-02 06:05:47,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:05:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 11490 states and 26152 transitions. [2018-12-02 06:05:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:47,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:47,502 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] [2018-12-02 06:05:47,503 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:47,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:47,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1221460937, now seen corresponding path program 1 times [2018-12-02 06:05:47,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:47,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:47,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:47,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:47,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:47,553 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 06:05:47,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:47,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:05:47,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:47,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:05:47,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:05:47,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:05:47,554 INFO L87 Difference]: Start difference. First operand 11490 states and 26152 transitions. Second operand 6 states. [2018-12-02 06:05:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:47,713 INFO L93 Difference]: Finished difference Result 11285 states and 25403 transitions. [2018-12-02 06:05:47,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:05:47,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 06:05:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:47,721 INFO L225 Difference]: With dead ends: 11285 [2018-12-02 06:05:47,721 INFO L226 Difference]: Without dead ends: 11285 [2018-12-02 06:05:47,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:05:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11285 states. [2018-12-02 06:05:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11285 to 10587. [2018-12-02 06:05:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10587 states. [2018-12-02 06:05:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10587 states to 10587 states and 23935 transitions. [2018-12-02 06:05:47,802 INFO L78 Accepts]: Start accepts. Automaton has 10587 states and 23935 transitions. Word has length 94 [2018-12-02 06:05:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:47,803 INFO L480 AbstractCegarLoop]: Abstraction has 10587 states and 23935 transitions. [2018-12-02 06:05:47,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:05:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 10587 states and 23935 transitions. [2018-12-02 06:05:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:47,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:47,811 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] [2018-12-02 06:05:47,811 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:47,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:47,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1634726199, now seen corresponding path program 1 times [2018-12-02 06:05:47,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:47,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:47,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:47,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:47,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:47,886 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 06:05:47,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:47,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:05:47,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:47,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:05:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:05:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:05:47,887 INFO L87 Difference]: Start difference. First operand 10587 states and 23935 transitions. Second operand 9 states. [2018-12-02 06:05:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:48,948 INFO L93 Difference]: Finished difference Result 23262 states and 52962 transitions. [2018-12-02 06:05:48,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 06:05:48,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-02 06:05:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:48,963 INFO L225 Difference]: With dead ends: 23262 [2018-12-02 06:05:48,964 INFO L226 Difference]: Without dead ends: 23079 [2018-12-02 06:05:48,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=308, Invalid=1024, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 06:05:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23079 states. [2018-12-02 06:05:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23079 to 12395. [2018-12-02 06:05:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12395 states. [2018-12-02 06:05:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12395 states to 12395 states and 28322 transitions. [2018-12-02 06:05:49,117 INFO L78 Accepts]: Start accepts. Automaton has 12395 states and 28322 transitions. Word has length 94 [2018-12-02 06:05:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:49,117 INFO L480 AbstractCegarLoop]: Abstraction has 12395 states and 28322 transitions. [2018-12-02 06:05:49,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:05:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 12395 states and 28322 transitions. [2018-12-02 06:05:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:49,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:49,126 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] [2018-12-02 06:05:49,126 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:49,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:49,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1415476616, now seen corresponding path program 1 times [2018-12-02 06:05:49,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:49,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:49,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:49,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:49,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:49,186 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 06:05:49,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:49,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:05:49,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:49,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:05:49,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:05:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:05:49,187 INFO L87 Difference]: Start difference. First operand 12395 states and 28322 transitions. Second operand 7 states. [2018-12-02 06:05:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:49,502 INFO L93 Difference]: Finished difference Result 15035 states and 34140 transitions. [2018-12-02 06:05:49,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:05:49,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 06:05:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:49,513 INFO L225 Difference]: With dead ends: 15035 [2018-12-02 06:05:49,513 INFO L226 Difference]: Without dead ends: 14880 [2018-12-02 06:05:49,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 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 06:05:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14880 states. [2018-12-02 06:05:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14880 to 12472. [2018-12-02 06:05:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12472 states. [2018-12-02 06:05:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12472 states to 12472 states and 28476 transitions. [2018-12-02 06:05:49,620 INFO L78 Accepts]: Start accepts. Automaton has 12472 states and 28476 transitions. Word has length 94 [2018-12-02 06:05:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:49,620 INFO L480 AbstractCegarLoop]: Abstraction has 12472 states and 28476 transitions. [2018-12-02 06:05:49,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:05:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 12472 states and 28476 transitions. [2018-12-02 06:05:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:49,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:49,630 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] [2018-12-02 06:05:49,630 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:49,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash 200730359, now seen corresponding path program 1 times [2018-12-02 06:05:49,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:49,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:49,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:49,673 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 06:05:49,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:49,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:05:49,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:49,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:05:49,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:05:49,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:05:49,674 INFO L87 Difference]: Start difference. First operand 12472 states and 28476 transitions. Second operand 5 states. [2018-12-02 06:05:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:49,854 INFO L93 Difference]: Finished difference Result 15432 states and 34838 transitions. [2018-12-02 06:05:49,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:05:49,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 06:05:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:49,864 INFO L225 Difference]: With dead ends: 15432 [2018-12-02 06:05:49,864 INFO L226 Difference]: Without dead ends: 15209 [2018-12-02 06:05:49,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:05:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15209 states. [2018-12-02 06:05:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15209 to 12998. [2018-12-02 06:05:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12998 states. [2018-12-02 06:05:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12998 states to 12998 states and 29695 transitions. [2018-12-02 06:05:49,975 INFO L78 Accepts]: Start accepts. Automaton has 12998 states and 29695 transitions. Word has length 94 [2018-12-02 06:05:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:49,975 INFO L480 AbstractCegarLoop]: Abstraction has 12998 states and 29695 transitions. [2018-12-02 06:05:49,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:05:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 12998 states and 29695 transitions. [2018-12-02 06:05:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:49,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:49,985 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] [2018-12-02 06:05:49,985 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:49,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash 25938264, now seen corresponding path program 1 times [2018-12-02 06:05:49,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:49,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:49,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:49,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:49,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:50,022 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 06:05:50,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:50,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:05:50,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:50,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:05:50,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:05:50,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:05:50,023 INFO L87 Difference]: Start difference. First operand 12998 states and 29695 transitions. Second operand 5 states. [2018-12-02 06:05:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:50,165 INFO L93 Difference]: Finished difference Result 16514 states and 37363 transitions. [2018-12-02 06:05:50,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:05:50,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 06:05:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:50,177 INFO L225 Difference]: With dead ends: 16514 [2018-12-02 06:05:50,177 INFO L226 Difference]: Without dead ends: 16364 [2018-12-02 06:05:50,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 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 06:05:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16364 states. [2018-12-02 06:05:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16364 to 12732. [2018-12-02 06:05:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12732 states. [2018-12-02 06:05:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12732 states to 12732 states and 29112 transitions. [2018-12-02 06:05:50,299 INFO L78 Accepts]: Start accepts. Automaton has 12732 states and 29112 transitions. Word has length 94 [2018-12-02 06:05:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:50,300 INFO L480 AbstractCegarLoop]: Abstraction has 12732 states and 29112 transitions. [2018-12-02 06:05:50,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:05:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 12732 states and 29112 transitions. [2018-12-02 06:05:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:50,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:50,310 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] [2018-12-02 06:05:50,310 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:50,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:50,310 INFO L82 PathProgramCache]: Analyzing trace with hash -70501179, now seen corresponding path program 2 times [2018-12-02 06:05:50,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:50,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:50,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:50,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:50,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:50,392 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 06:05:50,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:50,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:05:50,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:50,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:05:50,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:05:50,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:05:50,393 INFO L87 Difference]: Start difference. First operand 12732 states and 29112 transitions. Second operand 7 states. [2018-12-02 06:05:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:50,615 INFO L93 Difference]: Finished difference Result 15715 states and 35417 transitions. [2018-12-02 06:05:50,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:05:50,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 06:05:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:50,625 INFO L225 Difference]: With dead ends: 15715 [2018-12-02 06:05:50,626 INFO L226 Difference]: Without dead ends: 15715 [2018-12-02 06:05:50,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:05:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15715 states. [2018-12-02 06:05:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15715 to 12946. [2018-12-02 06:05:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12946 states. [2018-12-02 06:05:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12946 states to 12946 states and 29581 transitions. [2018-12-02 06:05:50,769 INFO L78 Accepts]: Start accepts. Automaton has 12946 states and 29581 transitions. Word has length 94 [2018-12-02 06:05:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:50,769 INFO L480 AbstractCegarLoop]: Abstraction has 12946 states and 29581 transitions. [2018-12-02 06:05:50,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:05:50,769 INFO L276 IsEmpty]: Start isEmpty. Operand 12946 states and 29581 transitions. [2018-12-02 06:05:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:50,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:50,778 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] [2018-12-02 06:05:50,778 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:50,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash -245293274, now seen corresponding path program 2 times [2018-12-02 06:05:50,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:50,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:50,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:05:50,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:50,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:50,821 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 06:05:50,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:50,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:05:50,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:50,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:05:50,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:05:50,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:05:50,822 INFO L87 Difference]: Start difference. First operand 12946 states and 29581 transitions. Second operand 6 states. [2018-12-02 06:05:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:50,931 INFO L93 Difference]: Finished difference Result 12930 states and 29416 transitions. [2018-12-02 06:05:50,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:05:50,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 06:05:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:50,939 INFO L225 Difference]: With dead ends: 12930 [2018-12-02 06:05:50,940 INFO L226 Difference]: Without dead ends: 12930 [2018-12-02 06:05:50,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 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 06:05:50,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12930 states. [2018-12-02 06:05:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12930 to 12527. [2018-12-02 06:05:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12527 states. [2018-12-02 06:05:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12527 states to 12527 states and 28588 transitions. [2018-12-02 06:05:51,036 INFO L78 Accepts]: Start accepts. Automaton has 12527 states and 28588 transitions. Word has length 94 [2018-12-02 06:05:51,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:51,036 INFO L480 AbstractCegarLoop]: Abstraction has 12527 states and 28588 transitions. [2018-12-02 06:05:51,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:05:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 12527 states and 28588 transitions. [2018-12-02 06:05:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:51,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:51,045 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] [2018-12-02 06:05:51,045 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:51,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:51,045 INFO L82 PathProgramCache]: Analyzing trace with hash 675470531, now seen corresponding path program 1 times [2018-12-02 06:05:51,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:51,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:51,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:05:51,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:51,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:51,114 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 06:05:51,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:51,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:05:51,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:51,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:05:51,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:05:51,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:05:51,115 INFO L87 Difference]: Start difference. First operand 12527 states and 28588 transitions. Second operand 9 states. [2018-12-02 06:05:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:51,436 INFO L93 Difference]: Finished difference Result 15921 states and 36379 transitions. [2018-12-02 06:05:51,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 06:05:51,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-02 06:05:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:51,448 INFO L225 Difference]: With dead ends: 15921 [2018-12-02 06:05:51,448 INFO L226 Difference]: Without dead ends: 15889 [2018-12-02 06:05:51,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-12-02 06:05:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15889 states. [2018-12-02 06:05:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15889 to 12058. [2018-12-02 06:05:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12058 states. [2018-12-02 06:05:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12058 states to 12058 states and 27511 transitions. [2018-12-02 06:05:51,559 INFO L78 Accepts]: Start accepts. Automaton has 12058 states and 27511 transitions. Word has length 94 [2018-12-02 06:05:51,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:51,560 INFO L480 AbstractCegarLoop]: Abstraction has 12058 states and 27511 transitions. [2018-12-02 06:05:51,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:05:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 12058 states and 27511 transitions. [2018-12-02 06:05:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:05:51,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:51,570 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] [2018-12-02 06:05:51,571 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:51,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:51,571 INFO L82 PathProgramCache]: Analyzing trace with hash -233977147, now seen corresponding path program 1 times [2018-12-02 06:05:51,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:51,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:51,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:51,597 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 06:05:51,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:51,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:05:51,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:51,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:05:51,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:05:51,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:05:51,598 INFO L87 Difference]: Start difference. First operand 12058 states and 27511 transitions. Second operand 3 states. [2018-12-02 06:05:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:51,624 INFO L93 Difference]: Finished difference Result 11802 states and 26679 transitions. [2018-12-02 06:05:51,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:05:51,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-02 06:05:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:51,632 INFO L225 Difference]: With dead ends: 11802 [2018-12-02 06:05:51,632 INFO L226 Difference]: Without dead ends: 11770 [2018-12-02 06:05:51,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 06:05:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11770 states. [2018-12-02 06:05:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11770 to 9176. [2018-12-02 06:05:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2018-12-02 06:05:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 20537 transitions. [2018-12-02 06:05:51,721 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 20537 transitions. Word has length 94 [2018-12-02 06:05:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:51,721 INFO L480 AbstractCegarLoop]: Abstraction has 9176 states and 20537 transitions. [2018-12-02 06:05:51,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:05:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 20537 transitions. [2018-12-02 06:05:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:05:51,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:51,728 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] [2018-12-02 06:05:51,728 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:51,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:51,729 INFO L82 PathProgramCache]: Analyzing trace with hash 839634464, now seen corresponding path program 1 times [2018-12-02 06:05:51,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:51,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:51,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:51,818 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 06:05:51,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:51,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 06:05:51,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:51,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:05:51,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:05:51,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:05:51,819 INFO L87 Difference]: Start difference. First operand 9176 states and 20537 transitions. Second operand 8 states. [2018-12-02 06:05:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:52,042 INFO L93 Difference]: Finished difference Result 10623 states and 23488 transitions. [2018-12-02 06:05:52,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:05:52,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-02 06:05:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:52,049 INFO L225 Difference]: With dead ends: 10623 [2018-12-02 06:05:52,049 INFO L226 Difference]: Without dead ends: 10623 [2018-12-02 06:05:52,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:05:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10623 states. [2018-12-02 06:05:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10623 to 9535. [2018-12-02 06:05:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9535 states. [2018-12-02 06:05:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9535 states to 9535 states and 21267 transitions. [2018-12-02 06:05:52,121 INFO L78 Accepts]: Start accepts. Automaton has 9535 states and 21267 transitions. Word has length 96 [2018-12-02 06:05:52,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:52,122 INFO L480 AbstractCegarLoop]: Abstraction has 9535 states and 21267 transitions. [2018-12-02 06:05:52,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:05:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 9535 states and 21267 transitions. [2018-12-02 06:05:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:05:52,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:52,129 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] [2018-12-02 06:05:52,129 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:52,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:52,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1050985377, now seen corresponding path program 1 times [2018-12-02 06:05:52,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:52,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:52,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:52,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:52,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:52,200 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 06:05:52,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:52,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:05:52,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:52,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:05:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:05:52,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:05:52,201 INFO L87 Difference]: Start difference. First operand 9535 states and 21267 transitions. Second operand 5 states. [2018-12-02 06:05:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:52,240 INFO L93 Difference]: Finished difference Result 9455 states and 21019 transitions. [2018-12-02 06:05:52,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:05:52,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 06:05:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:52,247 INFO L225 Difference]: With dead ends: 9455 [2018-12-02 06:05:52,248 INFO L226 Difference]: Without dead ends: 9455 [2018-12-02 06:05:52,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:05:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9455 states. [2018-12-02 06:05:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9455 to 7364. [2018-12-02 06:05:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7364 states. [2018-12-02 06:05:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7364 states to 7364 states and 16432 transitions. [2018-12-02 06:05:52,311 INFO L78 Accepts]: Start accepts. Automaton has 7364 states and 16432 transitions. Word has length 96 [2018-12-02 06:05:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:52,312 INFO L480 AbstractCegarLoop]: Abstraction has 7364 states and 16432 transitions. [2018-12-02 06:05:52,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:05:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 7364 states and 16432 transitions. [2018-12-02 06:05:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:05:52,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:52,318 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] [2018-12-02 06:05:52,318 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:52,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:52,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1938489058, now seen corresponding path program 1 times [2018-12-02 06:05:52,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:52,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:52,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:52,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:52,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:52,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 06:05:52,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:52,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:05:52,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:52,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:05:52,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:05:52,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:05:52,409 INFO L87 Difference]: Start difference. First operand 7364 states and 16432 transitions. Second operand 11 states. [2018-12-02 06:05:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:53,518 INFO L93 Difference]: Finished difference Result 13393 states and 30131 transitions. [2018-12-02 06:05:53,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 06:05:53,518 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 06:05:53,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:53,524 INFO L225 Difference]: With dead ends: 13393 [2018-12-02 06:05:53,524 INFO L226 Difference]: Without dead ends: 9041 [2018-12-02 06:05:53,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 06:05:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9041 states. [2018-12-02 06:05:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9041 to 7135. [2018-12-02 06:05:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7135 states. [2018-12-02 06:05:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7135 states to 7135 states and 15832 transitions. [2018-12-02 06:05:53,580 INFO L78 Accepts]: Start accepts. Automaton has 7135 states and 15832 transitions. Word has length 96 [2018-12-02 06:05:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:53,581 INFO L480 AbstractCegarLoop]: Abstraction has 7135 states and 15832 transitions. [2018-12-02 06:05:53,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:05:53,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7135 states and 15832 transitions. [2018-12-02 06:05:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:05:53,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:53,586 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] [2018-12-02 06:05:53,586 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:53,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:53,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2140926390, now seen corresponding path program 1 times [2018-12-02 06:05:53,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:53,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:53,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:53,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:53,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:53,677 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 06:05:53,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:53,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:05:53,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:53,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:05:53,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:05:53,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:05:53,677 INFO L87 Difference]: Start difference. First operand 7135 states and 15832 transitions. Second operand 7 states. [2018-12-02 06:05:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:54,223 INFO L93 Difference]: Finished difference Result 8801 states and 19313 transitions. [2018-12-02 06:05:54,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:05:54,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 06:05:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:54,237 INFO L225 Difference]: With dead ends: 8801 [2018-12-02 06:05:54,237 INFO L226 Difference]: Without dead ends: 8753 [2018-12-02 06:05:54,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:05:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2018-12-02 06:05:54,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 7241. [2018-12-02 06:05:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7241 states. [2018-12-02 06:05:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 16021 transitions. [2018-12-02 06:05:54,304 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 16021 transitions. Word has length 96 [2018-12-02 06:05:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:54,304 INFO L480 AbstractCegarLoop]: Abstraction has 7241 states and 16021 transitions. [2018-12-02 06:05:54,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:05:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 16021 transitions. [2018-12-02 06:05:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:05:54,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:54,309 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] [2018-12-02 06:05:54,309 INFO L423 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:54,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:54,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1682562155, now seen corresponding path program 1 times [2018-12-02 06:05:54,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:54,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:54,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:54,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:54,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:54,374 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 06:05:54,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:54,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:05:54,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:54,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:05:54,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:05:54,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:05:54,375 INFO L87 Difference]: Start difference. First operand 7241 states and 16021 transitions. Second operand 7 states. [2018-12-02 06:05:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:54,568 INFO L93 Difference]: Finished difference Result 7987 states and 17650 transitions. [2018-12-02 06:05:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:05:54,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 06:05:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:54,573 INFO L225 Difference]: With dead ends: 7987 [2018-12-02 06:05:54,573 INFO L226 Difference]: Without dead ends: 7987 [2018-12-02 06:05:54,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:05:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7987 states. [2018-12-02 06:05:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7987 to 7461. [2018-12-02 06:05:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7461 states. [2018-12-02 06:05:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 16483 transitions. [2018-12-02 06:05:54,626 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 16483 transitions. Word has length 96 [2018-12-02 06:05:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:54,626 INFO L480 AbstractCegarLoop]: Abstraction has 7461 states and 16483 transitions. [2018-12-02 06:05:54,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:05:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 16483 transitions. [2018-12-02 06:05:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:05:54,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:54,632 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] [2018-12-02 06:05:54,632 INFO L423 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:54,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:54,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1529942070, now seen corresponding path program 1 times [2018-12-02 06:05:54,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:54,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:54,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:54,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:54,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:54,770 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 06:05:54,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:54,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:05:54,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:54,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:05:54,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:05:54,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:05:54,771 INFO L87 Difference]: Start difference. First operand 7461 states and 16483 transitions. Second operand 9 states. [2018-12-02 06:05:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:55,029 INFO L93 Difference]: Finished difference Result 8522 states and 18688 transitions. [2018-12-02 06:05:55,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:05:55,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 06:05:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:55,035 INFO L225 Difference]: With dead ends: 8522 [2018-12-02 06:05:55,035 INFO L226 Difference]: Without dead ends: 8522 [2018-12-02 06:05:55,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:05:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2018-12-02 06:05:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 7514. [2018-12-02 06:05:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7514 states. [2018-12-02 06:05:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7514 states to 7514 states and 16606 transitions. [2018-12-02 06:05:55,089 INFO L78 Accepts]: Start accepts. Automaton has 7514 states and 16606 transitions. Word has length 96 [2018-12-02 06:05:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:55,090 INFO L480 AbstractCegarLoop]: Abstraction has 7514 states and 16606 transitions. [2018-12-02 06:05:55,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:05:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7514 states and 16606 transitions. [2018-12-02 06:05:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:05:55,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:55,095 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] [2018-12-02 06:05:55,095 INFO L423 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:55,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash -362468405, now seen corresponding path program 1 times [2018-12-02 06:05:55,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:55,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:55,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:55,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:05:55,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 06:05:55,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:05:55,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:05:55,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 06:05:55,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:05:55,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:05:55,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:05:55,162 INFO L87 Difference]: Start difference. First operand 7514 states and 16606 transitions. Second operand 7 states. [2018-12-02 06:05:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:05:55,250 INFO L93 Difference]: Finished difference Result 9145 states and 20215 transitions. [2018-12-02 06:05:55,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:05:55,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 06:05:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:05:55,256 INFO L225 Difference]: With dead ends: 9145 [2018-12-02 06:05:55,256 INFO L226 Difference]: Without dead ends: 9145 [2018-12-02 06:05:55,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:05:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9145 states. [2018-12-02 06:05:55,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9145 to 7099. [2018-12-02 06:05:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7099 states. [2018-12-02 06:05:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7099 states to 7099 states and 15732 transitions. [2018-12-02 06:05:55,311 INFO L78 Accepts]: Start accepts. Automaton has 7099 states and 15732 transitions. Word has length 96 [2018-12-02 06:05:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:05:55,311 INFO L480 AbstractCegarLoop]: Abstraction has 7099 states and 15732 transitions. [2018-12-02 06:05:55,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:05:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 7099 states and 15732 transitions. [2018-12-02 06:05:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:05:55,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:05:55,316 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] [2018-12-02 06:05:55,316 INFO L423 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:05:55,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:05:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1465989324, now seen corresponding path program 2 times [2018-12-02 06:05:55,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 06:05:55,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:55,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:05:55,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:05:55,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 06:05:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:05:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:05:55,353 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 06:05:55,417 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 06:05:55,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:05:55 BasicIcfg [2018-12-02 06:05:55,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 06:05:55,418 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:05:55,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:05:55,419 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:05:55,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:05:25" (3/4) ... [2018-12-02 06:05:55,421 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 06:05:55,488 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b45d8885-136e-4508-a068-414d641fa0a4/bin-2019/utaipan/witness.graphml [2018-12-02 06:05:55,489 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:05:55,489 INFO L168 Benchmark]: Toolchain (without parser) took 30388.06 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 952.4 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-02 06:05:55,490 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:05:55,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -100.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-02 06:05:55,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-02 06:05:55,491 INFO L168 Benchmark]: Boogie Preprocessor took 19.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:05:55,491 INFO L168 Benchmark]: RCFGBuilder took 329.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 994.9 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2018-12-02 06:05:55,491 INFO L168 Benchmark]: TraceAbstraction took 29593.12 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 994.9 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-02 06:05:55,491 INFO L168 Benchmark]: Witness Printer took 70.26 ms. Allocated memory is still 4.6 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 67.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:05:55,492 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -100.9 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 329.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 994.9 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29593.12 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 994.9 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 70.26 ms. Allocated memory is still 4.6 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 67.7 MB). Peak memory consumption was 67.7 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] -1 pthread_t t1611; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1611, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L703] 0 x$w_buff1 = x$w_buff0 [L704] 0 x$w_buff0 = 1 [L705] 0 x$w_buff1_used = x$w_buff0_used [L706] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L708] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L709] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L710] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L711] 0 x$r_buff0_thd1 = (_Bool)1 [L714] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L717] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L780] -1 pthread_t t1612; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L781] FCALL, FORK -1 pthread_create(&t1612, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L731] 1 y = 2 [L734] 1 z = 1 [L737] 1 __unbuffered_p1_EAX = z [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L750] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L717] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L759] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L718] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L719] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L719] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L720] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L720] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L721] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L788] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L790] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L791] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 29.5s OverallTime, 45 OverallIterations, 1 TraceHistogramMax, 13.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11576 SDtfs, 13437 SDslu, 27193 SDs, 0 SdLazy, 12679 SolverSat, 769 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 113 SyntacticMatches, 43 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred 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: 11.3s AutomataMinimizationTime, 44 MinimizatonAttempts, 205032 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3475 NumberOfCodeBlocks, 3475 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3335 ConstructedInterpolants, 0 QuantifiedInterpolants, 862334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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...