./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_tso.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_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/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 6aaa902a47ad4e36fdf776a2739bece57b1e8f78 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 03:26:57,410 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:26:57,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:26:57,417 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:26:57,417 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:26:57,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:26:57,418 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:26:57,419 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:26:57,419 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:26:57,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:26:57,420 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:26:57,420 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:26:57,421 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:26:57,421 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:26:57,422 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:26:57,422 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:26:57,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:26:57,423 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:26:57,424 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:26:57,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:26:57,425 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:26:57,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:26:57,427 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:26:57,427 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:26:57,427 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:26:57,427 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:26:57,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:26:57,428 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:26:57,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:26:57,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:26:57,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:26:57,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:26:57,430 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:26:57,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:26:57,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:26:57,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:26:57,430 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 03:26:57,437 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:26:57,437 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:26:57,438 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:26:57,438 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:26:57,438 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 03:26:57,438 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 03:26:57,438 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 03:26:57,438 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 03:26:57,439 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 03:26:57,439 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 03:26:57,439 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 03:26:57,439 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 03:26:57,439 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 03:26:57,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:26:57,439 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:26:57,439 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:26:57,439 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:26:57,440 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:26:57,440 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 03:26:57,440 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:26:57,440 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 03:26:57,440 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:26:57,440 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:26:57,440 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 03:26:57,440 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:26:57,440 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:26:57,440 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:26:57,440 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:26:57,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:26:57,441 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:26:57,441 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:26:57,441 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 03:26:57,441 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 03:26:57,441 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:26:57,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 03:26:57,441 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 03:26:57,441 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_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/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 -> 6aaa902a47ad4e36fdf776a2739bece57b1e8f78 [2018-12-02 03:26:57,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:26:57,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:26:57,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:26:57,471 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:26:57,472 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:26:57,472 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix022_tso.oepc_false-unreach-call.i [2018-12-02 03:26:57,515 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/bin-2019/utaipan/data/bfebbec64/602298b163674b90902adaa0b52ddb08/FLAG9cf1c401e [2018-12-02 03:26:57,949 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:26:57,950 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/sv-benchmarks/c/pthread-wmm/mix022_tso.oepc_false-unreach-call.i [2018-12-02 03:26:57,957 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/bin-2019/utaipan/data/bfebbec64/602298b163674b90902adaa0b52ddb08/FLAG9cf1c401e [2018-12-02 03:26:57,965 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/bin-2019/utaipan/data/bfebbec64/602298b163674b90902adaa0b52ddb08 [2018-12-02 03:26:57,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:26:57,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:26:57,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:26:57,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:26:57,970 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:26:57,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:26:57" (1/1) ... [2018-12-02 03:26:57,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:57, skipping insertion in model container [2018-12-02 03:26:57,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:26:57" (1/1) ... [2018-12-02 03:26:57,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:26:57,997 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:26:58,181 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:26:58,189 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:26:58,276 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:26:58,305 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:26:58,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58 WrapperNode [2018-12-02 03:26:58,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:26:58,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:26:58,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:26:58,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:26:58,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58" (1/1) ... [2018-12-02 03:26:58,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58" (1/1) ... [2018-12-02 03:26:58,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:26:58,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:26:58,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:26:58,343 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:26:58,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58" (1/1) ... [2018-12-02 03:26:58,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58" (1/1) ... [2018-12-02 03:26:58,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58" (1/1) ... [2018-12-02 03:26:58,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58" (1/1) ... [2018-12-02 03:26:58,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58" (1/1) ... [2018-12-02 03:26:58,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58" (1/1) ... [2018-12-02 03:26:58,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58" (1/1) ... [2018-12-02 03:26:58,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:26:58,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:26:58,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:26:58,365 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:26:58,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/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 03:26:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:26:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:26:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 03:26:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:26:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 03:26:58,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 03:26:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 03:26:58,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 03:26:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 03:26:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:26:58,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:26:58,405 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 03:26:58,731 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:26:58,731 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 03:26:58,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:26:58 BoogieIcfgContainer [2018-12-02 03:26:58,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:26:58,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 03:26:58,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 03:26:58,734 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 03:26:58,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:26:57" (1/3) ... [2018-12-02 03:26:58,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119f21e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:26:58, skipping insertion in model container [2018-12-02 03:26:58,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:26:58" (2/3) ... [2018-12-02 03:26:58,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119f21e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:26:58, skipping insertion in model container [2018-12-02 03:26:58,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:26:58" (3/3) ... [2018-12-02 03:26:58,737 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_tso.oepc_false-unreach-call.i [2018-12-02 03:26:58,760 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,760 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,760 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,761 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,762 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,766 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,766 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,766 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,766 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,767 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 03:26:58,788 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 03:26:58,788 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 03:26:58,794 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 03:26:58,803 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 03:26:58,818 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 03:26:58,819 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 03:26:58,819 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 03:26:58,819 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:26:58,819 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:26:58,819 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 03:26:58,819 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:26:58,819 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 03:26:58,826 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 184places, 243 transitions [2018-12-02 03:27:03,150 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 75068 states. [2018-12-02 03:27:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 75068 states. [2018-12-02 03:27:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 03:27:03,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:03,157 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] [2018-12-02 03:27:03,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:03,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:03,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1573700734, now seen corresponding path program 1 times [2018-12-02 03:27:03,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:03,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:03,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:03,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:03,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:03,323 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 03:27:03,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:03,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:27:03,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:03,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:27:03,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:27:03,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:27:03,337 INFO L87 Difference]: Start difference. First operand 75068 states. Second operand 4 states. [2018-12-02 03:27:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:04,182 INFO L93 Difference]: Finished difference Result 142996 states and 583892 transitions. [2018-12-02 03:27:04,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:27:04,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-02 03:27:04,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:04,607 INFO L225 Difference]: With dead ends: 142996 [2018-12-02 03:27:04,607 INFO L226 Difference]: Without dead ends: 126812 [2018-12-02 03:27:04,608 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 03:27:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126812 states. [2018-12-02 03:27:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126812 to 67930. [2018-12-02 03:27:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67930 states. [2018-12-02 03:27:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67930 states to 67930 states and 279065 transitions. [2018-12-02 03:27:06,983 INFO L78 Accepts]: Start accepts. Automaton has 67930 states and 279065 transitions. Word has length 37 [2018-12-02 03:27:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:06,983 INFO L480 AbstractCegarLoop]: Abstraction has 67930 states and 279065 transitions. [2018-12-02 03:27:06,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:27:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 67930 states and 279065 transitions. [2018-12-02 03:27:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 03:27:06,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:06,986 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] [2018-12-02 03:27:06,986 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:06,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:06,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1444770339, now seen corresponding path program 1 times [2018-12-02 03:27:06,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:06,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:06,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:06,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:06,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:07,042 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 03:27:07,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:07,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:27:07,042 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:07,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:27:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:27:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:27:07,044 INFO L87 Difference]: Start difference. First operand 67930 states and 279065 transitions. Second operand 5 states. [2018-12-02 03:27:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:08,289 INFO L93 Difference]: Finished difference Result 201246 states and 776001 transitions. [2018-12-02 03:27:08,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:27:08,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-02 03:27:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:08,817 INFO L225 Difference]: With dead ends: 201246 [2018-12-02 03:27:08,817 INFO L226 Difference]: Without dead ends: 201086 [2018-12-02 03:27:08,818 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 03:27:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201086 states. [2018-12-02 03:27:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201086 to 109739. [2018-12-02 03:27:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109739 states. [2018-12-02 03:27:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109739 states to 109739 states and 422911 transitions. [2018-12-02 03:27:13,548 INFO L78 Accepts]: Start accepts. Automaton has 109739 states and 422911 transitions. Word has length 44 [2018-12-02 03:27:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:13,549 INFO L480 AbstractCegarLoop]: Abstraction has 109739 states and 422911 transitions. [2018-12-02 03:27:13,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:27:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 109739 states and 422911 transitions. [2018-12-02 03:27:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 03:27:13,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:13,552 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] [2018-12-02 03:27:13,552 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:13,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:13,552 INFO L82 PathProgramCache]: Analyzing trace with hash -991995994, now seen corresponding path program 1 times [2018-12-02 03:27:13,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:13,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:13,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:13,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:13,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:13,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 03:27:13,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:13,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:27:13,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:13,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:27:13,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:27:13,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:27:13,598 INFO L87 Difference]: Start difference. First operand 109739 states and 422911 transitions. Second operand 4 states. [2018-12-02 03:27:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:13,684 INFO L93 Difference]: Finished difference Result 26128 states and 89696 transitions. [2018-12-02 03:27:13,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:27:13,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 03:27:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:13,718 INFO L225 Difference]: With dead ends: 26128 [2018-12-02 03:27:13,719 INFO L226 Difference]: Without dead ends: 24431 [2018-12-02 03:27:13,719 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 03:27:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24431 states. [2018-12-02 03:27:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24431 to 24431. [2018-12-02 03:27:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24431 states. [2018-12-02 03:27:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24431 states to 24431 states and 84249 transitions. [2018-12-02 03:27:14,002 INFO L78 Accepts]: Start accepts. Automaton has 24431 states and 84249 transitions. Word has length 45 [2018-12-02 03:27:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:14,002 INFO L480 AbstractCegarLoop]: Abstraction has 24431 states and 84249 transitions. [2018-12-02 03:27:14,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:27:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 24431 states and 84249 transitions. [2018-12-02 03:27:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 03:27:14,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:14,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:14,005 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:14,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1579757532, now seen corresponding path program 1 times [2018-12-02 03:27:14,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:14,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:14,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:14,056 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 03:27:14,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:14,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:27:14,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:14,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:27:14,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:27:14,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:27:14,057 INFO L87 Difference]: Start difference. First operand 24431 states and 84249 transitions. Second operand 4 states. [2018-12-02 03:27:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:14,323 INFO L93 Difference]: Finished difference Result 33039 states and 111277 transitions. [2018-12-02 03:27:14,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:27:14,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 03:27:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:14,367 INFO L225 Difference]: With dead ends: 33039 [2018-12-02 03:27:14,367 INFO L226 Difference]: Without dead ends: 33039 [2018-12-02 03:27:14,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 03:27:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33039 states. [2018-12-02 03:27:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33039 to 27711. [2018-12-02 03:27:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27711 states. [2018-12-02 03:27:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27711 states to 27711 states and 94397 transitions. [2018-12-02 03:27:14,933 INFO L78 Accepts]: Start accepts. Automaton has 27711 states and 94397 transitions. Word has length 58 [2018-12-02 03:27:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:14,934 INFO L480 AbstractCegarLoop]: Abstraction has 27711 states and 94397 transitions. [2018-12-02 03:27:14,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:27:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 27711 states and 94397 transitions. [2018-12-02 03:27:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 03:27:14,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:14,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:14,937 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:14,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:14,937 INFO L82 PathProgramCache]: Analyzing trace with hash -992403568, now seen corresponding path program 1 times [2018-12-02 03:27:14,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:14,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:14,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:14,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:14,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:14,987 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 03:27:14,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:14,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:27:14,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:14,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:27:14,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:27:14,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:27:14,988 INFO L87 Difference]: Start difference. First operand 27711 states and 94397 transitions. Second operand 4 states. [2018-12-02 03:27:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:15,538 INFO L93 Difference]: Finished difference Result 34248 states and 114231 transitions. [2018-12-02 03:27:15,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:27:15,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 03:27:15,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:15,582 INFO L225 Difference]: With dead ends: 34248 [2018-12-02 03:27:15,582 INFO L226 Difference]: Without dead ends: 34248 [2018-12-02 03:27:15,583 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 03:27:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34248 states. [2018-12-02 03:27:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34248 to 31773. [2018-12-02 03:27:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31773 states. [2018-12-02 03:27:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31773 states to 31773 states and 107008 transitions. [2018-12-02 03:27:15,965 INFO L78 Accepts]: Start accepts. Automaton has 31773 states and 107008 transitions. Word has length 58 [2018-12-02 03:27:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:15,965 INFO L480 AbstractCegarLoop]: Abstraction has 31773 states and 107008 transitions. [2018-12-02 03:27:15,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:27:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 31773 states and 107008 transitions. [2018-12-02 03:27:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 03:27:15,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:15,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:15,969 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:15,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:15,970 INFO L82 PathProgramCache]: Analyzing trace with hash 360906129, now seen corresponding path program 1 times [2018-12-02 03:27:15,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:15,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:15,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:15,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:15,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:16,039 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 03:27:16,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:16,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:27:16,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:16,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:27:16,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:27:16,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:27:16,040 INFO L87 Difference]: Start difference. First operand 31773 states and 107008 transitions. Second operand 6 states. [2018-12-02 03:27:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:16,588 INFO L93 Difference]: Finished difference Result 46397 states and 155016 transitions. [2018-12-02 03:27:16,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 03:27:16,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-02 03:27:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:16,649 INFO L225 Difference]: With dead ends: 46397 [2018-12-02 03:27:16,649 INFO L226 Difference]: Without dead ends: 46365 [2018-12-02 03:27:16,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 03:27:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46365 states. [2018-12-02 03:27:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46365 to 37325. [2018-12-02 03:27:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37325 states. [2018-12-02 03:27:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37325 states to 37325 states and 124568 transitions. [2018-12-02 03:27:17,127 INFO L78 Accepts]: Start accepts. Automaton has 37325 states and 124568 transitions. Word has length 58 [2018-12-02 03:27:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:17,128 INFO L480 AbstractCegarLoop]: Abstraction has 37325 states and 124568 transitions. [2018-12-02 03:27:17,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:27:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 37325 states and 124568 transitions. [2018-12-02 03:27:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 03:27:17,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:17,141 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] [2018-12-02 03:27:17,142 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:17,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash -124637825, now seen corresponding path program 1 times [2018-12-02 03:27:17,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:17,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:17,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:17,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:17,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:17,215 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 03:27:17,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:17,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:27:17,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:17,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:27:17,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:27:17,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:27:17,216 INFO L87 Difference]: Start difference. First operand 37325 states and 124568 transitions. Second operand 4 states. [2018-12-02 03:27:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:17,982 INFO L93 Difference]: Finished difference Result 59481 states and 195605 transitions. [2018-12-02 03:27:17,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:27:17,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 03:27:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:18,071 INFO L225 Difference]: With dead ends: 59481 [2018-12-02 03:27:18,071 INFO L226 Difference]: Without dead ends: 59285 [2018-12-02 03:27:18,071 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 03:27:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59285 states. [2018-12-02 03:27:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59285 to 50769. [2018-12-02 03:27:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50769 states. [2018-12-02 03:27:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50769 states to 50769 states and 168555 transitions. [2018-12-02 03:27:18,752 INFO L78 Accepts]: Start accepts. Automaton has 50769 states and 168555 transitions. Word has length 72 [2018-12-02 03:27:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:18,752 INFO L480 AbstractCegarLoop]: Abstraction has 50769 states and 168555 transitions. [2018-12-02 03:27:18,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:27:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 50769 states and 168555 transitions. [2018-12-02 03:27:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 03:27:18,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:18,770 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] [2018-12-02 03:27:18,770 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:18,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1228671872, now seen corresponding path program 1 times [2018-12-02 03:27:18,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:18,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:18,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:18,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:18,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:18,852 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 03:27:18,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:18,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 03:27:18,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:18,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 03:27:18,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 03:27:18,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:27:18,853 INFO L87 Difference]: Start difference. First operand 50769 states and 168555 transitions. Second operand 8 states. [2018-12-02 03:27:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:19,996 INFO L93 Difference]: Finished difference Result 74755 states and 241276 transitions. [2018-12-02 03:27:19,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 03:27:19,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-12-02 03:27:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:20,100 INFO L225 Difference]: With dead ends: 74755 [2018-12-02 03:27:20,100 INFO L226 Difference]: Without dead ends: 74491 [2018-12-02 03:27:20,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 03:27:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74491 states. [2018-12-02 03:27:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74491 to 59134. [2018-12-02 03:27:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59134 states. [2018-12-02 03:27:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59134 states to 59134 states and 194352 transitions. [2018-12-02 03:27:20,983 INFO L78 Accepts]: Start accepts. Automaton has 59134 states and 194352 transitions. Word has length 72 [2018-12-02 03:27:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:20,983 INFO L480 AbstractCegarLoop]: Abstraction has 59134 states and 194352 transitions. [2018-12-02 03:27:20,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 03:27:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 59134 states and 194352 transitions. [2018-12-02 03:27:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 03:27:21,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:21,005 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] [2018-12-02 03:27:21,005 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:21,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash 935268865, now seen corresponding path program 1 times [2018-12-02 03:27:21,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:21,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:21,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:21,035 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 03:27:21,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:21,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:27:21,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:21,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:27:21,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:27:21,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:27:21,036 INFO L87 Difference]: Start difference. First operand 59134 states and 194352 transitions. Second operand 5 states. [2018-12-02 03:27:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:21,066 INFO L93 Difference]: Finished difference Result 8418 states and 21911 transitions. [2018-12-02 03:27:21,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:27:21,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-02 03:27:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:21,072 INFO L225 Difference]: With dead ends: 8418 [2018-12-02 03:27:21,072 INFO L226 Difference]: Without dead ends: 6688 [2018-12-02 03:27:21,072 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 03:27:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2018-12-02 03:27:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 5491. [2018-12-02 03:27:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5491 states. [2018-12-02 03:27:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5491 states to 5491 states and 14306 transitions. [2018-12-02 03:27:21,116 INFO L78 Accepts]: Start accepts. Automaton has 5491 states and 14306 transitions. Word has length 72 [2018-12-02 03:27:21,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:21,117 INFO L480 AbstractCegarLoop]: Abstraction has 5491 states and 14306 transitions. [2018-12-02 03:27:21,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:27:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 5491 states and 14306 transitions. [2018-12-02 03:27:21,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 03:27:21,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:21,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:21,122 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:21,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:21,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1186244919, now seen corresponding path program 1 times [2018-12-02 03:27:21,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:21,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:21,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:21,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:21,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:21,189 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 03:27:21,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:21,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:27:21,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:21,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:27:21,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:27:21,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:27:21,190 INFO L87 Difference]: Start difference. First operand 5491 states and 14306 transitions. Second operand 6 states. [2018-12-02 03:27:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:21,579 INFO L93 Difference]: Finished difference Result 6815 states and 17529 transitions. [2018-12-02 03:27:21,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:27:21,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-12-02 03:27:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:21,584 INFO L225 Difference]: With dead ends: 6815 [2018-12-02 03:27:21,584 INFO L226 Difference]: Without dead ends: 6815 [2018-12-02 03:27:21,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:27:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6815 states. [2018-12-02 03:27:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6815 to 5717. [2018-12-02 03:27:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5717 states. [2018-12-02 03:27:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5717 states to 5717 states and 14885 transitions. [2018-12-02 03:27:21,633 INFO L78 Accepts]: Start accepts. Automaton has 5717 states and 14885 transitions. Word has length 107 [2018-12-02 03:27:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:21,633 INFO L480 AbstractCegarLoop]: Abstraction has 5717 states and 14885 transitions. [2018-12-02 03:27:21,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:27:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 5717 states and 14885 transitions. [2018-12-02 03:27:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 03:27:21,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:21,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:21,638 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:21,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:21,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1650504994, now seen corresponding path program 1 times [2018-12-02 03:27:21,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:21,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:21,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:21,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:21,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:21,711 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 03:27:21,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:21,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:27:21,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:21,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:27:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:27:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:27:21,712 INFO L87 Difference]: Start difference. First operand 5717 states and 14885 transitions. Second operand 7 states. [2018-12-02 03:27:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:22,157 INFO L93 Difference]: Finished difference Result 6354 states and 16397 transitions. [2018-12-02 03:27:22,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:27:22,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-12-02 03:27:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:22,165 INFO L225 Difference]: With dead ends: 6354 [2018-12-02 03:27:22,165 INFO L226 Difference]: Without dead ends: 6354 [2018-12-02 03:27:22,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:27:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6354 states. [2018-12-02 03:27:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6354 to 5775. [2018-12-02 03:27:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5775 states. [2018-12-02 03:27:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5775 states to 5775 states and 15019 transitions. [2018-12-02 03:27:22,216 INFO L78 Accepts]: Start accepts. Automaton has 5775 states and 15019 transitions. Word has length 107 [2018-12-02 03:27:22,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:22,217 INFO L480 AbstractCegarLoop]: Abstraction has 5775 states and 15019 transitions. [2018-12-02 03:27:22,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:27:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5775 states and 15019 transitions. [2018-12-02 03:27:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 03:27:22,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:22,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:22,221 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:22,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:22,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2134755490, now seen corresponding path program 2 times [2018-12-02 03:27:22,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:22,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:22,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:22,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:22,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:22,271 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 03:27:22,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:22,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:27:22,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:22,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:27:22,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:27:22,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:27:22,272 INFO L87 Difference]: Start difference. First operand 5775 states and 15019 transitions. Second operand 5 states. [2018-12-02 03:27:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:22,448 INFO L93 Difference]: Finished difference Result 6224 states and 16025 transitions. [2018-12-02 03:27:22,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:27:22,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-02 03:27:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:22,453 INFO L225 Difference]: With dead ends: 6224 [2018-12-02 03:27:22,453 INFO L226 Difference]: Without dead ends: 6224 [2018-12-02 03:27:22,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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 03:27:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2018-12-02 03:27:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 5790. [2018-12-02 03:27:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5790 states. [2018-12-02 03:27:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5790 states to 5790 states and 15050 transitions. [2018-12-02 03:27:22,498 INFO L78 Accepts]: Start accepts. Automaton has 5790 states and 15050 transitions. Word has length 107 [2018-12-02 03:27:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:22,499 INFO L480 AbstractCegarLoop]: Abstraction has 5790 states and 15050 transitions. [2018-12-02 03:27:22,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:27:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5790 states and 15050 transitions. [2018-12-02 03:27:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 03:27:22,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:22,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:22,503 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:22,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:22,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1901873310, now seen corresponding path program 3 times [2018-12-02 03:27:22,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:22,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:22,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:27:22,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:22,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:22,545 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 03:27:22,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:22,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:27:22,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:22,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:27:22,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:27:22,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:27:22,546 INFO L87 Difference]: Start difference. First operand 5790 states and 15050 transitions. Second operand 4 states. [2018-12-02 03:27:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:22,659 INFO L93 Difference]: Finished difference Result 6378 states and 16425 transitions. [2018-12-02 03:27:22,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:27:22,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-02 03:27:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:22,664 INFO L225 Difference]: With dead ends: 6378 [2018-12-02 03:27:22,664 INFO L226 Difference]: Without dead ends: 6350 [2018-12-02 03:27:22,665 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 03:27:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6350 states. [2018-12-02 03:27:22,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6350 to 6297. [2018-12-02 03:27:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6297 states. [2018-12-02 03:27:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6297 states to 6297 states and 16261 transitions. [2018-12-02 03:27:22,714 INFO L78 Accepts]: Start accepts. Automaton has 6297 states and 16261 transitions. Word has length 107 [2018-12-02 03:27:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:22,714 INFO L480 AbstractCegarLoop]: Abstraction has 6297 states and 16261 transitions. [2018-12-02 03:27:22,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:27:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 6297 states and 16261 transitions. [2018-12-02 03:27:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 03:27:22,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:22,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:22,719 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:22,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:22,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1423512963, now seen corresponding path program 1 times [2018-12-02 03:27:22,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:22,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:22,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:27:22,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:22,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:22,745 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 03:27:22,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:22,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:27:22,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:22,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:27:22,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:27:22,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:27:22,746 INFO L87 Difference]: Start difference. First operand 6297 states and 16261 transitions. Second operand 3 states. [2018-12-02 03:27:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:22,874 INFO L93 Difference]: Finished difference Result 7650 states and 19424 transitions. [2018-12-02 03:27:22,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:27:22,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-12-02 03:27:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:22,880 INFO L225 Difference]: With dead ends: 7650 [2018-12-02 03:27:22,880 INFO L226 Difference]: Without dead ends: 7650 [2018-12-02 03:27:22,880 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 03:27:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7650 states. [2018-12-02 03:27:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7650 to 7325. [2018-12-02 03:27:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7325 states. [2018-12-02 03:27:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7325 states to 7325 states and 18703 transitions. [2018-12-02 03:27:22,941 INFO L78 Accepts]: Start accepts. Automaton has 7325 states and 18703 transitions. Word has length 107 [2018-12-02 03:27:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:22,941 INFO L480 AbstractCegarLoop]: Abstraction has 7325 states and 18703 transitions. [2018-12-02 03:27:22,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:27:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 7325 states and 18703 transitions. [2018-12-02 03:27:22,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 03:27:22,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:22,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:22,947 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:22,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:22,947 INFO L82 PathProgramCache]: Analyzing trace with hash 796683309, now seen corresponding path program 2 times [2018-12-02 03:27:22,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:22,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:22,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:27:22,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:22,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:27:22,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:22,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:27:22,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:27:22,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:27:22,989 INFO L87 Difference]: Start difference. First operand 7325 states and 18703 transitions. Second operand 5 states. [2018-12-02 03:27:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:23,197 INFO L93 Difference]: Finished difference Result 8240 states and 20813 transitions. [2018-12-02 03:27:23,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:27:23,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-02 03:27:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:23,203 INFO L225 Difference]: With dead ends: 8240 [2018-12-02 03:27:23,203 INFO L226 Difference]: Without dead ends: 8212 [2018-12-02 03:27:23,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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 03:27:23,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8212 states. [2018-12-02 03:27:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8212 to 7711. [2018-12-02 03:27:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7711 states. [2018-12-02 03:27:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7711 states to 7711 states and 19562 transitions. [2018-12-02 03:27:23,261 INFO L78 Accepts]: Start accepts. Automaton has 7711 states and 19562 transitions. Word has length 107 [2018-12-02 03:27:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:23,261 INFO L480 AbstractCegarLoop]: Abstraction has 7711 states and 19562 transitions. [2018-12-02 03:27:23,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:27:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 7711 states and 19562 transitions. [2018-12-02 03:27:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 03:27:23,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:23,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:23,267 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:23,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:23,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1383699242, now seen corresponding path program 1 times [2018-12-02 03:27:23,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:23,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:23,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:27:23,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:23,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:23,293 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 03:27:23,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:23,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:27:23,293 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:23,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:27:23,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:27:23,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:27:23,294 INFO L87 Difference]: Start difference. First operand 7711 states and 19562 transitions. Second operand 4 states. [2018-12-02 03:27:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:23,496 INFO L93 Difference]: Finished difference Result 11322 states and 28079 transitions. [2018-12-02 03:27:23,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:27:23,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-02 03:27:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:23,505 INFO L225 Difference]: With dead ends: 11322 [2018-12-02 03:27:23,505 INFO L226 Difference]: Without dead ends: 11236 [2018-12-02 03:27:23,506 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 03:27:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11236 states. [2018-12-02 03:27:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11236 to 8377. [2018-12-02 03:27:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8377 states. [2018-12-02 03:27:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8377 states to 8377 states and 21224 transitions. [2018-12-02 03:27:23,578 INFO L78 Accepts]: Start accepts. Automaton has 8377 states and 21224 transitions. Word has length 107 [2018-12-02 03:27:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:23,578 INFO L480 AbstractCegarLoop]: Abstraction has 8377 states and 21224 transitions. [2018-12-02 03:27:23,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:27:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 8377 states and 21224 transitions. [2018-12-02 03:27:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 03:27:23,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:23,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:23,584 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:23,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash -509720644, now seen corresponding path program 2 times [2018-12-02 03:27:23,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:23,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:23,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:23,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:23,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:23,628 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 03:27:23,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:23,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:27:23,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:23,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:27:23,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:27:23,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:27:23,629 INFO L87 Difference]: Start difference. First operand 8377 states and 21224 transitions. Second operand 4 states. [2018-12-02 03:27:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:23,743 INFO L93 Difference]: Finished difference Result 9141 states and 22962 transitions. [2018-12-02 03:27:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:27:23,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-02 03:27:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:23,751 INFO L225 Difference]: With dead ends: 9141 [2018-12-02 03:27:23,751 INFO L226 Difference]: Without dead ends: 9141 [2018-12-02 03:27:23,751 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 03:27:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9141 states. [2018-12-02 03:27:23,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9141 to 8185. [2018-12-02 03:27:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8185 states. [2018-12-02 03:27:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8185 states to 8185 states and 20787 transitions. [2018-12-02 03:27:23,820 INFO L78 Accepts]: Start accepts. Automaton has 8185 states and 20787 transitions. Word has length 107 [2018-12-02 03:27:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:23,820 INFO L480 AbstractCegarLoop]: Abstraction has 8185 states and 20787 transitions. [2018-12-02 03:27:23,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:27:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 8185 states and 20787 transitions. [2018-12-02 03:27:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 03:27:23,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:23,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:23,826 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:23,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:23,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1999459674, now seen corresponding path program 1 times [2018-12-02 03:27:23,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:23,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:23,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:27:23,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:23,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:23,878 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 03:27:23,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:23,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:27:23,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:23,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:27:23,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:27:23,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:27:23,879 INFO L87 Difference]: Start difference. First operand 8185 states and 20787 transitions. Second operand 7 states. [2018-12-02 03:27:24,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:24,244 INFO L93 Difference]: Finished difference Result 11985 states and 29229 transitions. [2018-12-02 03:27:24,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 03:27:24,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-02 03:27:24,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:24,253 INFO L225 Difference]: With dead ends: 11985 [2018-12-02 03:27:24,253 INFO L226 Difference]: Without dead ends: 11544 [2018-12-02 03:27:24,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:27:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11544 states. [2018-12-02 03:27:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11544 to 10397. [2018-12-02 03:27:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2018-12-02 03:27:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 25907 transitions. [2018-12-02 03:27:24,355 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 25907 transitions. Word has length 109 [2018-12-02 03:27:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:24,355 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 25907 transitions. [2018-12-02 03:27:24,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:27:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 25907 transitions. [2018-12-02 03:27:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 03:27:24,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:24,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:24,363 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:24,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1629371203, now seen corresponding path program 1 times [2018-12-02 03:27:24,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:24,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:24,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:24,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:24,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:24,447 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 03:27:24,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:24,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:27:24,448 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:24,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:27:24,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:27:24,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:27:24,449 INFO L87 Difference]: Start difference. First operand 10397 states and 25907 transitions. Second operand 6 states. [2018-12-02 03:27:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:24,745 INFO L93 Difference]: Finished difference Result 12148 states and 30164 transitions. [2018-12-02 03:27:24,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:27:24,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-02 03:27:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:24,754 INFO L225 Difference]: With dead ends: 12148 [2018-12-02 03:27:24,754 INFO L226 Difference]: Without dead ends: 12116 [2018-12-02 03:27:24,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 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 03:27:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12116 states. [2018-12-02 03:27:24,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12116 to 10429. [2018-12-02 03:27:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10429 states. [2018-12-02 03:27:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10429 states to 10429 states and 25987 transitions. [2018-12-02 03:27:24,843 INFO L78 Accepts]: Start accepts. Automaton has 10429 states and 25987 transitions. Word has length 109 [2018-12-02 03:27:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:24,843 INFO L480 AbstractCegarLoop]: Abstraction has 10429 states and 25987 transitions. [2018-12-02 03:27:24,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:27:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 10429 states and 25987 transitions. [2018-12-02 03:27:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 03:27:24,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:24,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:24,851 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:24,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:24,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1703982076, now seen corresponding path program 1 times [2018-12-02 03:27:24,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:24,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:24,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:24,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:24,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:24,913 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 03:27:24,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:24,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:27:24,914 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:24,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:27:24,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:27:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:27:24,914 INFO L87 Difference]: Start difference. First operand 10429 states and 25987 transitions. Second operand 7 states. [2018-12-02 03:27:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:25,260 INFO L93 Difference]: Finished difference Result 11875 states and 28495 transitions. [2018-12-02 03:27:25,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:27:25,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-02 03:27:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:25,268 INFO L225 Difference]: With dead ends: 11875 [2018-12-02 03:27:25,268 INFO L226 Difference]: Without dead ends: 11831 [2018-12-02 03:27:25,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 03:27:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11831 states. [2018-12-02 03:27:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11831 to 8829. [2018-12-02 03:27:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8829 states. [2018-12-02 03:27:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8829 states to 8829 states and 21662 transitions. [2018-12-02 03:27:25,341 INFO L78 Accepts]: Start accepts. Automaton has 8829 states and 21662 transitions. Word has length 109 [2018-12-02 03:27:25,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:25,342 INFO L480 AbstractCegarLoop]: Abstraction has 8829 states and 21662 transitions. [2018-12-02 03:27:25,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:27:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 8829 states and 21662 transitions. [2018-12-02 03:27:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 03:27:25,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:25,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:25,349 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:25,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash -129451834, now seen corresponding path program 1 times [2018-12-02 03:27:25,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:25,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:25,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:25,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:25,431 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 03:27:25,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:25,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:27:25,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:25,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:27:25,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:27:25,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:27:25,432 INFO L87 Difference]: Start difference. First operand 8829 states and 21662 transitions. Second operand 6 states. [2018-12-02 03:27:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:25,708 INFO L93 Difference]: Finished difference Result 11309 states and 27551 transitions. [2018-12-02 03:27:25,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:27:25,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-02 03:27:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:25,716 INFO L225 Difference]: With dead ends: 11309 [2018-12-02 03:27:25,716 INFO L226 Difference]: Without dead ends: 11254 [2018-12-02 03:27:25,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:27:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11254 states. [2018-12-02 03:27:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11254 to 9140. [2018-12-02 03:27:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9140 states. [2018-12-02 03:27:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9140 states to 9140 states and 22395 transitions. [2018-12-02 03:27:25,790 INFO L78 Accepts]: Start accepts. Automaton has 9140 states and 22395 transitions. Word has length 109 [2018-12-02 03:27:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:25,790 INFO L480 AbstractCegarLoop]: Abstraction has 9140 states and 22395 transitions. [2018-12-02 03:27:25,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:27:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 9140 states and 22395 transitions. [2018-12-02 03:27:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 03:27:25,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:25,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:25,796 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:25,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:25,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1036453381, now seen corresponding path program 1 times [2018-12-02 03:27:25,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:25,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:25,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:25,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:25,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:25,879 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 03:27:25,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:25,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:27:25,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:25,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:27:25,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:27:25,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:27:25,880 INFO L87 Difference]: Start difference. First operand 9140 states and 22395 transitions. Second operand 7 states. [2018-12-02 03:27:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:26,160 INFO L93 Difference]: Finished difference Result 11744 states and 28579 transitions. [2018-12-02 03:27:26,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 03:27:26,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-02 03:27:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:26,168 INFO L225 Difference]: With dead ends: 11744 [2018-12-02 03:27:26,168 INFO L226 Difference]: Without dead ends: 11712 [2018-12-02 03:27:26,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 03:27:26,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11712 states. [2018-12-02 03:27:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11712 to 9236. [2018-12-02 03:27:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9236 states. [2018-12-02 03:27:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9236 states to 9236 states and 22521 transitions. [2018-12-02 03:27:26,248 INFO L78 Accepts]: Start accepts. Automaton has 9236 states and 22521 transitions. Word has length 109 [2018-12-02 03:27:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:26,249 INFO L480 AbstractCegarLoop]: Abstraction has 9236 states and 22521 transitions. [2018-12-02 03:27:26,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:27:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 9236 states and 22521 transitions. [2018-12-02 03:27:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 03:27:26,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:26,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:26,255 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:26,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1052135417, now seen corresponding path program 1 times [2018-12-02 03:27:26,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:26,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:26,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:26,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:26,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:26,345 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 03:27:26,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:26,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:27:26,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:26,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:27:26,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:27:26,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:27:26,345 INFO L87 Difference]: Start difference. First operand 9236 states and 22521 transitions. Second operand 7 states. [2018-12-02 03:27:26,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:26,458 INFO L93 Difference]: Finished difference Result 14466 states and 35645 transitions. [2018-12-02 03:27:26,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:27:26,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-02 03:27:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:26,468 INFO L225 Difference]: With dead ends: 14466 [2018-12-02 03:27:26,468 INFO L226 Difference]: Without dead ends: 14466 [2018-12-02 03:27:26,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:27:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14466 states. [2018-12-02 03:27:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14466 to 10577. [2018-12-02 03:27:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10577 states. [2018-12-02 03:27:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10577 states to 10577 states and 25601 transitions. [2018-12-02 03:27:26,561 INFO L78 Accepts]: Start accepts. Automaton has 10577 states and 25601 transitions. Word has length 109 [2018-12-02 03:27:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:26,561 INFO L480 AbstractCegarLoop]: Abstraction has 10577 states and 25601 transitions. [2018-12-02 03:27:26,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:27:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10577 states and 25601 transitions. [2018-12-02 03:27:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 03:27:26,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:26,568 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:26,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:26,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1307171592, now seen corresponding path program 1 times [2018-12-02 03:27:26,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:26,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:26,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:26,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:26,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:26,619 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 03:27:26,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:26,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:27:26,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:26,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:27:26,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:27:26,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:27:26,620 INFO L87 Difference]: Start difference. First operand 10577 states and 25601 transitions. Second operand 5 states. [2018-12-02 03:27:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:26,653 INFO L93 Difference]: Finished difference Result 11861 states and 28767 transitions. [2018-12-02 03:27:26,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:27:26,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-12-02 03:27:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:26,662 INFO L225 Difference]: With dead ends: 11861 [2018-12-02 03:27:26,662 INFO L226 Difference]: Without dead ends: 11861 [2018-12-02 03:27:26,662 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 03:27:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2018-12-02 03:27:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 8083. [2018-12-02 03:27:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8083 states. [2018-12-02 03:27:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8083 states to 8083 states and 19148 transitions. [2018-12-02 03:27:26,734 INFO L78 Accepts]: Start accepts. Automaton has 8083 states and 19148 transitions. Word has length 109 [2018-12-02 03:27:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:26,734 INFO L480 AbstractCegarLoop]: Abstraction has 8083 states and 19148 transitions. [2018-12-02 03:27:26,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:27:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 8083 states and 19148 transitions. [2018-12-02 03:27:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 03:27:26,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:26,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:27:26,739 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:26,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:26,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1787888008, now seen corresponding path program 1 times [2018-12-02 03:27:26,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:26,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:26,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:26,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:26,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:26,828 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 03:27:26,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:26,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:27:26,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:26,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:27:26,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:27:26,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:27:26,829 INFO L87 Difference]: Start difference. First operand 8083 states and 19148 transitions. Second operand 6 states. [2018-12-02 03:27:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:26,947 INFO L93 Difference]: Finished difference Result 7779 states and 18180 transitions. [2018-12-02 03:27:26,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:27:26,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-02 03:27:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:26,953 INFO L225 Difference]: With dead ends: 7779 [2018-12-02 03:27:26,953 INFO L226 Difference]: Without dead ends: 7779 [2018-12-02 03:27:26,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:27:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7779 states. [2018-12-02 03:27:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7779 to 6548. [2018-12-02 03:27:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2018-12-02 03:27:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 15450 transitions. [2018-12-02 03:27:27,006 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 15450 transitions. Word has length 109 [2018-12-02 03:27:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:27,006 INFO L480 AbstractCegarLoop]: Abstraction has 6548 states and 15450 transitions. [2018-12-02 03:27:27,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:27:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 15450 transitions. [2018-12-02 03:27:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 03:27:27,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:27,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:27,011 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:27,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:27,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1513121926, now seen corresponding path program 1 times [2018-12-02 03:27:27,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:27,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:27,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:27,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:27,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:27,078 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 03:27:27,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:27,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:27:27,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:27,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 03:27:27,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:27:27,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:27:27,079 INFO L87 Difference]: Start difference. First operand 6548 states and 15450 transitions. Second operand 7 states. [2018-12-02 03:27:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:27,263 INFO L93 Difference]: Finished difference Result 9117 states and 20692 transitions. [2018-12-02 03:27:27,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 03:27:27,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-02 03:27:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:27,269 INFO L225 Difference]: With dead ends: 9117 [2018-12-02 03:27:27,269 INFO L226 Difference]: Without dead ends: 9117 [2018-12-02 03:27:27,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:27:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9117 states. [2018-12-02 03:27:27,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9117 to 7435. [2018-12-02 03:27:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7435 states. [2018-12-02 03:27:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 17305 transitions. [2018-12-02 03:27:27,325 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 17305 transitions. Word has length 111 [2018-12-02 03:27:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:27,325 INFO L480 AbstractCegarLoop]: Abstraction has 7435 states and 17305 transitions. [2018-12-02 03:27:27,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 03:27:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 17305 transitions. [2018-12-02 03:27:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 03:27:27,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:27,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:27,330 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:27,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1961818565, now seen corresponding path program 1 times [2018-12-02 03:27:27,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:27,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:27,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:27,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:27,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:27,370 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 03:27:27,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:27,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:27:27,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:27,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:27:27,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:27:27,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:27:27,371 INFO L87 Difference]: Start difference. First operand 7435 states and 17305 transitions. Second operand 5 states. [2018-12-02 03:27:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:27,496 INFO L93 Difference]: Finished difference Result 7787 states and 18169 transitions. [2018-12-02 03:27:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:27:27,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 03:27:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:27,503 INFO L225 Difference]: With dead ends: 7787 [2018-12-02 03:27:27,503 INFO L226 Difference]: Without dead ends: 7755 [2018-12-02 03:27:27,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:27:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2018-12-02 03:27:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7251. [2018-12-02 03:27:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7251 states. [2018-12-02 03:27:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7251 states to 7251 states and 16846 transitions. [2018-12-02 03:27:27,554 INFO L78 Accepts]: Start accepts. Automaton has 7251 states and 16846 transitions. Word has length 111 [2018-12-02 03:27:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:27,554 INFO L480 AbstractCegarLoop]: Abstraction has 7251 states and 16846 transitions. [2018-12-02 03:27:27,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:27:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 7251 states and 16846 transitions. [2018-12-02 03:27:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 03:27:27,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:27,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:27,559 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:27,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:27,559 INFO L82 PathProgramCache]: Analyzing trace with hash -717054084, now seen corresponding path program 1 times [2018-12-02 03:27:27,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:27,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:27,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:27,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:27,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:27,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 03:27:27,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:27,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:27:27,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:27,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:27:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:27:27,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:27:27,598 INFO L87 Difference]: Start difference. First operand 7251 states and 16846 transitions. Second operand 5 states. [2018-12-02 03:27:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:27,782 INFO L93 Difference]: Finished difference Result 8840 states and 20257 transitions. [2018-12-02 03:27:27,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:27:27,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 03:27:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:27,788 INFO L225 Difference]: With dead ends: 8840 [2018-12-02 03:27:27,788 INFO L226 Difference]: Without dead ends: 8840 [2018-12-02 03:27:27,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 03:27:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8840 states. [2018-12-02 03:27:27,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8840 to 6817. [2018-12-02 03:27:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6817 states. [2018-12-02 03:27:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6817 states to 6817 states and 15822 transitions. [2018-12-02 03:27:27,839 INFO L78 Accepts]: Start accepts. Automaton has 6817 states and 15822 transitions. Word has length 111 [2018-12-02 03:27:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:27,839 INFO L480 AbstractCegarLoop]: Abstraction has 6817 states and 15822 transitions. [2018-12-02 03:27:27,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:27:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 6817 states and 15822 transitions. [2018-12-02 03:27:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 03:27:27,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:27,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:27,844 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:27,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:27,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1644796127, now seen corresponding path program 1 times [2018-12-02 03:27:27,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:27,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:27,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:27,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:27,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:27:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:27:27,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:27:27,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 03:27:27,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:27:27,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 03:27:27,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 03:27:27,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:27:27,925 INFO L87 Difference]: Start difference. First operand 6817 states and 15822 transitions. Second operand 9 states. [2018-12-02 03:27:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:27:28,026 INFO L93 Difference]: Finished difference Result 9241 states and 21983 transitions. [2018-12-02 03:27:28,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 03:27:28,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2018-12-02 03:27:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:27:28,028 INFO L225 Difference]: With dead ends: 9241 [2018-12-02 03:27:28,028 INFO L226 Difference]: Without dead ends: 2668 [2018-12-02 03:27:28,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 03:27:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-12-02 03:27:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2018-12-02 03:27:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2668 states. [2018-12-02 03:27:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 6580 transitions. [2018-12-02 03:27:28,045 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 6580 transitions. Word has length 113 [2018-12-02 03:27:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:27:28,045 INFO L480 AbstractCegarLoop]: Abstraction has 2668 states and 6580 transitions. [2018-12-02 03:27:28,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 03:27:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 6580 transitions. [2018-12-02 03:27:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 03:27:28,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:27:28,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:27:28,047 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:27:28,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:27:28,047 INFO L82 PathProgramCache]: Analyzing trace with hash -693188625, now seen corresponding path program 2 times [2018-12-02 03:27:28,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:27:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:28,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:27:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:27:28,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:27:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:27:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:27:28,091 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 03:27:28,164 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 03:27:28,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:27:28 BasicIcfg [2018-12-02 03:27:28,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 03:27:28,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:27:28,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:27:28,166 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:27:28,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:26:58" (3/4) ... [2018-12-02 03:27:28,168 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 03:27:28,240 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4c4fa01c-bf1c-4bda-908b-078cdfa498cc/bin-2019/utaipan/witness.graphml [2018-12-02 03:27:28,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:27:28,241 INFO L168 Benchmark]: Toolchain (without parser) took 30273.24 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 947.0 MB in the beginning and 1.6 GB in the end (delta: -617.7 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-02 03:27:28,241 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:27:28,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-02 03:27:28,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 03:27:28,242 INFO L168 Benchmark]: Boogie Preprocessor took 22.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:27:28,242 INFO L168 Benchmark]: RCFGBuilder took 366.93 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: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2018-12-02 03:27:28,242 INFO L168 Benchmark]: TraceAbstraction took 29433.08 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -590.2 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-02 03:27:28,242 INFO L168 Benchmark]: Witness Printer took 74.40 ms. Allocated memory is still 4.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2018-12-02 03:27:28,243 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 366.93 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: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29433.08 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -590.2 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 74.40 ms. Allocated memory is still 4.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 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] [L696] -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] [L697] -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] [L773] -1 pthread_t t599; 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] [L774] FCALL, FORK -1 pthread_create(&t599, ((void *)0), P0, ((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=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] [L775] -1 pthread_t t600; 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=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] [L776] FCALL, FORK -1 pthread_create(&t600, ((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=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] [L721] 0 x$w_buff1 = x$w_buff0 [L722] 0 x$w_buff0 = 2 [L723] 0 x$w_buff1_used = x$w_buff0_used [L724] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L727] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L728] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L729] 0 x$r_buff0_thd2 = (_Bool)1 [L732] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 0 x$flush_delayed = weak$$choice2 [L735] 0 x$mem_tmp = x 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=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] EXPR 0 !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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 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=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] EXPR 0 !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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 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) [L737] EXPR 0 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=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 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)) [L738] EXPR 0 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=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 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)) [L739] EXPR 0 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=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 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)) [L740] EXPR 0 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=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 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)) [L741] EXPR 0 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=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L741] 0 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)) [L742] EXPR 0 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=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L742] 0 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)) [L743] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 0 x = x$flush_delayed ? x$mem_tmp : x [L745] 0 x$flush_delayed = (_Bool)0 [L748] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] 1 y = 1 [L704] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] EXPR 1 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=2, __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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L707] EXPR 1 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=2, __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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L707] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 0 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=2, __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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L751] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L752] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 0 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=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L753] 0 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 [L754] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L755] EXPR 0 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=0, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L755] 0 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 [L758] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] EXPR 1 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=1, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] 1 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 [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L710] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L711] EXPR 1 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=1, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L711] 1 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 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 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=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 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=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] -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) [L783] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L784] 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=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] -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 [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L786] 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=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] -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 [L789] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L790] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L791] -1 x$flush_delayed = weak$$choice2 [L792] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L794] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L795] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L796] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L797] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L798] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L799] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L800] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] -1 x = x$flush_delayed ? x$mem_tmp : x [L802] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 264 locations, 3 error locations. UNSAFE Result, 29.3s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10683 SDtfs, 10446 SDslu, 22049 SDs, 0 SdLazy, 9776 SolverSat, 529 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 72 SyntacticMatches, 27 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109739occurred in iteration=2, 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.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 222480 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2803 NumberOfCodeBlocks, 2803 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2661 ConstructedInterpolants, 0 QuantifiedInterpolants, 575234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...