./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix048_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix048_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/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 a33630d858f9e9d9dbe5753ab047ddfd5f5eb0e9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:49:43,289 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 04:49:43,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 04:49:43,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 04:49:43,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 04:49:43,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 04:49:43,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 04:49:43,297 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 04:49:43,298 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 04:49:43,299 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 04:49:43,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 04:49:43,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 04:49:43,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 04:49:43,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 04:49:43,300 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 04:49:43,301 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 04:49:43,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 04:49:43,302 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 04:49:43,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 04:49:43,304 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 04:49:43,304 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 04:49:43,305 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 04:49:43,306 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 04:49:43,306 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 04:49:43,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 04:49:43,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 04:49:43,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 04:49:43,307 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 04:49:43,308 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 04:49:43,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 04:49:43,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 04:49:43,309 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 04:49:43,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 04:49:43,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 04:49:43,309 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 04:49:43,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 04:49:43,310 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 04:49:43,317 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 04:49:43,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 04:49:43,317 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 04:49:43,318 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 04:49:43,318 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 04:49:43,318 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 04:49:43,318 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 04:49:43,318 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 04:49:43,318 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 04:49:43,318 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 04:49:43,318 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 04:49:43,318 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 04:49:43,318 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 04:49:43,319 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 04:49:43,319 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 04:49:43,319 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 04:49:43,319 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 04:49:43,319 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 04:49:43,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 04:49:43,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 04:49:43,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 04:49:43,319 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 04:49:43,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 04:49:43,319 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 04:49:43,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 04:49:43,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 04:49:43,320 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 04:49:43,320 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 04:49:43,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 04:49:43,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 04:49:43,320 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 04:49:43,320 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 04:49:43,320 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 04:49:43,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 04:49:43,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 04:49:43,320 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 04:49:43,320 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_24162506-2125-43af-9117-b1edc370f541/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 -> a33630d858f9e9d9dbe5753ab047ddfd5f5eb0e9 [2018-12-03 04:49:43,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 04:49:43,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 04:49:43,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 04:49:43,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 04:49:43,347 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 04:49:43,347 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix048_tso.oepc_false-unreach-call.i [2018-12-03 04:49:43,381 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/bin-2019/utaipan/data/749889a6d/31a1c488133346fcb8f9f4d1da098f9f/FLAG19b3c9e2d [2018-12-03 04:49:43,763 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 04:49:43,763 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/sv-benchmarks/c/pthread-wmm/mix048_tso.oepc_false-unreach-call.i [2018-12-03 04:49:43,770 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/bin-2019/utaipan/data/749889a6d/31a1c488133346fcb8f9f4d1da098f9f/FLAG19b3c9e2d [2018-12-03 04:49:44,115 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/bin-2019/utaipan/data/749889a6d/31a1c488133346fcb8f9f4d1da098f9f [2018-12-03 04:49:44,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 04:49:44,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 04:49:44,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 04:49:44,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 04:49:44,120 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 04:49:44,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:49:44" (1/1) ... [2018-12-03 04:49:44,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56412a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44, skipping insertion in model container [2018-12-03 04:49:44,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:49:44" (1/1) ... [2018-12-03 04:49:44,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 04:49:44,154 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 04:49:44,361 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:49:44,370 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 04:49:44,454 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:49:44,500 INFO L195 MainTranslator]: Completed translation [2018-12-03 04:49:44,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44 WrapperNode [2018-12-03 04:49:44,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 04:49:44,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 04:49:44,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 04:49:44,501 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 04:49:44,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44" (1/1) ... [2018-12-03 04:49:44,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44" (1/1) ... [2018-12-03 04:49:44,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 04:49:44,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 04:49:44,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 04:49:44,532 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 04:49:44,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44" (1/1) ... [2018-12-03 04:49:44,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44" (1/1) ... [2018-12-03 04:49:44,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44" (1/1) ... [2018-12-03 04:49:44,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44" (1/1) ... [2018-12-03 04:49:44,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44" (1/1) ... [2018-12-03 04:49:44,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44" (1/1) ... [2018-12-03 04:49:44,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44" (1/1) ... [2018-12-03 04:49:44,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 04:49:44,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 04:49:44,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 04:49:44,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 04:49:44,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/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 04:49:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 04:49:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 04:49:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 04:49:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 04:49:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 04:49:44,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 04:49:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 04:49:44,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 04:49:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 04:49:44,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 04:49:44,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 04:49:44,587 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 04:49:44,884 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 04:49:44,884 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 04:49:44,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:49:44 BoogieIcfgContainer [2018-12-03 04:49:44,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 04:49:44,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 04:49:44,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 04:49:44,887 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 04:49:44,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 04:49:44" (1/3) ... [2018-12-03 04:49:44,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5892af66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:49:44, skipping insertion in model container [2018-12-03 04:49:44,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:49:44" (2/3) ... [2018-12-03 04:49:44,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5892af66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:49:44, skipping insertion in model container [2018-12-03 04:49:44,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:49:44" (3/3) ... [2018-12-03 04:49:44,889 INFO L112 eAbstractionObserver]: Analyzing ICFG mix048_tso.oepc_false-unreach-call.i [2018-12-03 04:49:44,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,912 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,912 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,912 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,912 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,912 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,916 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,917 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,918 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,919 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,922 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,923 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,926 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:49:44,930 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 04:49:44,930 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 04:49:44,935 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 04:49:44,944 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 04:49:44,960 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 04:49:44,960 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 04:49:44,960 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 04:49:44,961 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 04:49:44,961 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 04:49:44,961 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 04:49:44,961 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 04:49:44,961 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 04:49:44,967 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-03 04:49:46,603 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-03 04:49:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-03 04:49:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 04:49:46,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:46,610 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] [2018-12-03 04:49:46,612 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:46,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:46,615 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-12-03 04:49:46,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:46,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:46,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:46,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:46,748 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 04:49:46,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:46,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:49:46,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:46,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:49:46,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:49:46,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:49:46,764 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-03 04:49:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:47,236 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-03 04:49:47,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:49:47,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-03 04:49:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:47,384 INFO L225 Difference]: With dead ends: 60790 [2018-12-03 04:49:47,384 INFO L226 Difference]: Without dead ends: 44270 [2018-12-03 04:49:47,386 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 04:49:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-03 04:49:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-03 04:49:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-03 04:49:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-03 04:49:48,178 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-03 04:49:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:48,178 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-03 04:49:48,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:49:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-03 04:49:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 04:49:48,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:48,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:48,183 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:48,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:48,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-12-03 04:49:48,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:48,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:48,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:48,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:48,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:48,230 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 04:49:48,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:48,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:49:48,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:48,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:49:48,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:49:48,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:49:48,232 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-03 04:49:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:48,299 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-03 04:49:48,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:49:48,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-03 04:49:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:48,314 INFO L225 Difference]: With dead ends: 8528 [2018-12-03 04:49:48,315 INFO L226 Difference]: Without dead ends: 7466 [2018-12-03 04:49:48,315 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 04:49:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-03 04:49:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-03 04:49:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-03 04:49:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-03 04:49:48,399 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-03 04:49:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:48,399 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-03 04:49:48,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:49:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-03 04:49:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 04:49:48,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:48,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:48,400 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:48,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:48,401 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-12-03 04:49:48,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:48,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:48,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:48,456 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 04:49:48,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:48,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:49:48,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:48,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:49:48,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:49:48,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:49:48,458 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-03 04:49:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:48,672 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-03 04:49:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:49:48,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-03 04:49:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:48,692 INFO L225 Difference]: With dead ends: 13998 [2018-12-03 04:49:48,692 INFO L226 Difference]: Without dead ends: 13930 [2018-12-03 04:49:48,692 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 04:49:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-03 04:49:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-03 04:49:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-03 04:49:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-03 04:49:48,908 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-03 04:49:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:48,908 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-03 04:49:48,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:49:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-03 04:49:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 04:49:48,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:48,910 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] [2018-12-03 04:49:48,910 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:48,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-12-03 04:49:48,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:48,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:48,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:48,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:48,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:48,934 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 04:49:48,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:48,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:49:48,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:48,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:49:48,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:49:48,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:49:48,935 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-03 04:49:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:48,987 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-03 04:49:48,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:49:48,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-03 04:49:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:49,002 INFO L225 Difference]: With dead ends: 13279 [2018-12-03 04:49:49,002 INFO L226 Difference]: Without dead ends: 13279 [2018-12-03 04:49:49,003 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 04:49:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-03 04:49:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-03 04:49:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-03 04:49:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-03 04:49:49,127 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-03 04:49:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:49,127 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-03 04:49:49,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:49:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-03 04:49:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 04:49:49,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:49,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:49,129 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:49,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:49,129 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-12-03 04:49:49,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:49,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:49,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:49,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:49,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:49,195 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 04:49:49,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:49,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:49:49,196 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:49,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:49:49,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:49:49,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:49:49,196 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-03 04:49:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:49,626 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-03 04:49:49,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 04:49:49,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-03 04:49:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:49,640 INFO L225 Difference]: With dead ends: 12285 [2018-12-03 04:49:49,640 INFO L226 Difference]: Without dead ends: 12213 [2018-12-03 04:49:49,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-03 04:49:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-03 04:49:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-03 04:49:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-03 04:49:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-03 04:49:49,765 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-03 04:49:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:49,765 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-03 04:49:49,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:49:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-03 04:49:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 04:49:49,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:49,769 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 04:49:49,769 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:49,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:49,769 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-12-03 04:49:49,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:49,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:49,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:49,826 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 04:49:49,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:49,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:49:49,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:49,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:49:49,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:49:49,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:49:49,827 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-03 04:49:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:49,920 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-03 04:49:49,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:49:49,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-03 04:49:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:49,934 INFO L225 Difference]: With dead ends: 12396 [2018-12-03 04:49:49,934 INFO L226 Difference]: Without dead ends: 12396 [2018-12-03 04:49:49,934 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 04:49:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-03 04:49:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-03 04:49:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-03 04:49:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-03 04:49:50,072 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-03 04:49:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:50,073 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-03 04:49:50,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:49:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-03 04:49:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 04:49:50,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:50,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] [2018-12-03 04:49:50,077 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:50,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:50,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-12-03 04:49:50,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:50,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:50,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:50,139 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 04:49:50,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:50,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:49:50,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:50,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:49:50,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:49:50,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:49:50,140 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-03 04:49:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:50,508 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-03 04:49:50,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 04:49:50,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-03 04:49:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:50,534 INFO L225 Difference]: With dead ends: 20969 [2018-12-03 04:49:50,534 INFO L226 Difference]: Without dead ends: 20898 [2018-12-03 04:49:50,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-03 04:49:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-03 04:49:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-03 04:49:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-03 04:49:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-03 04:49:50,709 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-03 04:49:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:50,710 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-03 04:49:50,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:49:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-03 04:49:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 04:49:50,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:50,716 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] [2018-12-03 04:49:50,716 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:50,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:50,716 INFO L82 PathProgramCache]: Analyzing trace with hash 553940321, now seen corresponding path program 1 times [2018-12-03 04:49:50,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:50,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:50,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:50,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:50,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:50,768 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 04:49:50,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:50,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:49:50,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:50,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:49:50,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:49:50,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:49:50,769 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-03 04:49:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:50,979 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-12-03 04:49:50,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:49:50,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-03 04:49:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:50,999 INFO L225 Difference]: With dead ends: 17635 [2018-12-03 04:49:50,999 INFO L226 Difference]: Without dead ends: 17635 [2018-12-03 04:49:50,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:49:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-03 04:49:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-12-03 04:49:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-12-03 04:49:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-12-03 04:49:51,172 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-12-03 04:49:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:51,172 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-12-03 04:49:51,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:49:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-12-03 04:49:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 04:49:51,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:51,177 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] [2018-12-03 04:49:51,177 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:51,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:51,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1523269022, now seen corresponding path program 1 times [2018-12-03 04:49:51,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:51,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:51,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:51,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:51,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:51,205 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 04:49:51,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:51,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:49:51,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:51,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:49:51,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:49:51,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:49:51,206 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-12-03 04:49:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:51,368 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-12-03 04:49:51,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:49:51,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-03 04:49:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:51,386 INFO L225 Difference]: With dead ends: 16385 [2018-12-03 04:49:51,386 INFO L226 Difference]: Without dead ends: 16385 [2018-12-03 04:49:51,387 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 04:49:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-12-03 04:49:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-12-03 04:49:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-12-03 04:49:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-12-03 04:49:51,561 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-12-03 04:49:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:51,561 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-12-03 04:49:51,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:49:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-12-03 04:49:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 04:49:51,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:51,567 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] [2018-12-03 04:49:51,567 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:51,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:51,568 INFO L82 PathProgramCache]: Analyzing trace with hash 493974152, now seen corresponding path program 1 times [2018-12-03 04:49:51,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:51,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:51,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:51,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:51,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:51,621 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 04:49:51,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:51,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:49:51,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:51,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:49:51,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:49:51,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:49:51,622 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-12-03 04:49:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:52,260 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-12-03 04:49:52,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:49:52,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-03 04:49:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:52,281 INFO L225 Difference]: With dead ends: 19821 [2018-12-03 04:49:52,281 INFO L226 Difference]: Without dead ends: 19821 [2018-12-03 04:49:52,282 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 04:49:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-12-03 04:49:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-12-03 04:49:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-12-03 04:49:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-12-03 04:49:52,479 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-12-03 04:49:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:52,479 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-12-03 04:49:52,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:49:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-12-03 04:49:52,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 04:49:52,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:52,486 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] [2018-12-03 04:49:52,486 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:52,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:52,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1583235191, now seen corresponding path program 1 times [2018-12-03 04:49:52,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:52,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:52,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:52,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:52,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:52,554 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 04:49:52,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:52,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:49:52,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:52,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:49:52,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:49:52,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:49:52,555 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-12-03 04:49:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:52,855 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-12-03 04:49:52,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 04:49:52,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-03 04:49:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:52,880 INFO L225 Difference]: With dead ends: 21449 [2018-12-03 04:49:52,880 INFO L226 Difference]: Without dead ends: 21449 [2018-12-03 04:49:52,880 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 04:49:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-12-03 04:49:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-12-03 04:49:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-12-03 04:49:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-12-03 04:49:53,085 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-12-03 04:49:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:53,086 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-12-03 04:49:53,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:49:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-12-03 04:49:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 04:49:53,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:53,093 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] [2018-12-03 04:49:53,093 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:53,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:53,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1371884278, now seen corresponding path program 1 times [2018-12-03 04:49:53,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:53,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:53,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:53,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:53,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:53,127 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 04:49:53,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:53,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:49:53,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:53,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:49:53,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:49:53,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:49:53,128 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-12-03 04:49:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:53,384 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-12-03 04:49:53,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:49:53,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-03 04:49:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:53,413 INFO L225 Difference]: With dead ends: 25024 [2018-12-03 04:49:53,413 INFO L226 Difference]: Without dead ends: 25024 [2018-12-03 04:49:53,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:49:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-12-03 04:49:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-12-03 04:49:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-12-03 04:49:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-12-03 04:49:53,675 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-12-03 04:49:53,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:53,675 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-12-03 04:49:53,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:49:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-12-03 04:49:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 04:49:53,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:53,684 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] [2018-12-03 04:49:53,685 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:53,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:53,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1882418455, now seen corresponding path program 1 times [2018-12-03 04:49:53,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:53,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:53,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:53,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:53,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:53,728 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 04:49:53,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:53,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:49:53,728 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:53,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:49:53,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:49:53,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:49:53,729 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 4 states. [2018-12-03 04:49:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:54,174 INFO L93 Difference]: Finished difference Result 31689 states and 95699 transitions. [2018-12-03 04:49:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:49:54,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-03 04:49:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:54,206 INFO L225 Difference]: With dead ends: 31689 [2018-12-03 04:49:54,206 INFO L226 Difference]: Without dead ends: 31537 [2018-12-03 04:49:54,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:49:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31537 states. [2018-12-03 04:49:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31537 to 28553. [2018-12-03 04:49:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28553 states. [2018-12-03 04:49:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28553 states to 28553 states and 86263 transitions. [2018-12-03 04:49:54,514 INFO L78 Accepts]: Start accepts. Automaton has 28553 states and 86263 transitions. Word has length 66 [2018-12-03 04:49:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:54,514 INFO L480 AbstractCegarLoop]: Abstraction has 28553 states and 86263 transitions. [2018-12-03 04:49:54,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:49:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 28553 states and 86263 transitions. [2018-12-03 04:49:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 04:49:54,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:54,523 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] [2018-12-03 04:49:54,524 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:54,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash -74963992, now seen corresponding path program 1 times [2018-12-03 04:49:54,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:54,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:54,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:54,565 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 04:49:54,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:54,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:49:54,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:54,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:49:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:49:54,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:49:54,566 INFO L87 Difference]: Start difference. First operand 28553 states and 86263 transitions. Second operand 5 states. [2018-12-03 04:49:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:54,935 INFO L93 Difference]: Finished difference Result 40195 states and 119844 transitions. [2018-12-03 04:49:54,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:49:54,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-03 04:49:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:54,981 INFO L225 Difference]: With dead ends: 40195 [2018-12-03 04:49:54,981 INFO L226 Difference]: Without dead ends: 39987 [2018-12-03 04:49:54,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 04:49:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39987 states. [2018-12-03 04:49:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39987 to 35807. [2018-12-03 04:49:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-12-03 04:49:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-12-03 04:49:55,393 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-12-03 04:49:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:55,393 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-12-03 04:49:55,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:49:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-12-03 04:49:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 04:49:55,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:55,403 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] [2018-12-03 04:49:55,403 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:55,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash 615597482, now seen corresponding path program 1 times [2018-12-03 04:49:55,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:55,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:55,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:55,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:55,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:55,483 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 04:49:55,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:55,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:49:55,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:55,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:49:55,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:49:55,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:49:55,484 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 7 states. [2018-12-03 04:49:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:55,798 INFO L93 Difference]: Finished difference Result 31667 states and 90728 transitions. [2018-12-03 04:49:55,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 04:49:55,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-03 04:49:55,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:55,831 INFO L225 Difference]: With dead ends: 31667 [2018-12-03 04:49:55,831 INFO L226 Difference]: Without dead ends: 31667 [2018-12-03 04:49:55,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-03 04:49:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31667 states. [2018-12-03 04:49:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31667 to 25460. [2018-12-03 04:49:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25460 states. [2018-12-03 04:49:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25460 states to 25460 states and 73006 transitions. [2018-12-03 04:49:56,165 INFO L78 Accepts]: Start accepts. Automaton has 25460 states and 73006 transitions. Word has length 66 [2018-12-03 04:49:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:56,165 INFO L480 AbstractCegarLoop]: Abstraction has 25460 states and 73006 transitions. [2018-12-03 04:49:56,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:49:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 25460 states and 73006 transitions. [2018-12-03 04:49:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 04:49:56,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:56,174 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] [2018-12-03 04:49:56,174 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:56,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:56,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1503101163, now seen corresponding path program 1 times [2018-12-03 04:49:56,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:56,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:56,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:56,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:56,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:56,205 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 04:49:56,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:56,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:49:56,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:56,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:49:56,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:49:56,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:49:56,206 INFO L87 Difference]: Start difference. First operand 25460 states and 73006 transitions. Second operand 5 states. [2018-12-03 04:49:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:56,237 INFO L93 Difference]: Finished difference Result 7460 states and 17978 transitions. [2018-12-03 04:49:56,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 04:49:56,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-03 04:49:56,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:56,241 INFO L225 Difference]: With dead ends: 7460 [2018-12-03 04:49:56,241 INFO L226 Difference]: Without dead ends: 6135 [2018-12-03 04:49:56,242 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 04:49:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2018-12-03 04:49:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 5529. [2018-12-03 04:49:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5529 states. [2018-12-03 04:49:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 12867 transitions. [2018-12-03 04:49:56,282 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 12867 transitions. Word has length 66 [2018-12-03 04:49:56,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:56,282 INFO L480 AbstractCegarLoop]: Abstraction has 5529 states and 12867 transitions. [2018-12-03 04:49:56,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:49:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 12867 transitions. [2018-12-03 04:49:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 04:49:56,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:56,285 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] [2018-12-03 04:49:56,285 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:56,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:56,285 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-12-03 04:49:56,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:56,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:56,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:56,298 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 04:49:56,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:56,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:49:56,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:56,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:49:56,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:49:56,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:49:56,299 INFO L87 Difference]: Start difference. First operand 5529 states and 12867 transitions. Second operand 3 states. [2018-12-03 04:49:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:56,330 INFO L93 Difference]: Finished difference Result 7165 states and 16473 transitions. [2018-12-03 04:49:56,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:49:56,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-03 04:49:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:56,335 INFO L225 Difference]: With dead ends: 7165 [2018-12-03 04:49:56,335 INFO L226 Difference]: Without dead ends: 7165 [2018-12-03 04:49:56,336 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 04:49:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2018-12-03 04:49:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 5468. [2018-12-03 04:49:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2018-12-03 04:49:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 12407 transitions. [2018-12-03 04:49:56,381 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 12407 transitions. Word has length 66 [2018-12-03 04:49:56,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:56,381 INFO L480 AbstractCegarLoop]: Abstraction has 5468 states and 12407 transitions. [2018-12-03 04:49:56,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:49:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 12407 transitions. [2018-12-03 04:49:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 04:49:56,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:56,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:56,385 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:56,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-12-03 04:49:56,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:56,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:56,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:56,424 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 04:49:56,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:56,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:49:56,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:56,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:49:56,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:49:56,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:49:56,425 INFO L87 Difference]: Start difference. First operand 5468 states and 12407 transitions. Second operand 5 states. [2018-12-03 04:49:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:56,514 INFO L93 Difference]: Finished difference Result 6622 states and 15012 transitions. [2018-12-03 04:49:56,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 04:49:56,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-03 04:49:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:56,519 INFO L225 Difference]: With dead ends: 6622 [2018-12-03 04:49:56,519 INFO L226 Difference]: Without dead ends: 6622 [2018-12-03 04:49:56,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 04:49:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2018-12-03 04:49:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 5912. [2018-12-03 04:49:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2018-12-03 04:49:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 13411 transitions. [2018-12-03 04:49:56,560 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 13411 transitions. Word has length 72 [2018-12-03 04:49:56,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:56,560 INFO L480 AbstractCegarLoop]: Abstraction has 5912 states and 13411 transitions. [2018-12-03 04:49:56,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:49:56,560 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 13411 transitions. [2018-12-03 04:49:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 04:49:56,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:56,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:56,564 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:56,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-12-03 04:49:56,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:56,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:56,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:56,663 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 04:49:56,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:56,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 04:49:56,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:56,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 04:49:56,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 04:49:56,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-03 04:49:56,664 INFO L87 Difference]: Start difference. First operand 5912 states and 13411 transitions. Second operand 9 states. [2018-12-03 04:49:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:56,937 INFO L93 Difference]: Finished difference Result 7374 states and 16560 transitions. [2018-12-03 04:49:56,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 04:49:56,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-03 04:49:56,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:56,942 INFO L225 Difference]: With dead ends: 7374 [2018-12-03 04:49:56,942 INFO L226 Difference]: Without dead ends: 7272 [2018-12-03 04:49:56,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-03 04:49:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-12-03 04:49:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 6009. [2018-12-03 04:49:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6009 states. [2018-12-03 04:49:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6009 states to 6009 states and 13504 transitions. [2018-12-03 04:49:56,989 INFO L78 Accepts]: Start accepts. Automaton has 6009 states and 13504 transitions. Word has length 72 [2018-12-03 04:49:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:56,989 INFO L480 AbstractCegarLoop]: Abstraction has 6009 states and 13504 transitions. [2018-12-03 04:49:56,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 04:49:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6009 states and 13504 transitions. [2018-12-03 04:49:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 04:49:56,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:56,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:56,993 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:56,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:56,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1961022429, now seen corresponding path program 1 times [2018-12-03 04:49:56,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:56,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:56,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:56,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:56,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:57,052 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 04:49:57,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:57,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:49:57,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:57,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:49:57,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:49:57,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:49:57,052 INFO L87 Difference]: Start difference. First operand 6009 states and 13504 transitions. Second operand 7 states. [2018-12-03 04:49:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:57,477 INFO L93 Difference]: Finished difference Result 7489 states and 16833 transitions. [2018-12-03 04:49:57,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:49:57,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-03 04:49:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:57,482 INFO L225 Difference]: With dead ends: 7489 [2018-12-03 04:49:57,482 INFO L226 Difference]: Without dead ends: 7489 [2018-12-03 04:49:57,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 04:49:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7489 states. [2018-12-03 04:49:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7489 to 6149. [2018-12-03 04:49:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6149 states. [2018-12-03 04:49:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 13892 transitions. [2018-12-03 04:49:57,530 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 13892 transitions. Word has length 93 [2018-12-03 04:49:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:57,530 INFO L480 AbstractCegarLoop]: Abstraction has 6149 states and 13892 transitions. [2018-12-03 04:49:57,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:49:57,530 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 13892 transitions. [2018-12-03 04:49:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 04:49:57,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:57,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:57,536 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:57,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:57,536 INFO L82 PathProgramCache]: Analyzing trace with hash 397526624, now seen corresponding path program 1 times [2018-12-03 04:49:57,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:57,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:57,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:57,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:57,575 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 04:49:57,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:57,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:49:57,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:57,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:49:57,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:49:57,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:49:57,576 INFO L87 Difference]: Start difference. First operand 6149 states and 13892 transitions. Second operand 4 states. [2018-12-03 04:49:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:57,648 INFO L93 Difference]: Finished difference Result 7316 states and 16390 transitions. [2018-12-03 04:49:57,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:49:57,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-03 04:49:57,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:57,655 INFO L225 Difference]: With dead ends: 7316 [2018-12-03 04:49:57,655 INFO L226 Difference]: Without dead ends: 7316 [2018-12-03 04:49:57,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:49:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7316 states. [2018-12-03 04:49:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7316 to 6506. [2018-12-03 04:49:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2018-12-03 04:49:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 14662 transitions. [2018-12-03 04:49:57,705 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 14662 transitions. Word has length 93 [2018-12-03 04:49:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:57,705 INFO L480 AbstractCegarLoop]: Abstraction has 6506 states and 14662 transitions. [2018-12-03 04:49:57,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:49:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 14662 transitions. [2018-12-03 04:49:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 04:49:57,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:57,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:57,710 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:57,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash 51507110, now seen corresponding path program 1 times [2018-12-03 04:49:57,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:57,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:57,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:57,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:57,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:57,767 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 04:49:57,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:57,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:49:57,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:57,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:49:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:49:57,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:49:57,768 INFO L87 Difference]: Start difference. First operand 6506 states and 14662 transitions. Second operand 5 states. [2018-12-03 04:49:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:57,840 INFO L93 Difference]: Finished difference Result 7013 states and 15750 transitions. [2018-12-03 04:49:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:49:57,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-03 04:49:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:57,845 INFO L225 Difference]: With dead ends: 7013 [2018-12-03 04:49:57,845 INFO L226 Difference]: Without dead ends: 7013 [2018-12-03 04:49:57,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:49:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7013 states. [2018-12-03 04:49:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7013 to 5402. [2018-12-03 04:49:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5402 states. [2018-12-03 04:49:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 12178 transitions. [2018-12-03 04:49:57,885 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 12178 transitions. Word has length 95 [2018-12-03 04:49:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:57,885 INFO L480 AbstractCegarLoop]: Abstraction has 5402 states and 12178 transitions. [2018-12-03 04:49:57,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:49:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 12178 transitions. [2018-12-03 04:49:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 04:49:57,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:57,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:57,889 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:57,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:57,889 INFO L82 PathProgramCache]: Analyzing trace with hash 62823237, now seen corresponding path program 1 times [2018-12-03 04:49:57,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:57,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:57,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:57,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:58,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 04:49:58,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:58,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 04:49:58,004 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:58,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 04:49:58,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 04:49:58,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-03 04:49:58,004 INFO L87 Difference]: Start difference. First operand 5402 states and 12178 transitions. Second operand 11 states. [2018-12-03 04:49:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:58,699 INFO L93 Difference]: Finished difference Result 7780 states and 17289 transitions. [2018-12-03 04:49:58,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 04:49:58,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-03 04:49:58,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:58,704 INFO L225 Difference]: With dead ends: 7780 [2018-12-03 04:49:58,704 INFO L226 Difference]: Without dead ends: 7748 [2018-12-03 04:49:58,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-12-03 04:49:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2018-12-03 04:49:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 6075. [2018-12-03 04:49:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2018-12-03 04:49:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 13575 transitions. [2018-12-03 04:49:58,751 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 13575 transitions. Word has length 95 [2018-12-03 04:49:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:58,751 INFO L480 AbstractCegarLoop]: Abstraction has 6075 states and 13575 transitions. [2018-12-03 04:49:58,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 04:49:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 13575 transitions. [2018-12-03 04:49:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 04:49:58,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:58,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:58,755 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:58,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:58,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1126882425, now seen corresponding path program 1 times [2018-12-03 04:49:58,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:58,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:58,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:58,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:58,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:58,856 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 04:49:58,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:58,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 04:49:58,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:58,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 04:49:58,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 04:49:58,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 04:49:58,857 INFO L87 Difference]: Start difference. First operand 6075 states and 13575 transitions. Second operand 9 states. [2018-12-03 04:49:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:59,226 INFO L93 Difference]: Finished difference Result 7670 states and 16959 transitions. [2018-12-03 04:49:59,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 04:49:59,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-03 04:49:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:59,233 INFO L225 Difference]: With dead ends: 7670 [2018-12-03 04:49:59,233 INFO L226 Difference]: Without dead ends: 7670 [2018-12-03 04:49:59,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-03 04:49:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2018-12-03 04:49:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 6328. [2018-12-03 04:49:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-12-03 04:49:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 14116 transitions. [2018-12-03 04:49:59,283 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 14116 transitions. Word has length 95 [2018-12-03 04:49:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:59,284 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 14116 transitions. [2018-12-03 04:49:59,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 04:49:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 14116 transitions. [2018-12-03 04:49:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 04:49:59,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:59,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:59,288 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:59,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:59,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1803035193, now seen corresponding path program 1 times [2018-12-03 04:49:59,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:59,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:59,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:59,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:59,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:59,357 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 04:49:59,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:59,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:49:59,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:59,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:49:59,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:49:59,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:49:59,358 INFO L87 Difference]: Start difference. First operand 6328 states and 14116 transitions. Second operand 5 states. [2018-12-03 04:49:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:49:59,386 INFO L93 Difference]: Finished difference Result 6328 states and 14100 transitions. [2018-12-03 04:49:59,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:49:59,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-03 04:49:59,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:49:59,390 INFO L225 Difference]: With dead ends: 6328 [2018-12-03 04:49:59,390 INFO L226 Difference]: Without dead ends: 6328 [2018-12-03 04:49:59,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:49:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6328 states. [2018-12-03 04:49:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6328 to 5834. [2018-12-03 04:49:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2018-12-03 04:49:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 12950 transitions. [2018-12-03 04:49:59,437 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 12950 transitions. Word has length 95 [2018-12-03 04:49:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:49:59,438 INFO L480 AbstractCegarLoop]: Abstraction has 5834 states and 12950 transitions. [2018-12-03 04:49:59,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:49:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 12950 transitions. [2018-12-03 04:49:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 04:49:59,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:49:59,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:49:59,443 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:49:59,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:49:59,443 INFO L82 PathProgramCache]: Analyzing trace with hash -915531512, now seen corresponding path program 1 times [2018-12-03 04:49:59,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:49:59,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:59,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:49:59,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:49:59,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:49:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:49:59,566 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 04:49:59,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:49:59,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 04:49:59,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:49:59,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 04:49:59,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 04:49:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 04:49:59,567 INFO L87 Difference]: Start difference. First operand 5834 states and 12950 transitions. Second operand 11 states. [2018-12-03 04:50:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:50:00,426 INFO L93 Difference]: Finished difference Result 10673 states and 23818 transitions. [2018-12-03 04:50:00,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 04:50:00,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-03 04:50:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:50:00,431 INFO L225 Difference]: With dead ends: 10673 [2018-12-03 04:50:00,431 INFO L226 Difference]: Without dead ends: 7307 [2018-12-03 04:50:00,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-03 04:50:00,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2018-12-03 04:50:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 5651. [2018-12-03 04:50:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5651 states. [2018-12-03 04:50:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5651 states to 5651 states and 12511 transitions. [2018-12-03 04:50:00,476 INFO L78 Accepts]: Start accepts. Automaton has 5651 states and 12511 transitions. Word has length 95 [2018-12-03 04:50:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:50:00,476 INFO L480 AbstractCegarLoop]: Abstraction has 5651 states and 12511 transitions. [2018-12-03 04:50:00,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 04:50:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5651 states and 12511 transitions. [2018-12-03 04:50:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 04:50:00,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:50:00,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:50:00,481 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:50:00,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:50:00,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1822988144, now seen corresponding path program 1 times [2018-12-03 04:50:00,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:50:00,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:50:00,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:50:00,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:50:00,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:50:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:50:00,537 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 04:50:00,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:50:00,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:50:00,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:50:00,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:50:00,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:50:00,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:50:00,538 INFO L87 Difference]: Start difference. First operand 5651 states and 12511 transitions. Second operand 6 states. [2018-12-03 04:50:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:50:00,645 INFO L93 Difference]: Finished difference Result 6456 states and 14105 transitions. [2018-12-03 04:50:00,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:50:00,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-03 04:50:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:50:00,649 INFO L225 Difference]: With dead ends: 6456 [2018-12-03 04:50:00,650 INFO L226 Difference]: Without dead ends: 6419 [2018-12-03 04:50:00,650 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 04:50:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6419 states. [2018-12-03 04:50:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6419 to 5751. [2018-12-03 04:50:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5751 states. [2018-12-03 04:50:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5751 states to 5751 states and 12603 transitions. [2018-12-03 04:50:00,690 INFO L78 Accepts]: Start accepts. Automaton has 5751 states and 12603 transitions. Word has length 95 [2018-12-03 04:50:00,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:50:00,690 INFO L480 AbstractCegarLoop]: Abstraction has 5751 states and 12603 transitions. [2018-12-03 04:50:00,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:50:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5751 states and 12603 transitions. [2018-12-03 04:50:00,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 04:50:00,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:50:00,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, 1, 1, 1, 1] [2018-12-03 04:50:00,694 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:50:00,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:50:00,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1486517392, now seen corresponding path program 2 times [2018-12-03 04:50:00,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:50:00,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:50:00,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:50:00,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:50:00,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:50:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:50:00,756 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 04:50:00,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:50:00,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:50:00,757 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:50:00,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:50:00,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:50:00,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:50:00,757 INFO L87 Difference]: Start difference. First operand 5751 states and 12603 transitions. Second operand 7 states. [2018-12-03 04:50:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:50:00,992 INFO L93 Difference]: Finished difference Result 7729 states and 16698 transitions. [2018-12-03 04:50:00,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 04:50:00,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-03 04:50:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:50:00,997 INFO L225 Difference]: With dead ends: 7729 [2018-12-03 04:50:00,998 INFO L226 Difference]: Without dead ends: 7729 [2018-12-03 04:50:00,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-03 04:50:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7729 states. [2018-12-03 04:50:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7729 to 6230. [2018-12-03 04:50:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6230 states. [2018-12-03 04:50:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6230 states to 6230 states and 13665 transitions. [2018-12-03 04:50:01,044 INFO L78 Accepts]: Start accepts. Automaton has 6230 states and 13665 transitions. Word has length 95 [2018-12-03 04:50:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:50:01,044 INFO L480 AbstractCegarLoop]: Abstraction has 6230 states and 13665 transitions. [2018-12-03 04:50:01,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:50:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 6230 states and 13665 transitions. [2018-12-03 04:50:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 04:50:01,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:50:01,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:50:01,048 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:50:01,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:50:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1697868305, now seen corresponding path program 1 times [2018-12-03 04:50:01,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:50:01,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:50:01,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 04:50:01,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:50:01,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:50:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:50:01,082 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 04:50:01,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:50:01,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:50:01,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:50:01,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:50:01,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:50:01,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:50:01,083 INFO L87 Difference]: Start difference. First operand 6230 states and 13665 transitions. Second operand 6 states. [2018-12-03 04:50:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:50:01,193 INFO L93 Difference]: Finished difference Result 6511 states and 14234 transitions. [2018-12-03 04:50:01,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:50:01,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-03 04:50:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:50:01,198 INFO L225 Difference]: With dead ends: 6511 [2018-12-03 04:50:01,198 INFO L226 Difference]: Without dead ends: 6511 [2018-12-03 04:50:01,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 04:50:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6511 states. [2018-12-03 04:50:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6511 to 6105. [2018-12-03 04:50:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6105 states. [2018-12-03 04:50:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6105 states to 6105 states and 13384 transitions. [2018-12-03 04:50:01,240 INFO L78 Accepts]: Start accepts. Automaton has 6105 states and 13384 transitions. Word has length 95 [2018-12-03 04:50:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:50:01,240 INFO L480 AbstractCegarLoop]: Abstraction has 6105 states and 13384 transitions. [2018-12-03 04:50:01,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:50:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6105 states and 13384 transitions. [2018-12-03 04:50:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 04:50:01,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:50:01,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:50:01,245 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:50:01,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:50:01,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2142213391, now seen corresponding path program 2 times [2018-12-03 04:50:01,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:50:01,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:50:01,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:50:01,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:50:01,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:50:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:50:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:50:01,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:50:01,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:50:01,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:50:01,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:50:01,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:50:01,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:50:01,314 INFO L87 Difference]: Start difference. First operand 6105 states and 13384 transitions. Second operand 7 states. [2018-12-03 04:50:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:50:01,418 INFO L93 Difference]: Finished difference Result 7349 states and 16045 transitions. [2018-12-03 04:50:01,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:50:01,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-03 04:50:01,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:50:01,423 INFO L225 Difference]: With dead ends: 7349 [2018-12-03 04:50:01,423 INFO L226 Difference]: Without dead ends: 7349 [2018-12-03 04:50:01,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 04:50:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7349 states. [2018-12-03 04:50:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7349 to 5311. [2018-12-03 04:50:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2018-12-03 04:50:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 11544 transitions. [2018-12-03 04:50:01,467 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 11544 transitions. Word has length 95 [2018-12-03 04:50:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:50:01,467 INFO L480 AbstractCegarLoop]: Abstraction has 5311 states and 11544 transitions. [2018-12-03 04:50:01,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:50:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 11544 transitions. [2018-12-03 04:50:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 04:50:01,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:50:01,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:50:01,471 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:50:01,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:50:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1930862478, now seen corresponding path program 2 times [2018-12-03 04:50:01,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:50:01,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:50:01,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 04:50:01,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:50:01,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:50:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 04:50:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 04:50:01,508 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 04:50:01,573 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 04:50:01,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:50:01 BasicIcfg [2018-12-03 04:50:01,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 04:50:01,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 04:50:01,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 04:50:01,575 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 04:50:01,575 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:49:44" (3/4) ... [2018-12-03 04:50:01,577 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 04:50:01,646 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_24162506-2125-43af-9117-b1edc370f541/bin-2019/utaipan/witness.graphml [2018-12-03 04:50:01,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 04:50:01,647 INFO L168 Benchmark]: Toolchain (without parser) took 17530.07 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 947.0 MB in the beginning and 1.5 GB in the end (delta: -532.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-03 04:50:01,648 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:50:01,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2018-12-03 04:50:01,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-03 04:50:01,649 INFO L168 Benchmark]: Boogie Preprocessor took 20.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-03 04:50:01,649 INFO L168 Benchmark]: RCFGBuilder took 332.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2018-12-03 04:50:01,649 INFO L168 Benchmark]: TraceAbstraction took 16689.29 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -463.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-03 04:50:01,650 INFO L168 Benchmark]: Witness Printer took 72.06 ms. Allocated memory is still 2.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-12-03 04:50:01,652 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 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 332.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16689.29 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -463.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 72.06 ms. Allocated memory is still 2.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -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] [L679] -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] [L681] -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] [L682] -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] [L683] -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] [L684] -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] [L685] -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] [L686] -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] [L687] -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_buff1_thd0=0] [L688] -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_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L697] -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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L770] -1 pthread_t t1295; 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L771] FCALL, FORK -1 pthread_create(&t1295, ((void *)0), P0, ((void *)0)) 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L772] -1 pthread_t t1296; 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L4] COND FALSE 0 !(!expression) 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L773] FCALL, FORK -1 pthread_create(&t1296, ((void *)0), P1, ((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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y 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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L736] EXPR 1 !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=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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L736] 1 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) [L737] EXPR 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)) 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=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L737] 1 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)) [L738] EXPR 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)) 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=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] 1 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)) [L739] EXPR 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)) 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=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L739] 1 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)) [L740] EXPR 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)) 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=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 1 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)) [L741] EXPR 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)) 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=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L741] 1 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)) [L742] EXPR 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)) 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=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L742] 1 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)) [L743] 1 __unbuffered_p1_EAX = y 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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y 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=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used 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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used 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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 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=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L779] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L779] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L779] -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) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L781] -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 [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L783] -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 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 16.6s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 8.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8248 SDtfs, 9860 SDslu, 19667 SDs, 0 SdLazy, 9084 SolverSat, 412 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 76 SyntacticMatches, 40 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35807occurred in iteration=14, 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: 4.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 73526 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2280 NumberOfCodeBlocks, 2280 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2155 ConstructedInterpolants, 0 QuantifiedInterpolants, 523114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...