./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/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 54a23cce3ec9181a48f7c50dd7775a17f971cb40 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 09:27:27,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:27:27,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:27:27,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:27:27,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:27:27,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:27:27,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:27:27,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:27:27,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:27:27,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:27:27,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:27:27,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:27:27,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:27:27,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:27:27,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:27:27,430 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:27:27,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:27:27,432 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:27:27,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:27:27,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:27:27,434 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:27:27,435 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:27:27,436 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:27:27,436 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:27:27,436 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:27:27,437 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:27:27,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:27:27,438 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:27:27,438 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:27:27,439 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:27:27,439 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:27:27,439 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:27:27,439 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:27:27,440 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:27:27,440 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:27:27,441 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:27:27,441 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 09:27:27,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:27:27,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:27:27,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:27:27,449 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:27:27,449 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:27:27,449 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:27:27,449 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:27:27,449 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:27:27,449 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:27:27,450 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:27:27,450 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:27:27,450 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:27:27,450 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:27:27,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:27:27,450 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:27:27,451 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:27:27,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:27:27,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:27:27,451 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:27:27,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:27:27,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:27:27,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:27:27,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:27:27,452 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:27:27,452 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:27:27,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:27:27,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:27:27,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:27:27,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:27:27,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:27:27,452 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:27:27,453 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:27:27,453 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:27:27,453 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:27:27,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:27:27,453 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 09:27:27,453 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_3d570625-f168-4b40-9c84-5903f62313db/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 -> 54a23cce3ec9181a48f7c50dd7775a17f971cb40 [2018-12-09 09:27:27,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:27:27,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:27:27,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:27:27,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:27:27,480 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:27:27,481 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix012_tso.opt_false-unreach-call.i [2018-12-09 09:27:27,516 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/bin-2019/utaipan/data/4588b950a/79196fb192d04b65ad5ca33dd6dec279/FLAG5bcafcc0f [2018-12-09 09:27:27,927 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:27:27,927 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/sv-benchmarks/c/pthread-wmm/mix012_tso.opt_false-unreach-call.i [2018-12-09 09:27:27,934 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/bin-2019/utaipan/data/4588b950a/79196fb192d04b65ad5ca33dd6dec279/FLAG5bcafcc0f [2018-12-09 09:27:28,255 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/bin-2019/utaipan/data/4588b950a/79196fb192d04b65ad5ca33dd6dec279 [2018-12-09 09:27:28,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:27:28,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:27:28,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:27:28,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:27:28,261 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:27:28,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:27:28" (1/1) ... [2018-12-09 09:27:28,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28, skipping insertion in model container [2018-12-09 09:27:28,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:27:28" (1/1) ... [2018-12-09 09:27:28,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:27:28,298 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:27:28,507 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:27:28,515 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:27:28,590 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:27:28,621 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:27:28,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28 WrapperNode [2018-12-09 09:27:28,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:27:28,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:27:28,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:27:28,622 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:27:28,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28" (1/1) ... [2018-12-09 09:27:28,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28" (1/1) ... [2018-12-09 09:27:28,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:27:28,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:27:28,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:27:28,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:27:28,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28" (1/1) ... [2018-12-09 09:27:28,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28" (1/1) ... [2018-12-09 09:27:28,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28" (1/1) ... [2018-12-09 09:27:28,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28" (1/1) ... [2018-12-09 09:27:28,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28" (1/1) ... [2018-12-09 09:27:28,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28" (1/1) ... [2018-12-09 09:27:28,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28" (1/1) ... [2018-12-09 09:27:28,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:27:28,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:27:28,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:27:28,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:27:28,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/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-09 09:27:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:27:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:27:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 09:27:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:27:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 09:27:28,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 09:27:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 09:27:28,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 09:27:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 09:27:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:27:28,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:27:28,723 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 09:27:29,110 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:27:29,110 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 09:27:29,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:27:29 BoogieIcfgContainer [2018-12-09 09:27:29,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:27:29,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:27:29,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:27:29,113 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:27:29,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:27:28" (1/3) ... [2018-12-09 09:27:29,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fb021f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:27:29, skipping insertion in model container [2018-12-09 09:27:29,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:27:28" (2/3) ... [2018-12-09 09:27:29,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fb021f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:27:29, skipping insertion in model container [2018-12-09 09:27:29,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:27:29" (3/3) ... [2018-12-09 09:27:29,115 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_tso.opt_false-unreach-call.i [2018-12-09 09:27:29,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,140 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,140 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,140 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,146 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,147 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,148 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,149 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,150 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,150 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,150 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,150 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,150 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,153 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,154 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,157 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,158 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,159 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:27:29,166 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 09:27:29,166 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:27:29,172 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 09:27:29,181 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 09:27:29,195 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:27:29,195 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:27:29,195 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:27:29,195 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:27:29,195 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:27:29,195 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:27:29,195 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:27:29,195 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:27:29,202 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173places, 226 transitions [2018-12-09 09:27:34,570 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83127 states. [2018-12-09 09:27:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 83127 states. [2018-12-09 09:27:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 09:27:34,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:34,577 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] [2018-12-09 09:27:34,579 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:34,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:34,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1968553448, now seen corresponding path program 1 times [2018-12-09 09:27:34,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:34,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:34,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:34,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:34,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:34,732 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-09 09:27:34,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:34,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:27:34,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:34,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:27:34,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:27:34,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:27:34,746 INFO L87 Difference]: Start difference. First operand 83127 states. Second operand 4 states. [2018-12-09 09:27:35,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:35,540 INFO L93 Difference]: Finished difference Result 150583 states and 603160 transitions. [2018-12-09 09:27:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:27:35,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 09:27:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:36,089 INFO L225 Difference]: With dead ends: 150583 [2018-12-09 09:27:36,089 INFO L226 Difference]: Without dead ends: 105839 [2018-12-09 09:27:36,090 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-09 09:27:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105839 states. [2018-12-09 09:27:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105839 to 61235. [2018-12-09 09:27:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61235 states. [2018-12-09 09:27:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61235 states to 61235 states and 248290 transitions. [2018-12-09 09:27:38,185 INFO L78 Accepts]: Start accepts. Automaton has 61235 states and 248290 transitions. Word has length 38 [2018-12-09 09:27:38,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:38,186 INFO L480 AbstractCegarLoop]: Abstraction has 61235 states and 248290 transitions. [2018-12-09 09:27:38,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:27:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 61235 states and 248290 transitions. [2018-12-09 09:27:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 09:27:38,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:38,191 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-09 09:27:38,191 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:38,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:38,192 INFO L82 PathProgramCache]: Analyzing trace with hash 40051689, now seen corresponding path program 1 times [2018-12-09 09:27:38,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:38,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:38,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:38,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:38,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:38,233 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-09 09:27:38,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:38,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:27:38,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:38,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:27:38,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:27:38,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:27:38,235 INFO L87 Difference]: Start difference. First operand 61235 states and 248290 transitions. Second operand 4 states. [2018-12-09 09:27:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:38,349 INFO L93 Difference]: Finished difference Result 14309 states and 48363 transitions. [2018-12-09 09:27:38,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:27:38,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-09 09:27:38,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:38,368 INFO L225 Difference]: With dead ends: 14309 [2018-12-09 09:27:38,369 INFO L226 Difference]: Without dead ends: 11489 [2018-12-09 09:27:38,369 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-09 09:27:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11489 states. [2018-12-09 09:27:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11489 to 11489. [2018-12-09 09:27:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2018-12-09 09:27:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 37854 transitions. [2018-12-09 09:27:38,511 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 37854 transitions. Word has length 46 [2018-12-09 09:27:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:38,511 INFO L480 AbstractCegarLoop]: Abstraction has 11489 states and 37854 transitions. [2018-12-09 09:27:38,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:27:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 37854 transitions. [2018-12-09 09:27:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 09:27:38,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:38,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:38,512 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:38,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:38,513 INFO L82 PathProgramCache]: Analyzing trace with hash 440126257, now seen corresponding path program 1 times [2018-12-09 09:27:38,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:38,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:38,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:27:38,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:38,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:27:38,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:38,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:27:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:27:38,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:27:38,559 INFO L87 Difference]: Start difference. First operand 11489 states and 37854 transitions. Second operand 5 states. [2018-12-09 09:27:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:38,861 INFO L93 Difference]: Finished difference Result 23359 states and 75855 transitions. [2018-12-09 09:27:38,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:27:38,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 09:27:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:38,899 INFO L225 Difference]: With dead ends: 23359 [2018-12-09 09:27:38,899 INFO L226 Difference]: Without dead ends: 23284 [2018-12-09 09:27:38,899 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-09 09:27:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23284 states. [2018-12-09 09:27:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23284 to 15416. [2018-12-09 09:27:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15416 states. [2018-12-09 09:27:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15416 states to 15416 states and 49309 transitions. [2018-12-09 09:27:39,141 INFO L78 Accepts]: Start accepts. Automaton has 15416 states and 49309 transitions. Word has length 47 [2018-12-09 09:27:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:39,142 INFO L480 AbstractCegarLoop]: Abstraction has 15416 states and 49309 transitions. [2018-12-09 09:27:39,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:27:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 15416 states and 49309 transitions. [2018-12-09 09:27:39,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 09:27:39,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:39,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:39,144 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:39,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:39,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1357849833, now seen corresponding path program 1 times [2018-12-09 09:27:39,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:39,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:39,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:39,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:39,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:39,170 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-09 09:27:39,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:39,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:27:39,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:39,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:27:39,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:27:39,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:27:39,171 INFO L87 Difference]: Start difference. First operand 15416 states and 49309 transitions. Second operand 3 states. [2018-12-09 09:27:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:39,354 INFO L93 Difference]: Finished difference Result 28676 states and 90547 transitions. [2018-12-09 09:27:39,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:27:39,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 09:27:39,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:39,392 INFO L225 Difference]: With dead ends: 28676 [2018-12-09 09:27:39,392 INFO L226 Difference]: Without dead ends: 28672 [2018-12-09 09:27:39,393 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-09 09:27:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28672 states. [2018-12-09 09:27:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28672 to 24151. [2018-12-09 09:27:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24151 states. [2018-12-09 09:27:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24151 states to 24151 states and 76315 transitions. [2018-12-09 09:27:39,698 INFO L78 Accepts]: Start accepts. Automaton has 24151 states and 76315 transitions. Word has length 49 [2018-12-09 09:27:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:39,698 INFO L480 AbstractCegarLoop]: Abstraction has 24151 states and 76315 transitions. [2018-12-09 09:27:39,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:27:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 24151 states and 76315 transitions. [2018-12-09 09:27:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 09:27:39,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:39,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:39,701 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:39,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:39,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1316382434, now seen corresponding path program 1 times [2018-12-09 09:27:39,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:39,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:39,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:39,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:39,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:39,757 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-09 09:27:39,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:39,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:27:39,757 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:39,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:27:39,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:27:39,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:27:39,758 INFO L87 Difference]: Start difference. First operand 24151 states and 76315 transitions. Second operand 6 states. [2018-12-09 09:27:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:40,172 INFO L93 Difference]: Finished difference Result 33837 states and 105313 transitions. [2018-12-09 09:27:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:27:40,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 09:27:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:40,215 INFO L225 Difference]: With dead ends: 33837 [2018-12-09 09:27:40,215 INFO L226 Difference]: Without dead ends: 33740 [2018-12-09 09:27:40,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:27:40,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33740 states. [2018-12-09 09:27:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33740 to 23972. [2018-12-09 09:27:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23972 states. [2018-12-09 09:27:40,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23972 states to 23972 states and 75821 transitions. [2018-12-09 09:27:40,519 INFO L78 Accepts]: Start accepts. Automaton has 23972 states and 75821 transitions. Word has length 53 [2018-12-09 09:27:40,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:40,519 INFO L480 AbstractCegarLoop]: Abstraction has 23972 states and 75821 transitions. [2018-12-09 09:27:40,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:27:40,519 INFO L276 IsEmpty]: Start isEmpty. Operand 23972 states and 75821 transitions. [2018-12-09 09:27:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 09:27:40,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:40,524 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] [2018-12-09 09:27:40,524 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:40,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:40,524 INFO L82 PathProgramCache]: Analyzing trace with hash -295007698, now seen corresponding path program 1 times [2018-12-09 09:27:40,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:40,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:40,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:40,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:40,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:40,555 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-09 09:27:40,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:40,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:27:40,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:40,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:27:40,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:27:40,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:27:40,556 INFO L87 Difference]: Start difference. First operand 23972 states and 75821 transitions. Second operand 4 states. [2018-12-09 09:27:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:40,745 INFO L93 Difference]: Finished difference Result 30736 states and 97931 transitions. [2018-12-09 09:27:40,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:27:40,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 09:27:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:40,788 INFO L225 Difference]: With dead ends: 30736 [2018-12-09 09:27:40,788 INFO L226 Difference]: Without dead ends: 30736 [2018-12-09 09:27:40,788 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-09 09:27:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30736 states. [2018-12-09 09:27:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30736 to 27608. [2018-12-09 09:27:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27608 states. [2018-12-09 09:27:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27608 states to 27608 states and 87449 transitions. [2018-12-09 09:27:41,156 INFO L78 Accepts]: Start accepts. Automaton has 27608 states and 87449 transitions. Word has length 63 [2018-12-09 09:27:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:41,156 INFO L480 AbstractCegarLoop]: Abstraction has 27608 states and 87449 transitions. [2018-12-09 09:27:41,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:27:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 27608 states and 87449 transitions. [2018-12-09 09:27:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 09:27:41,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:41,162 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] [2018-12-09 09:27:41,162 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:41,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1447802637, now seen corresponding path program 1 times [2018-12-09 09:27:41,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:41,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:41,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:41,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:41,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:41,220 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-09 09:27:41,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:41,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:27:41,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:41,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:27:41,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:27:41,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:27:41,221 INFO L87 Difference]: Start difference. First operand 27608 states and 87449 transitions. Second operand 5 states. [2018-12-09 09:27:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:41,257 INFO L93 Difference]: Finished difference Result 10332 states and 27416 transitions. [2018-12-09 09:27:41,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:27:41,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-09 09:27:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:41,264 INFO L225 Difference]: With dead ends: 10332 [2018-12-09 09:27:41,264 INFO L226 Difference]: Without dead ends: 8704 [2018-12-09 09:27:41,264 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-09 09:27:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8704 states. [2018-12-09 09:27:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8704 to 7457. [2018-12-09 09:27:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7457 states. [2018-12-09 09:27:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 19345 transitions. [2018-12-09 09:27:41,331 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 19345 transitions. Word has length 63 [2018-12-09 09:27:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:41,331 INFO L480 AbstractCegarLoop]: Abstraction has 7457 states and 19345 transitions. [2018-12-09 09:27:41,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:27:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 19345 transitions. [2018-12-09 09:27:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 09:27:41,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:41,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:41,338 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:41,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1545046450, now seen corresponding path program 1 times [2018-12-09 09:27:41,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:41,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:41,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:41,402 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-09 09:27:41,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:41,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:27:41,402 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:41,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:27:41,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:27:41,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:27:41,403 INFO L87 Difference]: Start difference. First operand 7457 states and 19345 transitions. Second operand 4 states. [2018-12-09 09:27:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:41,552 INFO L93 Difference]: Finished difference Result 8731 states and 22220 transitions. [2018-12-09 09:27:41,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:27:41,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 09:27:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:41,559 INFO L225 Difference]: With dead ends: 8731 [2018-12-09 09:27:41,559 INFO L226 Difference]: Without dead ends: 8731 [2018-12-09 09:27:41,559 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-09 09:27:41,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8731 states. [2018-12-09 09:27:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8731 to 8242. [2018-12-09 09:27:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8242 states. [2018-12-09 09:27:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8242 states to 8242 states and 21101 transitions. [2018-12-09 09:27:41,631 INFO L78 Accepts]: Start accepts. Automaton has 8242 states and 21101 transitions. Word has length 98 [2018-12-09 09:27:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:41,632 INFO L480 AbstractCegarLoop]: Abstraction has 8242 states and 21101 transitions. [2018-12-09 09:27:41,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:27:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 8242 states and 21101 transitions. [2018-12-09 09:27:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 09:27:41,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:41,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:41,639 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:41,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:41,640 INFO L82 PathProgramCache]: Analyzing trace with hash -532162893, now seen corresponding path program 1 times [2018-12-09 09:27:41,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:41,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:41,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:41,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:41,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:41,676 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-09 09:27:41,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:41,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:27:41,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:41,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:27:41,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:27:41,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:27:41,676 INFO L87 Difference]: Start difference. First operand 8242 states and 21101 transitions. Second operand 3 states. [2018-12-09 09:27:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:41,817 INFO L93 Difference]: Finished difference Result 11340 states and 28566 transitions. [2018-12-09 09:27:41,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:27:41,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 09:27:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:41,825 INFO L225 Difference]: With dead ends: 11340 [2018-12-09 09:27:41,825 INFO L226 Difference]: Without dead ends: 11340 [2018-12-09 09:27:41,826 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-09 09:27:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11340 states. [2018-12-09 09:27:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11340 to 10132. [2018-12-09 09:27:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10132 states. [2018-12-09 09:27:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10132 states to 10132 states and 25821 transitions. [2018-12-09 09:27:41,914 INFO L78 Accepts]: Start accepts. Automaton has 10132 states and 25821 transitions. Word has length 98 [2018-12-09 09:27:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:41,914 INFO L480 AbstractCegarLoop]: Abstraction has 10132 states and 25821 transitions. [2018-12-09 09:27:41,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:27:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10132 states and 25821 transitions. [2018-12-09 09:27:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 09:27:41,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:41,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:41,923 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:41,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:41,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1261883293, now seen corresponding path program 2 times [2018-12-09 09:27:41,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:41,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:41,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:41,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:41,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:41,990 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-09 09:27:41,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:41,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:27:41,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:41,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:27:41,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:27:41,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:27:41,991 INFO L87 Difference]: Start difference. First operand 10132 states and 25821 transitions. Second operand 6 states. [2018-12-09 09:27:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:42,357 INFO L93 Difference]: Finished difference Result 13276 states and 33332 transitions. [2018-12-09 09:27:42,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:27:42,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-09 09:27:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:42,368 INFO L225 Difference]: With dead ends: 13276 [2018-12-09 09:27:42,368 INFO L226 Difference]: Without dead ends: 13276 [2018-12-09 09:27:42,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:27:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13276 states. [2018-12-09 09:27:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13276 to 10052. [2018-12-09 09:27:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10052 states. [2018-12-09 09:27:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10052 states to 10052 states and 25278 transitions. [2018-12-09 09:27:42,464 INFO L78 Accepts]: Start accepts. Automaton has 10052 states and 25278 transitions. Word has length 98 [2018-12-09 09:27:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:42,464 INFO L480 AbstractCegarLoop]: Abstraction has 10052 states and 25278 transitions. [2018-12-09 09:27:42,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:27:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 10052 states and 25278 transitions. [2018-12-09 09:27:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 09:27:42,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:42,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:42,474 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:42,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:42,474 INFO L82 PathProgramCache]: Analyzing trace with hash 25050239, now seen corresponding path program 1 times [2018-12-09 09:27:42,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:42,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:42,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:27:42,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:42,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:42,510 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-09 09:27:42,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:42,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:27:42,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:42,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:27:42,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:27:42,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:27:42,511 INFO L87 Difference]: Start difference. First operand 10052 states and 25278 transitions. Second operand 4 states. [2018-12-09 09:27:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:42,598 INFO L93 Difference]: Finished difference Result 10260 states and 25814 transitions. [2018-12-09 09:27:42,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:27:42,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 09:27:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:42,607 INFO L225 Difference]: With dead ends: 10260 [2018-12-09 09:27:42,607 INFO L226 Difference]: Without dead ends: 10260 [2018-12-09 09:27:42,607 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-09 09:27:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10260 states. [2018-12-09 09:27:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10260 to 10116. [2018-12-09 09:27:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10116 states. [2018-12-09 09:27:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10116 states to 10116 states and 25454 transitions. [2018-12-09 09:27:42,691 INFO L78 Accepts]: Start accepts. Automaton has 10116 states and 25454 transitions. Word has length 100 [2018-12-09 09:27:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:42,691 INFO L480 AbstractCegarLoop]: Abstraction has 10116 states and 25454 transitions. [2018-12-09 09:27:42,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:27:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 10116 states and 25454 transitions. [2018-12-09 09:27:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 09:27:42,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:42,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:42,700 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:42,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:42,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1782404224, now seen corresponding path program 1 times [2018-12-09 09:27:42,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:42,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:42,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:42,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:42,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:42,780 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-09 09:27:42,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:42,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:27:42,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:42,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:27:42,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:27:42,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:27:42,781 INFO L87 Difference]: Start difference. First operand 10116 states and 25454 transitions. Second operand 6 states. [2018-12-09 09:27:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:42,993 INFO L93 Difference]: Finished difference Result 12047 states and 30060 transitions. [2018-12-09 09:27:42,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:27:42,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 09:27:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:43,003 INFO L225 Difference]: With dead ends: 12047 [2018-12-09 09:27:43,003 INFO L226 Difference]: Without dead ends: 12015 [2018-12-09 09:27:43,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:27:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12015 states. [2018-12-09 09:27:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12015 to 11096. [2018-12-09 09:27:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11096 states. [2018-12-09 09:27:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11096 states to 11096 states and 27828 transitions. [2018-12-09 09:27:43,094 INFO L78 Accepts]: Start accepts. Automaton has 11096 states and 27828 transitions. Word has length 100 [2018-12-09 09:27:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:43,094 INFO L480 AbstractCegarLoop]: Abstraction has 11096 states and 27828 transitions. [2018-12-09 09:27:43,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:27:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 11096 states and 27828 transitions. [2018-12-09 09:27:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 09:27:43,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:43,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:43,103 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:43,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash 715611713, now seen corresponding path program 1 times [2018-12-09 09:27:43,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:43,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:43,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:27:43,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:43,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:27:43,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:43,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:27:43,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:27:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:27:43,182 INFO L87 Difference]: Start difference. First operand 11096 states and 27828 transitions. Second operand 7 states. [2018-12-09 09:27:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:43,577 INFO L93 Difference]: Finished difference Result 15779 states and 39549 transitions. [2018-12-09 09:27:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 09:27:43,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 09:27:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:43,590 INFO L225 Difference]: With dead ends: 15779 [2018-12-09 09:27:43,590 INFO L226 Difference]: Without dead ends: 15779 [2018-12-09 09:27:43,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:27:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15779 states. [2018-12-09 09:27:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15779 to 12143. [2018-12-09 09:27:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12143 states. [2018-12-09 09:27:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12143 states to 12143 states and 30559 transitions. [2018-12-09 09:27:43,745 INFO L78 Accepts]: Start accepts. Automaton has 12143 states and 30559 transitions. Word has length 100 [2018-12-09 09:27:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:43,745 INFO L480 AbstractCegarLoop]: Abstraction has 12143 states and 30559 transitions. [2018-12-09 09:27:43,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:27:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 12143 states and 30559 transitions. [2018-12-09 09:27:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 09:27:43,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:43,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:43,758 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:43,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:43,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1603115394, now seen corresponding path program 1 times [2018-12-09 09:27:43,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:43,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:43,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:43,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:43,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:43,786 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-09 09:27:43,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:43,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 09:27:43,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:43,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 09:27:43,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 09:27:43,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 09:27:43,787 INFO L87 Difference]: Start difference. First operand 12143 states and 30559 transitions. Second operand 3 states. [2018-12-09 09:27:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:43,831 INFO L93 Difference]: Finished difference Result 14682 states and 36624 transitions. [2018-12-09 09:27:43,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 09:27:43,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-09 09:27:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:43,844 INFO L225 Difference]: With dead ends: 14682 [2018-12-09 09:27:43,844 INFO L226 Difference]: Without dead ends: 14682 [2018-12-09 09:27:43,844 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-09 09:27:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14682 states. [2018-12-09 09:27:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14682 to 14613. [2018-12-09 09:27:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14613 states. [2018-12-09 09:27:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14613 states to 14613 states and 36481 transitions. [2018-12-09 09:27:43,982 INFO L78 Accepts]: Start accepts. Automaton has 14613 states and 36481 transitions. Word has length 100 [2018-12-09 09:27:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:43,982 INFO L480 AbstractCegarLoop]: Abstraction has 14613 states and 36481 transitions. [2018-12-09 09:27:43,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 09:27:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 14613 states and 36481 transitions. [2018-12-09 09:27:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 09:27:43,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:43,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:43,997 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:43,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash 758643523, now seen corresponding path program 1 times [2018-12-09 09:27:43,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:43,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:43,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:43,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:43,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:44,085 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-09 09:27:44,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:44,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:27:44,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:44,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:27:44,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:27:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:27:44,086 INFO L87 Difference]: Start difference. First operand 14613 states and 36481 transitions. Second operand 6 states. [2018-12-09 09:27:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:44,279 INFO L93 Difference]: Finished difference Result 16828 states and 41580 transitions. [2018-12-09 09:27:44,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:27:44,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 09:27:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:44,292 INFO L225 Difference]: With dead ends: 16828 [2018-12-09 09:27:44,292 INFO L226 Difference]: Without dead ends: 16828 [2018-12-09 09:27:44,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:27:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16828 states. [2018-12-09 09:27:44,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16828 to 14636. [2018-12-09 09:27:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14636 states. [2018-12-09 09:27:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14636 states to 14636 states and 36552 transitions. [2018-12-09 09:27:44,425 INFO L78 Accepts]: Start accepts. Automaton has 14636 states and 36552 transitions. Word has length 100 [2018-12-09 09:27:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:44,425 INFO L480 AbstractCegarLoop]: Abstraction has 14636 states and 36552 transitions. [2018-12-09 09:27:44,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:27:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 14636 states and 36552 transitions. [2018-12-09 09:27:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 09:27:44,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:44,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:44,437 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:44,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:44,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2128050849, now seen corresponding path program 1 times [2018-12-09 09:27:44,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:44,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:44,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:44,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:44,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:44,508 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-09 09:27:44,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:44,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:27:44,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:44,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:27:44,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:27:44,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:27:44,509 INFO L87 Difference]: Start difference. First operand 14636 states and 36552 transitions. Second operand 6 states. [2018-12-09 09:27:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:44,613 INFO L93 Difference]: Finished difference Result 14332 states and 35536 transitions. [2018-12-09 09:27:44,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:27:44,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 09:27:44,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:44,624 INFO L225 Difference]: With dead ends: 14332 [2018-12-09 09:27:44,624 INFO L226 Difference]: Without dead ends: 14332 [2018-12-09 09:27:44,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:27:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14332 states. [2018-12-09 09:27:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14332 to 11869. [2018-12-09 09:27:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11869 states. [2018-12-09 09:27:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 29691 transitions. [2018-12-09 09:27:44,737 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 29691 transitions. Word has length 100 [2018-12-09 09:27:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:44,737 INFO L480 AbstractCegarLoop]: Abstraction has 11869 states and 29691 transitions. [2018-12-09 09:27:44,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:27:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 29691 transitions. [2018-12-09 09:27:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 09:27:44,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:44,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:44,747 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:44,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:44,747 INFO L82 PathProgramCache]: Analyzing trace with hash 976935770, now seen corresponding path program 1 times [2018-12-09 09:27:44,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:44,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:44,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:44,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:44,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:44,786 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-09 09:27:44,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:44,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:27:44,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:44,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:27:44,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:27:44,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:27:44,787 INFO L87 Difference]: Start difference. First operand 11869 states and 29691 transitions. Second operand 5 states. [2018-12-09 09:27:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:44,946 INFO L93 Difference]: Finished difference Result 14205 states and 34825 transitions. [2018-12-09 09:27:44,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:27:44,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 09:27:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:44,957 INFO L225 Difference]: With dead ends: 14205 [2018-12-09 09:27:44,957 INFO L226 Difference]: Without dead ends: 14205 [2018-12-09 09:27:44,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-09 09:27:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14205 states. [2018-12-09 09:27:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14205 to 12549. [2018-12-09 09:27:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12549 states. [2018-12-09 09:27:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12549 states to 12549 states and 31152 transitions. [2018-12-09 09:27:45,072 INFO L78 Accepts]: Start accepts. Automaton has 12549 states and 31152 transitions. Word has length 100 [2018-12-09 09:27:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:45,072 INFO L480 AbstractCegarLoop]: Abstraction has 12549 states and 31152 transitions. [2018-12-09 09:27:45,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:27:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 12549 states and 31152 transitions. [2018-12-09 09:27:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 09:27:45,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:45,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:45,082 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:45,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:45,083 INFO L82 PathProgramCache]: Analyzing trace with hash 75286275, now seen corresponding path program 1 times [2018-12-09 09:27:45,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:45,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:45,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:45,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:45,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:45,151 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-09 09:27:45,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:45,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:27:45,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:45,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:27:45,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:27:45,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:27:45,152 INFO L87 Difference]: Start difference. First operand 12549 states and 31152 transitions. Second operand 7 states. [2018-12-09 09:27:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:45,396 INFO L93 Difference]: Finished difference Result 19451 states and 47660 transitions. [2018-12-09 09:27:45,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:27:45,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 09:27:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:45,417 INFO L225 Difference]: With dead ends: 19451 [2018-12-09 09:27:45,417 INFO L226 Difference]: Without dead ends: 19329 [2018-12-09 09:27:45,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:27:45,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19329 states. [2018-12-09 09:27:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19329 to 14315. [2018-12-09 09:27:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14315 states. [2018-12-09 09:27:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14315 states to 14315 states and 35494 transitions. [2018-12-09 09:27:45,583 INFO L78 Accepts]: Start accepts. Automaton has 14315 states and 35494 transitions. Word has length 102 [2018-12-09 09:27:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:45,584 INFO L480 AbstractCegarLoop]: Abstraction has 14315 states and 35494 transitions. [2018-12-09 09:27:45,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:27:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 14315 states and 35494 transitions. [2018-12-09 09:27:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 09:27:45,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:45,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:45,594 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:45,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:45,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2001923068, now seen corresponding path program 1 times [2018-12-09 09:27:45,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:45,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:45,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:45,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:45,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:45,665 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-09 09:27:45,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:45,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:27:45,666 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:45,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:27:45,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:27:45,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:27:45,666 INFO L87 Difference]: Start difference. First operand 14315 states and 35494 transitions. Second operand 7 states. [2018-12-09 09:27:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:45,981 INFO L93 Difference]: Finished difference Result 19900 states and 47943 transitions. [2018-12-09 09:27:45,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 09:27:45,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 09:27:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:46,004 INFO L225 Difference]: With dead ends: 19900 [2018-12-09 09:27:46,004 INFO L226 Difference]: Without dead ends: 19900 [2018-12-09 09:27:46,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:27:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19900 states. [2018-12-09 09:27:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19900 to 15999. [2018-12-09 09:27:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15999 states. [2018-12-09 09:27:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15999 states to 15999 states and 39075 transitions. [2018-12-09 09:27:46,178 INFO L78 Accepts]: Start accepts. Automaton has 15999 states and 39075 transitions. Word has length 102 [2018-12-09 09:27:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:46,178 INFO L480 AbstractCegarLoop]: Abstraction has 15999 states and 39075 transitions. [2018-12-09 09:27:46,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:27:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 15999 states and 39075 transitions. [2018-12-09 09:27:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 09:27:46,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:46,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:46,191 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:46,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1790572155, now seen corresponding path program 1 times [2018-12-09 09:27:46,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:46,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:46,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:46,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:46,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:46,294 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-09 09:27:46,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:46,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 09:27:46,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:46,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:27:46,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:27:46,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:27:46,295 INFO L87 Difference]: Start difference. First operand 15999 states and 39075 transitions. Second operand 11 states. [2018-12-09 09:27:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:47,240 INFO L93 Difference]: Finished difference Result 26131 states and 63002 transitions. [2018-12-09 09:27:47,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 09:27:47,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2018-12-09 09:27:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:47,262 INFO L225 Difference]: With dead ends: 26131 [2018-12-09 09:27:47,262 INFO L226 Difference]: Without dead ends: 26131 [2018-12-09 09:27:47,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-12-09 09:27:47,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26131 states. [2018-12-09 09:27:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26131 to 21591. [2018-12-09 09:27:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21591 states. [2018-12-09 09:27:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21591 states to 21591 states and 52719 transitions. [2018-12-09 09:27:47,500 INFO L78 Accepts]: Start accepts. Automaton has 21591 states and 52719 transitions. Word has length 102 [2018-12-09 09:27:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:47,500 INFO L480 AbstractCegarLoop]: Abstraction has 21591 states and 52719 transitions. [2018-12-09 09:27:47,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:27:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 21591 states and 52719 transitions. [2018-12-09 09:27:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 09:27:47,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:47,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:47,516 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:47,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash -903068474, now seen corresponding path program 1 times [2018-12-09 09:27:47,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:47,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:47,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:27:47,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:47,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 09:27:47,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:47,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 09:27:47,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 09:27:47,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:27:47,598 INFO L87 Difference]: Start difference. First operand 21591 states and 52719 transitions. Second operand 9 states. [2018-12-09 09:27:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:47,755 INFO L93 Difference]: Finished difference Result 22415 states and 54639 transitions. [2018-12-09 09:27:47,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:27:47,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-12-09 09:27:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:47,760 INFO L225 Difference]: With dead ends: 22415 [2018-12-09 09:27:47,760 INFO L226 Difference]: Without dead ends: 4476 [2018-12-09 09:27:47,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:27:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2018-12-09 09:27:47,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 4474. [2018-12-09 09:27:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4474 states. [2018-12-09 09:27:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 10937 transitions. [2018-12-09 09:27:47,806 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 10937 transitions. Word has length 102 [2018-12-09 09:27:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:47,806 INFO L480 AbstractCegarLoop]: Abstraction has 4474 states and 10937 transitions. [2018-12-09 09:27:47,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 09:27:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 10937 transitions. [2018-12-09 09:27:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 09:27:47,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:47,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:47,811 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:47,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:47,811 INFO L82 PathProgramCache]: Analyzing trace with hash 190053119, now seen corresponding path program 1 times [2018-12-09 09:27:47,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:47,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:47,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:47,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:47,859 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-09 09:27:47,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:47,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:27:47,859 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:47,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:27:47,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:27:47,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:27:47,860 INFO L87 Difference]: Start difference. First operand 4474 states and 10937 transitions. Second operand 5 states. [2018-12-09 09:27:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:47,985 INFO L93 Difference]: Finished difference Result 4968 states and 12000 transitions. [2018-12-09 09:27:47,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:27:47,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 09:27:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:47,989 INFO L225 Difference]: With dead ends: 4968 [2018-12-09 09:27:47,989 INFO L226 Difference]: Without dead ends: 4934 [2018-12-09 09:27:47,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:27:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2018-12-09 09:27:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4475. [2018-12-09 09:27:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4475 states. [2018-12-09 09:27:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 10940 transitions. [2018-12-09 09:27:48,022 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 10940 transitions. Word has length 102 [2018-12-09 09:27:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:48,023 INFO L480 AbstractCegarLoop]: Abstraction has 4475 states and 10940 transitions. [2018-12-09 09:27:48,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:27:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 10940 transitions. [2018-12-09 09:27:48,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 09:27:48,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:48,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:48,026 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:48,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:48,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1933107847, now seen corresponding path program 2 times [2018-12-09 09:27:48,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:48,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:27:48,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:48,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:48,113 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-09 09:27:48,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:48,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:27:48,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:48,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:27:48,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:27:48,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:27:48,113 INFO L87 Difference]: Start difference. First operand 4475 states and 10940 transitions. Second operand 8 states. [2018-12-09 09:27:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:48,308 INFO L93 Difference]: Finished difference Result 4900 states and 11910 transitions. [2018-12-09 09:27:48,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:27:48,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-12-09 09:27:48,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:48,312 INFO L225 Difference]: With dead ends: 4900 [2018-12-09 09:27:48,313 INFO L226 Difference]: Without dead ends: 4900 [2018-12-09 09:27:48,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:27:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4900 states. [2018-12-09 09:27:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4900 to 4285. [2018-12-09 09:27:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4285 states. [2018-12-09 09:27:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 10472 transitions. [2018-12-09 09:27:48,350 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 10472 transitions. Word has length 102 [2018-12-09 09:27:48,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:48,351 INFO L480 AbstractCegarLoop]: Abstraction has 4285 states and 10472 transitions. [2018-12-09 09:27:48,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:27:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 10472 transitions. [2018-12-09 09:27:48,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 09:27:48,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:48,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:48,354 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:48,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:48,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1045604166, now seen corresponding path program 2 times [2018-12-09 09:27:48,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:48,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:48,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:27:48,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:48,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:27:48,476 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-09 09:27:48,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:27:48,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 09:27:48,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:27:48,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 09:27:48,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 09:27:48,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 09:27:48,477 INFO L87 Difference]: Start difference. First operand 4285 states and 10472 transitions. Second operand 13 states. [2018-12-09 09:27:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:27:48,886 INFO L93 Difference]: Finished difference Result 6842 states and 16412 transitions. [2018-12-09 09:27:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 09:27:48,886 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-12-09 09:27:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:27:48,889 INFO L225 Difference]: With dead ends: 6842 [2018-12-09 09:27:48,890 INFO L226 Difference]: Without dead ends: 5106 [2018-12-09 09:27:48,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-09 09:27:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5106 states. [2018-12-09 09:27:48,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5106 to 4375. [2018-12-09 09:27:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4375 states. [2018-12-09 09:27:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 10623 transitions. [2018-12-09 09:27:48,920 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 10623 transitions. Word has length 102 [2018-12-09 09:27:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:27:48,921 INFO L480 AbstractCegarLoop]: Abstraction has 4375 states and 10623 transitions. [2018-12-09 09:27:48,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 09:27:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 10623 transitions. [2018-12-09 09:27:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 09:27:48,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:27:48,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:27:48,923 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:27:48,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:27:48,924 INFO L82 PathProgramCache]: Analyzing trace with hash -632751752, now seen corresponding path program 3 times [2018-12-09 09:27:48,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:27:48,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:48,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:27:48,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:27:48,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:27:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:27:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:27:48,961 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:27:49,032 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 09:27:49,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:27:49 BasicIcfg [2018-12-09 09:27:49,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:27:49,033 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:27:49,033 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:27:49,033 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:27:49,034 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:27:29" (3/4) ... [2018-12-09 09:27:49,035 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 09:27:49,109 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3d570625-f168-4b40-9c84-5903f62313db/bin-2019/utaipan/witness.graphml [2018-12-09 09:27:49,109 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:27:49,109 INFO L168 Benchmark]: Toolchain (without parser) took 20851.96 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 947.0 MB in the beginning and 1.8 GB in the end (delta: -867.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-09 09:27:49,110 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:27:49,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -121.1 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2018-12-09 09:27:49,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:27:49,110 INFO L168 Benchmark]: Boogie Preprocessor took 22.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:27:49,110 INFO L168 Benchmark]: RCFGBuilder took 431.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2018-12-09 09:27:49,111 INFO L168 Benchmark]: TraceAbstraction took 19921.79 ms. Allocated memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -849.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-09 09:27:49,111 INFO L168 Benchmark]: Witness Printer took 75.40 ms. Allocated memory is still 3.2 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:27:49,112 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -121.1 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 431.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19921.79 ms. Allocated memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -849.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 75.40 ms. Allocated memory is still 3.2 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L684] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L685] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L686] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L687] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L688] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L689] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L690] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L691] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L692] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L693] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L694] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L695] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L696] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L698] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L784] -1 pthread_t t321; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L785] FCALL, FORK -1 pthread_create(&t321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] -1 pthread_t t322; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] FCALL, FORK -1 pthread_create(&t322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L732] 0 x$w_buff1 = x$w_buff0 [L733] 0 x$w_buff0 = 1 [L734] 0 x$w_buff1_used = x$w_buff0_used [L735] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L738] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L739] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L740] 0 x$r_buff0_thd2 = (_Bool)1 [L743] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L744] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L745] 0 x$flush_delayed = weak$$choice2 [L746] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 0 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L748] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L749] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L750] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L751] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L751] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L752] EXPR 0 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 0 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L753] EXPR 0 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 0 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] 0 x = x$flush_delayed ? x$mem_tmp : x [L756] 0 x$flush_delayed = (_Bool)0 [L759] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L704] 1 y = 1 [L707] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L708] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L709] 1 x$flush_delayed = weak$$choice2 [L710] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L711] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L763] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L711] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L712] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L712] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L713] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L713] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L764] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L714] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L714] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L715] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L715] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L716] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L717] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L717] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L719] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L719] 1 x = x$flush_delayed ? x$mem_tmp : x [L720] 1 x$flush_delayed = (_Bool)0 [L725] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L766] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L794] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L795] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L796] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L797] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L800] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 283 locations, 3 error locations. UNSAFE Result, 19.8s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8190 SDtfs, 8853 SDslu, 20325 SDs, 0 SdLazy, 6336 SolverSat, 347 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83127occurred in iteration=0, 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: 5.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 102398 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2169 NumberOfCodeBlocks, 2169 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2043 ConstructedInterpolants, 0 QuantifiedInterpolants, 430482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...