./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_pso.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_e1042053-21ff-4704-a572-47980d9467ed/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/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 f0e9abc953cd782ca10fbe0e8a4add6cfebaae52 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-03 02:26:59,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:26:59,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:26:59,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:26:59,009 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:26:59,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:26:59,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:26:59,011 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:26:59,012 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:26:59,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:26:59,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:26:59,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:26:59,014 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:26:59,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:26:59,015 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:26:59,016 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:26:59,016 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:26:59,017 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:26:59,019 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:26:59,020 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:26:59,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:26:59,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:26:59,022 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:26:59,023 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:26:59,023 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:26:59,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:26:59,024 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:26:59,025 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:26:59,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:26:59,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:26:59,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:26:59,027 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:26:59,027 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:26:59,027 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:26:59,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:26:59,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:26:59,028 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 02:26:59,035 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:26:59,035 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:26:59,036 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:26:59,036 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:26:59,036 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:26:59,036 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:26:59,036 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:26:59,036 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:26:59,037 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:26:59,037 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:26:59,037 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:26:59,037 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:26:59,037 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:26:59,037 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:26:59,037 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:26:59,037 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:26:59,037 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:26:59,038 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:26:59,038 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 02:26:59,038 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:26:59,038 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 02:26:59,038 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:26:59,038 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 02:26:59,038 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 02:26:59,038 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:26:59,038 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:26:59,038 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:26:59,038 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:26:59,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:26:59,039 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:26:59,039 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:26:59,039 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 02:26:59,039 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:26:59,039 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:26:59,039 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:26:59,039 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 02:26:59,039 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_e1042053-21ff-4704-a572-47980d9467ed/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 -> f0e9abc953cd782ca10fbe0e8a4add6cfebaae52 [2018-12-03 02:26:59,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:26:59,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:26:59,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:26:59,065 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:26:59,065 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:26:59,065 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe034_pso.oepc_false-unreach-call.i [2018-12-03 02:26:59,100 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/bin-2019/utaipan/data/f613a7e77/972961dd6c3d4bcd9d798fa5c39f692e/FLAGf03999567 [2018-12-03 02:26:59,517 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:26:59,518 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/sv-benchmarks/c/pthread-wmm/safe034_pso.oepc_false-unreach-call.i [2018-12-03 02:26:59,524 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/bin-2019/utaipan/data/f613a7e77/972961dd6c3d4bcd9d798fa5c39f692e/FLAGf03999567 [2018-12-03 02:26:59,534 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/bin-2019/utaipan/data/f613a7e77/972961dd6c3d4bcd9d798fa5c39f692e [2018-12-03 02:26:59,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:26:59,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:26:59,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:26:59,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:26:59,541 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:26:59,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:26:59" (1/1) ... [2018-12-03 02:26:59,543 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 03.12 02:26:59, skipping insertion in model container [2018-12-03 02:26:59,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:26:59" (1/1) ... [2018-12-03 02:26:59,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:26:59,574 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:26:59,761 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:26:59,769 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:26:59,853 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:26:59,888 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:26:59,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59 WrapperNode [2018-12-03 02:26:59,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:26:59,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:26:59,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:26:59,889 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:26:59,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59" (1/1) ... [2018-12-03 02:26:59,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59" (1/1) ... [2018-12-03 02:26:59,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:26:59,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:26:59,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:26:59,928 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:26:59,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59" (1/1) ... [2018-12-03 02:26:59,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59" (1/1) ... [2018-12-03 02:26:59,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59" (1/1) ... [2018-12-03 02:26:59,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59" (1/1) ... [2018-12-03 02:26:59,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59" (1/1) ... [2018-12-03 02:26:59,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59" (1/1) ... [2018-12-03 02:26:59,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59" (1/1) ... [2018-12-03 02:26:59,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:26:59,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:26:59,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:26:59,947 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:26:59,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/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-03 02:26:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 02:26:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 02:26:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 02:26:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 02:26:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 02:26:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 02:26:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 02:26:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 02:26:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-03 02:26:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-03 02:26:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 02:26:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:26:59,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:26:59,980 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 02:27:00,264 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:27:00,264 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 02:27:00,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:27:00 BoogieIcfgContainer [2018-12-03 02:27:00,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:27:00,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:27:00,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:27:00,267 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:27:00,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:26:59" (1/3) ... [2018-12-03 02:27:00,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2605a00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:27:00, skipping insertion in model container [2018-12-03 02:27:00,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:26:59" (2/3) ... [2018-12-03 02:27:00,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2605a00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:27:00, skipping insertion in model container [2018-12-03 02:27:00,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:27:00" (3/3) ... [2018-12-03 02:27:00,269 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_pso.oepc_false-unreach-call.i [2018-12-03 02:27:00,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,292 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,292 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,293 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,294 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,302 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,302 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,303 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,303 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,303 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,303 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,303 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,303 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,303 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,303 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,303 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,303 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,303 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,304 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,304 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,304 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,304 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,304 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,304 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,304 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,304 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,304 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,304 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,304 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,305 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,306 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,306 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:27:00,310 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 02:27:00,310 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:27:00,315 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 02:27:00,324 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 02:27:00,340 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:27:00,340 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 02:27:00,340 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:27:00,340 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:27:00,340 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:27:00,340 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:27:00,340 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:27:00,340 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:27:00,347 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 175 transitions [2018-12-03 02:27:19,800 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149043 states. [2018-12-03 02:27:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 149043 states. [2018-12-03 02:27:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 02:27:19,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:27:19,809 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-03 02:27:19,811 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:27:19,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:27:19,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1284724798, now seen corresponding path program 1 times [2018-12-03 02:27:19,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:27:19,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:27:19,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:27:19,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:27:19,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:27:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:27:19,982 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-03 02:27:19,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:27:19,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:27:19,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:27:19,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:27:19,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:27:19,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:27:19,997 INFO L87 Difference]: Start difference. First operand 149043 states. Second operand 4 states. [2018-12-03 02:27:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:27:21,375 INFO L93 Difference]: Finished difference Result 257063 states and 1188602 transitions. [2018-12-03 02:27:21,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:27:21,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-03 02:27:21,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:27:24,018 INFO L225 Difference]: With dead ends: 257063 [2018-12-03 02:27:24,018 INFO L226 Difference]: Without dead ends: 174813 [2018-12-03 02:27:24,019 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-03 02:27:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174813 states. [2018-12-03 02:27:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174813 to 110553. [2018-12-03 02:27:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2018-12-03 02:27:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511484 transitions. [2018-12-03 02:27:27,054 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511484 transitions. Word has length 44 [2018-12-03 02:27:27,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:27:27,055 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511484 transitions. [2018-12-03 02:27:27,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:27:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511484 transitions. [2018-12-03 02:27:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 02:27:27,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:27:27,067 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] [2018-12-03 02:27:27,067 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:27:27,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:27:27,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1885719038, now seen corresponding path program 1 times [2018-12-03 02:27:27,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:27:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:27:27,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:27:27,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:27:27,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:27:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:27:27,123 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-03 02:27:27,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:27:27,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:27:27,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:27:27,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:27:27,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:27:27,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:27:27,125 INFO L87 Difference]: Start difference. First operand 110553 states and 511484 transitions. Second operand 5 states. [2018-12-03 02:27:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:27:28,387 INFO L93 Difference]: Finished difference Result 240603 states and 1068739 transitions. [2018-12-03 02:27:28,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:27:28,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-03 02:27:28,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:27:29,079 INFO L225 Difference]: With dead ends: 240603 [2018-12-03 02:27:29,079 INFO L226 Difference]: Without dead ends: 237053 [2018-12-03 02:27:29,080 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-03 02:27:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237053 states. [2018-12-03 02:27:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237053 to 160433. [2018-12-03 02:27:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160433 states. [2018-12-03 02:27:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160433 states to 160433 states and 716928 transitions. [2018-12-03 02:27:35,123 INFO L78 Accepts]: Start accepts. Automaton has 160433 states and 716928 transitions. Word has length 52 [2018-12-03 02:27:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:27:35,123 INFO L480 AbstractCegarLoop]: Abstraction has 160433 states and 716928 transitions. [2018-12-03 02:27:35,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:27:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 160433 states and 716928 transitions. [2018-12-03 02:27:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 02:27:35,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:27:35,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:27:35,132 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:27:35,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:27:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1570820033, now seen corresponding path program 1 times [2018-12-03 02:27:35,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:27:35,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:27:35,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:27:35,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:27:35,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:27:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:27:35,181 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-03 02:27:35,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:27:35,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:27:35,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:27:35,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:27:35,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:27:35,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:27:35,182 INFO L87 Difference]: Start difference. First operand 160433 states and 716928 transitions. Second operand 5 states. [2018-12-03 02:27:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:27:36,774 INFO L93 Difference]: Finished difference Result 317173 states and 1405285 transitions. [2018-12-03 02:27:36,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:27:36,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-03 02:27:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:27:37,666 INFO L225 Difference]: With dead ends: 317173 [2018-12-03 02:27:37,666 INFO L226 Difference]: Without dead ends: 314273 [2018-12-03 02:27:37,667 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-03 02:27:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314273 states. [2018-12-03 02:27:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314273 to 178273. [2018-12-03 02:27:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178273 states. [2018-12-03 02:27:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178273 states to 178273 states and 791490 transitions. [2018-12-03 02:27:42,835 INFO L78 Accepts]: Start accepts. Automaton has 178273 states and 791490 transitions. Word has length 53 [2018-12-03 02:27:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:27:42,835 INFO L480 AbstractCegarLoop]: Abstraction has 178273 states and 791490 transitions. [2018-12-03 02:27:42,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:27:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 178273 states and 791490 transitions. [2018-12-03 02:27:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 02:27:42,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:27:42,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:27:42,849 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:27:42,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:27:42,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2068992963, now seen corresponding path program 1 times [2018-12-03 02:27:42,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:27:42,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:27:42,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:27:42,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:27:42,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:27:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:27:42,881 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-03 02:27:42,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:27:42,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:27:42,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:27:42,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:27:42,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:27:42,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:27:42,882 INFO L87 Difference]: Start difference. First operand 178273 states and 791490 transitions. Second operand 3 states. [2018-12-03 02:27:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:27:46,083 INFO L93 Difference]: Finished difference Result 231653 states and 1011274 transitions. [2018-12-03 02:27:46,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:27:46,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-03 02:27:46,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:27:46,679 INFO L225 Difference]: With dead ends: 231653 [2018-12-03 02:27:46,679 INFO L226 Difference]: Without dead ends: 231653 [2018-12-03 02:27:46,680 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-03 02:27:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231653 states. [2018-12-03 02:27:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231653 to 202938. [2018-12-03 02:27:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202938 states. [2018-12-03 02:27:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202938 states to 202938 states and 893562 transitions. [2018-12-03 02:27:50,962 INFO L78 Accepts]: Start accepts. Automaton has 202938 states and 893562 transitions. Word has length 55 [2018-12-03 02:27:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:27:50,963 INFO L480 AbstractCegarLoop]: Abstraction has 202938 states and 893562 transitions. [2018-12-03 02:27:50,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:27:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 202938 states and 893562 transitions. [2018-12-03 02:27:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:27:50,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:27:50,994 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] [2018-12-03 02:27:50,994 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:27:50,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:27:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash -43565154, now seen corresponding path program 1 times [2018-12-03 02:27:50,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:27:50,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:27:50,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:27:50,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:27:50,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:27:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:27:51,047 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-03 02:27:51,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:27:51,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:27:51,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:27:51,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:27:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:27:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:27:51,048 INFO L87 Difference]: Start difference. First operand 202938 states and 893562 transitions. Second operand 6 states. [2018-12-03 02:27:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:27:53,268 INFO L93 Difference]: Finished difference Result 356173 states and 1552270 transitions. [2018-12-03 02:27:53,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:27:53,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-03 02:27:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:27:54,205 INFO L225 Difference]: With dead ends: 356173 [2018-12-03 02:27:54,205 INFO L226 Difference]: Without dead ends: 352823 [2018-12-03 02:27:54,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:27:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352823 states. [2018-12-03 02:28:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352823 to 205743. [2018-12-03 02:28:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205743 states. [2018-12-03 02:28:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205743 states to 205743 states and 906781 transitions. [2018-12-03 02:28:02,360 INFO L78 Accepts]: Start accepts. Automaton has 205743 states and 906781 transitions. Word has length 59 [2018-12-03 02:28:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:02,361 INFO L480 AbstractCegarLoop]: Abstraction has 205743 states and 906781 transitions. [2018-12-03 02:28:02,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:28:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 205743 states and 906781 transitions. [2018-12-03 02:28:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:28:02,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:02,393 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] [2018-12-03 02:28:02,393 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:02,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:02,393 INFO L82 PathProgramCache]: Analyzing trace with hash 396603386, now seen corresponding path program 1 times [2018-12-03 02:28:02,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:02,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:02,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:02,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:02,418 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-03 02:28:02,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:02,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:28:02,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:02,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:28:02,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:28:02,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:28:02,419 INFO L87 Difference]: Start difference. First operand 205743 states and 906781 transitions. Second operand 3 states. [2018-12-03 02:28:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:03,874 INFO L93 Difference]: Finished difference Result 227888 states and 1004312 transitions. [2018-12-03 02:28:03,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:28:03,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-03 02:28:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:04,473 INFO L225 Difference]: With dead ends: 227888 [2018-12-03 02:28:04,473 INFO L226 Difference]: Without dead ends: 227888 [2018-12-03 02:28:04,474 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-03 02:28:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227888 states. [2018-12-03 02:28:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227888 to 216543. [2018-12-03 02:28:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216543 states. [2018-12-03 02:28:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216543 states to 216543 states and 954421 transitions. [2018-12-03 02:28:09,192 INFO L78 Accepts]: Start accepts. Automaton has 216543 states and 954421 transitions. Word has length 59 [2018-12-03 02:28:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:09,192 INFO L480 AbstractCegarLoop]: Abstraction has 216543 states and 954421 transitions. [2018-12-03 02:28:09,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:28:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 216543 states and 954421 transitions. [2018-12-03 02:28:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:28:09,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:09,223 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] [2018-12-03 02:28:09,223 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:09,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:09,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1117448070, now seen corresponding path program 1 times [2018-12-03 02:28:09,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:09,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:09,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:09,285 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-03 02:28:09,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:09,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:28:09,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:09,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:28:09,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:28:09,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:28:09,286 INFO L87 Difference]: Start difference. First operand 216543 states and 954421 transitions. Second operand 6 states. [2018-12-03 02:28:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:12,753 INFO L93 Difference]: Finished difference Result 292218 states and 1274191 transitions. [2018-12-03 02:28:12,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:28:12,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-03 02:28:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:13,534 INFO L225 Difference]: With dead ends: 292218 [2018-12-03 02:28:13,535 INFO L226 Difference]: Without dead ends: 286523 [2018-12-03 02:28:13,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:28:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286523 states. [2018-12-03 02:28:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286523 to 261028. [2018-12-03 02:28:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261028 states. [2018-12-03 02:28:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261028 states to 261028 states and 1142704 transitions. [2018-12-03 02:28:19,173 INFO L78 Accepts]: Start accepts. Automaton has 261028 states and 1142704 transitions. Word has length 59 [2018-12-03 02:28:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:19,174 INFO L480 AbstractCegarLoop]: Abstraction has 261028 states and 1142704 transitions. [2018-12-03 02:28:19,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:28:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 261028 states and 1142704 transitions. [2018-12-03 02:28:19,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:28:19,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:19,211 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] [2018-12-03 02:28:19,211 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:19,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:19,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1380567867, now seen corresponding path program 1 times [2018-12-03 02:28:19,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:19,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:19,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:19,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:19,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:19,263 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-03 02:28:19,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:19,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:28:19,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:19,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:28:19,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:28:19,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:28:19,264 INFO L87 Difference]: Start difference. First operand 261028 states and 1142704 transitions. Second operand 7 states. [2018-12-03 02:28:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:21,683 INFO L93 Difference]: Finished difference Result 379443 states and 1607921 transitions. [2018-12-03 02:28:21,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 02:28:21,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-03 02:28:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:22,661 INFO L225 Difference]: With dead ends: 379443 [2018-12-03 02:28:22,661 INFO L226 Difference]: Without dead ends: 379443 [2018-12-03 02:28:22,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:28:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379443 states. [2018-12-03 02:28:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379443 to 308618. [2018-12-03 02:28:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308618 states. [2018-12-03 02:28:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308618 states to 308618 states and 1326661 transitions. [2018-12-03 02:28:32,262 INFO L78 Accepts]: Start accepts. Automaton has 308618 states and 1326661 transitions. Word has length 59 [2018-12-03 02:28:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:32,262 INFO L480 AbstractCegarLoop]: Abstraction has 308618 states and 1326661 transitions. [2018-12-03 02:28:32,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:28:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 308618 states and 1326661 transitions. [2018-12-03 02:28:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:28:32,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:32,303 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] [2018-12-03 02:28:32,303 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:32,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:32,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2026895748, now seen corresponding path program 1 times [2018-12-03 02:28:32,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:32,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:32,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:32,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:32,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:32,336 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-03 02:28:32,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:32,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:28:32,337 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:32,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:28:32,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:28:32,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:28:32,337 INFO L87 Difference]: Start difference. First operand 308618 states and 1326661 transitions. Second operand 4 states. [2018-12-03 02:28:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:34,006 INFO L93 Difference]: Finished difference Result 267151 states and 1127019 transitions. [2018-12-03 02:28:34,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:28:34,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-03 02:28:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:34,688 INFO L225 Difference]: With dead ends: 267151 [2018-12-03 02:28:34,688 INFO L226 Difference]: Without dead ends: 259066 [2018-12-03 02:28:34,688 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-03 02:28:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259066 states. [2018-12-03 02:28:39,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259066 to 259066. [2018-12-03 02:28:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259066 states. [2018-12-03 02:28:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259066 states to 259066 states and 1099297 transitions. [2018-12-03 02:28:44,755 INFO L78 Accepts]: Start accepts. Automaton has 259066 states and 1099297 transitions. Word has length 59 [2018-12-03 02:28:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:44,755 INFO L480 AbstractCegarLoop]: Abstraction has 259066 states and 1099297 transitions. [2018-12-03 02:28:44,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:28:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 259066 states and 1099297 transitions. [2018-12-03 02:28:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 02:28:44,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:44,791 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] [2018-12-03 02:28:44,791 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:44,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1169735306, now seen corresponding path program 1 times [2018-12-03 02:28:44,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:44,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:44,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:44,832 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-03 02:28:44,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:44,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:28:44,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:44,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:28:44,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:28:44,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:28:44,833 INFO L87 Difference]: Start difference. First operand 259066 states and 1099297 transitions. Second operand 5 states. [2018-12-03 02:28:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:45,064 INFO L93 Difference]: Finished difference Result 57898 states and 224521 transitions. [2018-12-03 02:28:45,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:28:45,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-12-03 02:28:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:45,166 INFO L225 Difference]: With dead ends: 57898 [2018-12-03 02:28:45,167 INFO L226 Difference]: Without dead ends: 50982 [2018-12-03 02:28:45,167 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-03 02:28:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50982 states. [2018-12-03 02:28:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50982 to 50742. [2018-12-03 02:28:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50742 states. [2018-12-03 02:28:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50742 states to 50742 states and 196308 transitions. [2018-12-03 02:28:45,886 INFO L78 Accepts]: Start accepts. Automaton has 50742 states and 196308 transitions. Word has length 60 [2018-12-03 02:28:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:45,886 INFO L480 AbstractCegarLoop]: Abstraction has 50742 states and 196308 transitions. [2018-12-03 02:28:45,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:28:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 50742 states and 196308 transitions. [2018-12-03 02:28:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 02:28:45,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:45,902 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] [2018-12-03 02:28:45,902 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:45,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:45,902 INFO L82 PathProgramCache]: Analyzing trace with hash -41019099, now seen corresponding path program 1 times [2018-12-03 02:28:45,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:45,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:45,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:45,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:45,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:45,953 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-03 02:28:45,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:45,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:28:45,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:45,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:28:45,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:28:45,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:28:45,954 INFO L87 Difference]: Start difference. First operand 50742 states and 196308 transitions. Second operand 4 states. [2018-12-03 02:28:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:46,389 INFO L93 Difference]: Finished difference Result 59861 states and 230927 transitions. [2018-12-03 02:28:46,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:28:46,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-03 02:28:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:46,508 INFO L225 Difference]: With dead ends: 59861 [2018-12-03 02:28:46,508 INFO L226 Difference]: Without dead ends: 59861 [2018-12-03 02:28:46,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:28:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59861 states. [2018-12-03 02:28:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59861 to 53957. [2018-12-03 02:28:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53957 states. [2018-12-03 02:28:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53957 states to 53957 states and 208375 transitions. [2018-12-03 02:28:47,278 INFO L78 Accepts]: Start accepts. Automaton has 53957 states and 208375 transitions. Word has length 70 [2018-12-03 02:28:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:47,278 INFO L480 AbstractCegarLoop]: Abstraction has 53957 states and 208375 transitions. [2018-12-03 02:28:47,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:28:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 53957 states and 208375 transitions. [2018-12-03 02:28:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 02:28:47,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:47,295 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] [2018-12-03 02:28:47,295 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:47,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1701791236, now seen corresponding path program 1 times [2018-12-03 02:28:47,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:47,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:47,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:47,339 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-03 02:28:47,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:47,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:28:47,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:47,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:28:47,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:28:47,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:28:47,340 INFO L87 Difference]: Start difference. First operand 53957 states and 208375 transitions. Second operand 6 states. [2018-12-03 02:28:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:47,407 INFO L93 Difference]: Finished difference Result 14405 states and 48007 transitions. [2018-12-03 02:28:47,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:28:47,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-03 02:28:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:47,421 INFO L225 Difference]: With dead ends: 14405 [2018-12-03 02:28:47,422 INFO L226 Difference]: Without dead ends: 12149 [2018-12-03 02:28:47,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:28:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2018-12-03 02:28:47,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11559. [2018-12-03 02:28:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11559 states. [2018-12-03 02:28:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11559 states to 11559 states and 37959 transitions. [2018-12-03 02:28:47,538 INFO L78 Accepts]: Start accepts. Automaton has 11559 states and 37959 transitions. Word has length 70 [2018-12-03 02:28:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:47,539 INFO L480 AbstractCegarLoop]: Abstraction has 11559 states and 37959 transitions. [2018-12-03 02:28:47,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:28:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 11559 states and 37959 transitions. [2018-12-03 02:28:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:28:47,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:47,548 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] [2018-12-03 02:28:47,549 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:47,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:47,549 INFO L82 PathProgramCache]: Analyzing trace with hash -936811932, now seen corresponding path program 1 times [2018-12-03 02:28:47,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:47,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:47,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:47,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:47,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:47,602 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-03 02:28:47,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:47,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:28:47,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:47,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:28:47,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:28:47,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:28:47,603 INFO L87 Difference]: Start difference. First operand 11559 states and 37959 transitions. Second operand 5 states. [2018-12-03 02:28:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:47,775 INFO L93 Difference]: Finished difference Result 17768 states and 56955 transitions. [2018-12-03 02:28:47,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:28:47,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-03 02:28:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:47,795 INFO L225 Difference]: With dead ends: 17768 [2018-12-03 02:28:47,795 INFO L226 Difference]: Without dead ends: 17768 [2018-12-03 02:28:47,795 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-03 02:28:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17768 states. [2018-12-03 02:28:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17768 to 14546. [2018-12-03 02:28:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14546 states. [2018-12-03 02:28:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14546 states to 14546 states and 46978 transitions. [2018-12-03 02:28:47,953 INFO L78 Accepts]: Start accepts. Automaton has 14546 states and 46978 transitions. Word has length 89 [2018-12-03 02:28:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:47,953 INFO L480 AbstractCegarLoop]: Abstraction has 14546 states and 46978 transitions. [2018-12-03 02:28:47,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:28:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 14546 states and 46978 transitions. [2018-12-03 02:28:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:28:47,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:47,966 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] [2018-12-03 02:28:47,966 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:47,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash 769113658, now seen corresponding path program 2 times [2018-12-03 02:28:47,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:47,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:47,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:47,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:47,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:47,994 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-03 02:28:47,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:47,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:28:47,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:47,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:28:47,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:28:47,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:28:47,995 INFO L87 Difference]: Start difference. First operand 14546 states and 46978 transitions. Second operand 3 states. [2018-12-03 02:28:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:48,211 INFO L93 Difference]: Finished difference Result 15656 states and 50431 transitions. [2018-12-03 02:28:48,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:28:48,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-03 02:28:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:48,227 INFO L225 Difference]: With dead ends: 15656 [2018-12-03 02:28:48,227 INFO L226 Difference]: Without dead ends: 15656 [2018-12-03 02:28:48,228 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-03 02:28:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15656 states. [2018-12-03 02:28:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15656 to 15156. [2018-12-03 02:28:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15156 states. [2018-12-03 02:28:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15156 states to 15156 states and 48886 transitions. [2018-12-03 02:28:48,383 INFO L78 Accepts]: Start accepts. Automaton has 15156 states and 48886 transitions. Word has length 89 [2018-12-03 02:28:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:48,383 INFO L480 AbstractCegarLoop]: Abstraction has 15156 states and 48886 transitions. [2018-12-03 02:28:48,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:28:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 15156 states and 48886 transitions. [2018-12-03 02:28:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:28:48,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:48,397 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] [2018-12-03 02:28:48,397 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:48,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:48,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1692086630, now seen corresponding path program 3 times [2018-12-03 02:28:48,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:48,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:48,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:28:48,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:48,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:48,488 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-03 02:28:48,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:48,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:28:48,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:48,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:28:48,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:28:48,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:28:48,489 INFO L87 Difference]: Start difference. First operand 15156 states and 48886 transitions. Second operand 6 states. [2018-12-03 02:28:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:48,686 INFO L93 Difference]: Finished difference Result 22001 states and 70567 transitions. [2018-12-03 02:28:48,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:28:48,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-03 02:28:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:48,710 INFO L225 Difference]: With dead ends: 22001 [2018-12-03 02:28:48,710 INFO L226 Difference]: Without dead ends: 21873 [2018-12-03 02:28:48,710 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-03 02:28:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21873 states. [2018-12-03 02:28:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21873 to 18726. [2018-12-03 02:28:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18726 states. [2018-12-03 02:28:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18726 states to 18726 states and 60333 transitions. [2018-12-03 02:28:48,917 INFO L78 Accepts]: Start accepts. Automaton has 18726 states and 60333 transitions. Word has length 89 [2018-12-03 02:28:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:48,917 INFO L480 AbstractCegarLoop]: Abstraction has 18726 states and 60333 transitions. [2018-12-03 02:28:48,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:28:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 18726 states and 60333 transitions. [2018-12-03 02:28:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:28:48,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:48,934 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] [2018-12-03 02:28:48,934 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:48,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash -104864729, now seen corresponding path program 1 times [2018-12-03 02:28:48,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:48,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:28:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:48,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:49,003 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-03 02:28:49,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:49,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:28:49,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:49,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:28:49,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:28:49,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:28:49,004 INFO L87 Difference]: Start difference. First operand 18726 states and 60333 transitions. Second operand 7 states. [2018-12-03 02:28:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:49,518 INFO L93 Difference]: Finished difference Result 34495 states and 111647 transitions. [2018-12-03 02:28:49,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:28:49,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-03 02:28:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:49,562 INFO L225 Difference]: With dead ends: 34495 [2018-12-03 02:28:49,562 INFO L226 Difference]: Without dead ends: 34495 [2018-12-03 02:28:49,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:28:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34495 states. [2018-12-03 02:28:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34495 to 22644. [2018-12-03 02:28:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22644 states. [2018-12-03 02:28:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22644 states to 22644 states and 73466 transitions. [2018-12-03 02:28:49,877 INFO L78 Accepts]: Start accepts. Automaton has 22644 states and 73466 transitions. Word has length 89 [2018-12-03 02:28:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:49,878 INFO L480 AbstractCegarLoop]: Abstraction has 22644 states and 73466 transitions. [2018-12-03 02:28:49,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:28:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 22644 states and 73466 transitions. [2018-12-03 02:28:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:28:49,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:49,900 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] [2018-12-03 02:28:49,900 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:49,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:49,901 INFO L82 PathProgramCache]: Analyzing trace with hash 782638952, now seen corresponding path program 1 times [2018-12-03 02:28:49,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:49,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:49,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:49,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:49,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:49,980 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-03 02:28:49,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:49,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:28:49,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:49,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:28:49,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:28:49,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:28:49,981 INFO L87 Difference]: Start difference. First operand 22644 states and 73466 transitions. Second operand 6 states. [2018-12-03 02:28:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:50,270 INFO L93 Difference]: Finished difference Result 23712 states and 76203 transitions. [2018-12-03 02:28:50,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:28:50,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-03 02:28:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:50,302 INFO L225 Difference]: With dead ends: 23712 [2018-12-03 02:28:50,302 INFO L226 Difference]: Without dead ends: 23712 [2018-12-03 02:28:50,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:28:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23712 states. [2018-12-03 02:28:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23712 to 19210. [2018-12-03 02:28:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19210 states. [2018-12-03 02:28:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19210 states to 19210 states and 61517 transitions. [2018-12-03 02:28:50,523 INFO L78 Accepts]: Start accepts. Automaton has 19210 states and 61517 transitions. Word has length 89 [2018-12-03 02:28:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:50,523 INFO L480 AbstractCegarLoop]: Abstraction has 19210 states and 61517 transitions. [2018-12-03 02:28:50,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:28:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 19210 states and 61517 transitions. [2018-12-03 02:28:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:28:50,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:50,542 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] [2018-12-03 02:28:50,542 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:50,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:50,542 INFO L82 PathProgramCache]: Analyzing trace with hash -412334768, now seen corresponding path program 1 times [2018-12-03 02:28:50,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:50,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:50,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:50,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:50,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:50,635 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-03 02:28:50,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:50,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:28:50,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:50,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:28:50,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:28:50,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:28:50,636 INFO L87 Difference]: Start difference. First operand 19210 states and 61517 transitions. Second operand 6 states. [2018-12-03 02:28:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:50,966 INFO L93 Difference]: Finished difference Result 22660 states and 71687 transitions. [2018-12-03 02:28:50,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:28:50,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-03 02:28:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:50,991 INFO L225 Difference]: With dead ends: 22660 [2018-12-03 02:28:50,991 INFO L226 Difference]: Without dead ends: 22140 [2018-12-03 02:28:50,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:28:51,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22140 states. [2018-12-03 02:28:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22140 to 20895. [2018-12-03 02:28:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20895 states. [2018-12-03 02:28:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20895 states to 20895 states and 66670 transitions. [2018-12-03 02:28:51,205 INFO L78 Accepts]: Start accepts. Automaton has 20895 states and 66670 transitions. Word has length 89 [2018-12-03 02:28:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:51,205 INFO L480 AbstractCegarLoop]: Abstraction has 20895 states and 66670 transitions. [2018-12-03 02:28:51,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:28:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 20895 states and 66670 transitions. [2018-12-03 02:28:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:28:51,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:51,225 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] [2018-12-03 02:28:51,225 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:51,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:51,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1928533223, now seen corresponding path program 1 times [2018-12-03 02:28:51,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:51,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:51,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:51,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:51,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:51,281 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-03 02:28:51,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:51,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:28:51,281 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:51,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:28:51,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:28:51,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:28:51,282 INFO L87 Difference]: Start difference. First operand 20895 states and 66670 transitions. Second operand 7 states. [2018-12-03 02:28:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:51,575 INFO L93 Difference]: Finished difference Result 23643 states and 75369 transitions. [2018-12-03 02:28:51,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:28:51,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-03 02:28:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:51,601 INFO L225 Difference]: With dead ends: 23643 [2018-12-03 02:28:51,602 INFO L226 Difference]: Without dead ends: 23643 [2018-12-03 02:28:51,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:28:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23643 states. [2018-12-03 02:28:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23643 to 21045. [2018-12-03 02:28:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21045 states. [2018-12-03 02:28:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21045 states to 21045 states and 67310 transitions. [2018-12-03 02:28:51,832 INFO L78 Accepts]: Start accepts. Automaton has 21045 states and 67310 transitions. Word has length 89 [2018-12-03 02:28:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:51,832 INFO L480 AbstractCegarLoop]: Abstraction has 21045 states and 67310 transitions. [2018-12-03 02:28:51,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:28:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 21045 states and 67310 transitions. [2018-12-03 02:28:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:28:51,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:51,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:28:51,852 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:51,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:51,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1872528687, now seen corresponding path program 1 times [2018-12-03 02:28:51,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:51,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:51,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:51,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:51,915 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-03 02:28:51,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:51,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:28:51,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:51,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:28:51,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:28:51,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:28:51,916 INFO L87 Difference]: Start difference. First operand 21045 states and 67310 transitions. Second operand 6 states. [2018-12-03 02:28:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:52,106 INFO L93 Difference]: Finished difference Result 23210 states and 72642 transitions. [2018-12-03 02:28:52,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:28:52,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-03 02:28:52,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:52,132 INFO L225 Difference]: With dead ends: 23210 [2018-12-03 02:28:52,132 INFO L226 Difference]: Without dead ends: 23210 [2018-12-03 02:28:52,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:28:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23210 states. [2018-12-03 02:28:52,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23210 to 21470. [2018-12-03 02:28:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21470 states. [2018-12-03 02:28:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 67540 transitions. [2018-12-03 02:28:52,358 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 67540 transitions. Word has length 89 [2018-12-03 02:28:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:52,358 INFO L480 AbstractCegarLoop]: Abstraction has 21470 states and 67540 transitions. [2018-12-03 02:28:52,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:28:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 67540 transitions. [2018-12-03 02:28:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 02:28:52,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:52,378 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] [2018-12-03 02:28:52,378 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:52,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1617792142, now seen corresponding path program 1 times [2018-12-03 02:28:52,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:52,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:52,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:52,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:52,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:52,438 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-03 02:28:52,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:52,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:28:52,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:52,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:28:52,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:28:52,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:28:52,439 INFO L87 Difference]: Start difference. First operand 21470 states and 67540 transitions. Second operand 6 states. [2018-12-03 02:28:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:52,536 INFO L93 Difference]: Finished difference Result 19998 states and 61732 transitions. [2018-12-03 02:28:52,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:28:52,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-03 02:28:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:52,558 INFO L225 Difference]: With dead ends: 19998 [2018-12-03 02:28:52,558 INFO L226 Difference]: Without dead ends: 19998 [2018-12-03 02:28:52,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:28:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19998 states. [2018-12-03 02:28:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19998 to 12659. [2018-12-03 02:28:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12659 states. [2018-12-03 02:28:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 39042 transitions. [2018-12-03 02:28:52,722 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 39042 transitions. Word has length 89 [2018-12-03 02:28:52,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:52,722 INFO L480 AbstractCegarLoop]: Abstraction has 12659 states and 39042 transitions. [2018-12-03 02:28:52,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:28:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 39042 transitions. [2018-12-03 02:28:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:28:52,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:52,733 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] [2018-12-03 02:28:52,734 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:52,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:52,734 INFO L82 PathProgramCache]: Analyzing trace with hash 368979928, now seen corresponding path program 1 times [2018-12-03 02:28:52,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:52,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:52,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:52,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:52,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:52,815 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-03 02:28:52,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:52,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:28:52,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:52,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:28:52,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:28:52,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:28:52,816 INFO L87 Difference]: Start difference. First operand 12659 states and 39042 transitions. Second operand 6 states. [2018-12-03 02:28:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:52,955 INFO L93 Difference]: Finished difference Result 14589 states and 44651 transitions. [2018-12-03 02:28:52,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:28:52,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-03 02:28:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:52,969 INFO L225 Difference]: With dead ends: 14589 [2018-12-03 02:28:52,969 INFO L226 Difference]: Without dead ends: 14299 [2018-12-03 02:28:52,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:28:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14299 states. [2018-12-03 02:28:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14299 to 11174. [2018-12-03 02:28:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11174 states. [2018-12-03 02:28:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11174 states to 11174 states and 34174 transitions. [2018-12-03 02:28:53,087 INFO L78 Accepts]: Start accepts. Automaton has 11174 states and 34174 transitions. Word has length 91 [2018-12-03 02:28:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:53,087 INFO L480 AbstractCegarLoop]: Abstraction has 11174 states and 34174 transitions. [2018-12-03 02:28:53,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:28:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 11174 states and 34174 transitions. [2018-12-03 02:28:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:28:53,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:53,096 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] [2018-12-03 02:28:53,096 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:53,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:53,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1708229415, now seen corresponding path program 1 times [2018-12-03 02:28:53,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:53,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:53,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:53,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:53,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:53,191 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-03 02:28:53,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:53,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 02:28:53,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:53,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:28:53,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:28:53,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:28:53,192 INFO L87 Difference]: Start difference. First operand 11174 states and 34174 transitions. Second operand 9 states. [2018-12-03 02:28:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:53,383 INFO L93 Difference]: Finished difference Result 13111 states and 40031 transitions. [2018-12-03 02:28:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:28:53,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-12-03 02:28:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:53,396 INFO L225 Difference]: With dead ends: 13111 [2018-12-03 02:28:53,396 INFO L226 Difference]: Without dead ends: 13111 [2018-12-03 02:28:53,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-12-03 02:28:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13111 states. [2018-12-03 02:28:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13111 to 12772. [2018-12-03 02:28:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12772 states. [2018-12-03 02:28:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 39053 transitions. [2018-12-03 02:28:53,519 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 39053 transitions. Word has length 91 [2018-12-03 02:28:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:53,519 INFO L480 AbstractCegarLoop]: Abstraction has 12772 states and 39053 transitions. [2018-12-03 02:28:53,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:28:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 39053 transitions. [2018-12-03 02:28:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:28:53,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:53,530 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] [2018-12-03 02:28:53,530 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:53,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:53,530 INFO L82 PathProgramCache]: Analyzing trace with hash -820725734, now seen corresponding path program 1 times [2018-12-03 02:28:53,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:53,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:53,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:53,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:53,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:53,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-03 02:28:53,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:53,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 02:28:53,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:53,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 02:28:53,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 02:28:53,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:28:53,628 INFO L87 Difference]: Start difference. First operand 12772 states and 39053 transitions. Second operand 8 states. [2018-12-03 02:28:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:53,955 INFO L93 Difference]: Finished difference Result 22526 states and 68777 transitions. [2018-12-03 02:28:53,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:28:53,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2018-12-03 02:28:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:53,967 INFO L225 Difference]: With dead ends: 22526 [2018-12-03 02:28:53,967 INFO L226 Difference]: Without dead ends: 11514 [2018-12-03 02:28:53,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-03 02:28:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2018-12-03 02:28:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 10920. [2018-12-03 02:28:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2018-12-03 02:28:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 33137 transitions. [2018-12-03 02:28:54,069 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 33137 transitions. Word has length 91 [2018-12-03 02:28:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:54,069 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 33137 transitions. [2018-12-03 02:28:54,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 02:28:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 33137 transitions. [2018-12-03 02:28:54,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:28:54,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:54,077 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] [2018-12-03 02:28:54,077 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:54,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash -148260104, now seen corresponding path program 2 times [2018-12-03 02:28:54,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:54,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:54,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:54,180 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-03 02:28:54,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:54,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:28:54,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:54,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:28:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:28:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:28:54,181 INFO L87 Difference]: Start difference. First operand 10920 states and 33137 transitions. Second operand 10 states. [2018-12-03 02:28:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:54,624 INFO L93 Difference]: Finished difference Result 18376 states and 56010 transitions. [2018-12-03 02:28:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:28:54,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-12-03 02:28:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:54,631 INFO L225 Difference]: With dead ends: 18376 [2018-12-03 02:28:54,631 INFO L226 Difference]: Without dead ends: 6510 [2018-12-03 02:28:54,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:28:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2018-12-03 02:28:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6510. [2018-12-03 02:28:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6510 states. [2018-12-03 02:28:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 19834 transitions. [2018-12-03 02:28:54,689 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 19834 transitions. Word has length 91 [2018-12-03 02:28:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:54,689 INFO L480 AbstractCegarLoop]: Abstraction has 6510 states and 19834 transitions. [2018-12-03 02:28:54,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:28:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 19834 transitions. [2018-12-03 02:28:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:28:54,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:54,694 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] [2018-12-03 02:28:54,695 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:54,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:54,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1433608860, now seen corresponding path program 1 times [2018-12-03 02:28:54,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:54,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:54,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:28:54,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:54,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:28:54,761 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-03 02:28:54,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:28:54,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:28:54,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:28:54,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:28:54,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:28:54,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:28:54,762 INFO L87 Difference]: Start difference. First operand 6510 states and 19834 transitions. Second operand 7 states. [2018-12-03 02:28:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:28:54,921 INFO L93 Difference]: Finished difference Result 7878 states and 24020 transitions. [2018-12-03 02:28:54,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:28:54,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-03 02:28:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:28:54,930 INFO L225 Difference]: With dead ends: 7878 [2018-12-03 02:28:54,930 INFO L226 Difference]: Without dead ends: 7878 [2018-12-03 02:28:54,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:28:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2018-12-03 02:28:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 7814. [2018-12-03 02:28:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7814 states. [2018-12-03 02:28:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 23812 transitions. [2018-12-03 02:28:55,005 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 23812 transitions. Word has length 91 [2018-12-03 02:28:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:28:55,005 INFO L480 AbstractCegarLoop]: Abstraction has 7814 states and 23812 transitions. [2018-12-03 02:28:55,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:28:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 23812 transitions. [2018-12-03 02:28:55,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 02:28:55,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:28:55,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] [2018-12-03 02:28:55,011 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:28:55,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:28:55,011 INFO L82 PathProgramCache]: Analyzing trace with hash -546105179, now seen corresponding path program 1 times [2018-12-03 02:28:55,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:28:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:55,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:28:55,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:28:55,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:28:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:28:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:28:55,046 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 02:28:55,122 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 02:28:55,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:28:55 BasicIcfg [2018-12-03 02:28:55,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:28:55,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:28:55,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:28:55,124 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:28:55,124 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:27:00" (3/4) ... [2018-12-03 02:28:55,126 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 02:28:55,198 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e1042053-21ff-4704-a572-47980d9467ed/bin-2019/utaipan/witness.graphml [2018-12-03 02:28:55,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:28:55,199 INFO L168 Benchmark]: Toolchain (without parser) took 115662.16 ms. Allocated memory was 1.0 GB in the beginning and 10.0 GB in the end (delta: 8.9 GB). Free memory was 947.0 MB in the beginning and 5.2 GB in the end (delta: -4.3 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2018-12-03 02:28:55,200 INFO L168 Benchmark]: CDTParser took 0.12 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-03 02:28:55,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-12-03 02:28:55,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.98 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-03 02:28:55,201 INFO L168 Benchmark]: Boogie Preprocessor took 18.55 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-03 02:28:55,201 INFO L168 Benchmark]: RCFGBuilder took 318.08 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: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2018-12-03 02:28:55,201 INFO L168 Benchmark]: TraceAbstraction took 114858.50 ms. Allocated memory was 1.1 GB in the beginning and 10.0 GB in the end (delta: 8.8 GB). Free memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: -4.2 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2018-12-03 02:28:55,201 INFO L168 Benchmark]: Witness Printer took 74.83 ms. Allocated memory is still 10.0 GB. Free memory was 5.3 GB in the beginning and 5.2 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2018-12-03 02:28:55,202 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.12 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 349.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.98 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.55 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 318.08 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: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 114858.50 ms. Allocated memory was 1.1 GB in the beginning and 10.0 GB in the end (delta: 8.8 GB). Free memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: -4.2 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. * Witness Printer took 74.83 ms. Allocated memory is still 10.0 GB. Free memory was 5.3 GB in the beginning and 5.2 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L678] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L680] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L682] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L684] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L685] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L686] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L687] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L688] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t2585; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t2585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t2586; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t2586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] -1 pthread_t t2587; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] FCALL, FORK -1 pthread_create(&t2587, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 z = 2 [L711] 1 __unbuffered_p0_EAX = x [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] 2 x = 1 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L732] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L732] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L733] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L733] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L734] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L734] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L735] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L735] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L736] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L737] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L738] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L738] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L769] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L772] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L772] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L775] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L803] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] -1 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 217 locations, 3 error locations. UNSAFE Result, 114.7s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 32.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6821 SDtfs, 9065 SDslu, 15413 SDs, 0 SdLazy, 5887 SolverSat, 391 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 65 SyntacticMatches, 13 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308618occurred in iteration=8, 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: 60.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 607340 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2046 NumberOfCodeBlocks, 2046 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1929 ConstructedInterpolants, 0 QuantifiedInterpolants, 413943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...