./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_power.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_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/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 afbf25d75f484a934aa8912c08ac22e74061fce8 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:22:41,609 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:22:41,611 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:22:41,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:22:41,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:22:41,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:22:41,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:22:41,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:22:41,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:22:41,620 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:22:41,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:22:41,621 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:22:41,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:22:41,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:22:41,622 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:22:41,622 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:22:41,623 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:22:41,624 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:22:41,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:22:41,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:22:41,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:22:41,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:22:41,628 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:22:41,628 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:22:41,628 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:22:41,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:22:41,629 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:22:41,629 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:22:41,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:22:41,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:22:41,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:22:41,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:22:41,631 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:22:41,631 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:22:41,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:22:41,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:22:41,632 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 12:22:41,639 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:22:41,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:22:41,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:22:41,640 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:22:41,640 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:22:41,640 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:22:41,640 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:22:41,640 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:22:41,640 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:22:41,641 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:22:41,641 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:22:41,641 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:22:41,641 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:22:41,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:22:41,641 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:22:41,641 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:22:41,641 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:22:41,641 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:22:41,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:22:41,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:22:41,642 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:22:41,642 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:22:41,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:22:41,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:22:41,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:22:41,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:22:41,642 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:22:41,642 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:22:41,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:22:41,642 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:22:41,643 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:22:41,643 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:22:41,643 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:22:41,643 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:22:41,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:22:41,643 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 12:22:41,643 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_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/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 -> afbf25d75f484a934aa8912c08ac22e74061fce8 [2018-12-09 12:22:41,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:22:41,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:22:41,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:22:41,674 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:22:41,675 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:22:41,675 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix054_power.opt_false-unreach-call.i [2018-12-09 12:22:41,721 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/bin-2019/utaipan/data/5fb4ac9c6/42521dcd405c4b74bf2938e995020142/FLAG3564f2334 [2018-12-09 12:22:42,163 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:22:42,164 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/sv-benchmarks/c/pthread-wmm/mix054_power.opt_false-unreach-call.i [2018-12-09 12:22:42,171 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/bin-2019/utaipan/data/5fb4ac9c6/42521dcd405c4b74bf2938e995020142/FLAG3564f2334 [2018-12-09 12:22:42,180 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/bin-2019/utaipan/data/5fb4ac9c6/42521dcd405c4b74bf2938e995020142 [2018-12-09 12:22:42,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:22:42,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:22:42,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:22:42,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:22:42,187 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:22:42,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:22:42" (1/1) ... [2018-12-09 12:22:42,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42, skipping insertion in model container [2018-12-09 12:22:42,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:22:42" (1/1) ... [2018-12-09 12:22:42,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:22:42,216 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:22:42,424 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:22:42,430 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:22:42,495 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:22:42,523 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:22:42,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42 WrapperNode [2018-12-09 12:22:42,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:22:42,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:22:42,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:22:42,524 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:22:42,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42" (1/1) ... [2018-12-09 12:22:42,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42" (1/1) ... [2018-12-09 12:22:42,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:22:42,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:22:42,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:22:42,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:22:42,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42" (1/1) ... [2018-12-09 12:22:42,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42" (1/1) ... [2018-12-09 12:22:42,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42" (1/1) ... [2018-12-09 12:22:42,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42" (1/1) ... [2018-12-09 12:22:42,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42" (1/1) ... [2018-12-09 12:22:42,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42" (1/1) ... [2018-12-09 12:22:42,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42" (1/1) ... [2018-12-09 12:22:42,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:22:42,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:22:42,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:22:42,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:22:42,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/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 12:22:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:22:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:22:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 12:22:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:22:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 12:22:42,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 12:22:42,604 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 12:22:42,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 12:22:42,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 12:22:42,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:22:42,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:22:42,605 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 12:22:42,907 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:22:42,907 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 12:22:42,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:22:42 BoogieIcfgContainer [2018-12-09 12:22:42,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:22:42,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:22:42,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:22:42,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:22:42,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:22:42" (1/3) ... [2018-12-09 12:22:42,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1911d099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:22:42, skipping insertion in model container [2018-12-09 12:22:42,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:42" (2/3) ... [2018-12-09 12:22:42,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1911d099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:22:42, skipping insertion in model container [2018-12-09 12:22:42,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:22:42" (3/3) ... [2018-12-09 12:22:42,911 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.opt_false-unreach-call.i [2018-12-09 12:22:42,936 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,937 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,937 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,937 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,937 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,937 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,937 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,938 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,939 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,940 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,940 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,940 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,940 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,940 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,940 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,940 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,940 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,940 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,941 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:22:42,956 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 12:22:42,956 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:22:42,961 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 12:22:42,970 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 12:22:42,986 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:22:42,987 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:22:42,987 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:22:42,987 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:22:42,987 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:22:42,987 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:22:42,987 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:22:42,987 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:22:42,996 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-09 12:22:44,523 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34805 states. [2018-12-09 12:22:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 34805 states. [2018-12-09 12:22:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 12:22:44,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:44,529 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] [2018-12-09 12:22:44,531 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:44,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:44,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1272153477, now seen corresponding path program 1 times [2018-12-09 12:22:44,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:44,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:44,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:44,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:44,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:44,686 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 12:22:44,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:44,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:22:44,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:44,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:22:44,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:22:44,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:22:44,702 INFO L87 Difference]: Start difference. First operand 34805 states. Second operand 4 states. [2018-12-09 12:22:45,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:45,281 INFO L93 Difference]: Finished difference Result 60789 states and 234492 transitions. [2018-12-09 12:22:45,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:22:45,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-09 12:22:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:45,436 INFO L225 Difference]: With dead ends: 60789 [2018-12-09 12:22:45,436 INFO L226 Difference]: Without dead ends: 44269 [2018-12-09 12:22:45,437 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 12:22:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44269 states. [2018-12-09 12:22:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44269 to 27337. [2018-12-09 12:22:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27337 states. [2018-12-09 12:22:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27337 states to 27337 states and 105498 transitions. [2018-12-09 12:22:46,207 INFO L78 Accepts]: Start accepts. Automaton has 27337 states and 105498 transitions. Word has length 32 [2018-12-09 12:22:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:46,208 INFO L480 AbstractCegarLoop]: Abstraction has 27337 states and 105498 transitions. [2018-12-09 12:22:46,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:22:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 27337 states and 105498 transitions. [2018-12-09 12:22:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 12:22:46,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:46,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:46,212 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:46,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:46,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1559910934, now seen corresponding path program 1 times [2018-12-09 12:22:46,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:46,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:46,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:46,260 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 12:22:46,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:46,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:22:46,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:46,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:22:46,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:22:46,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:22:46,262 INFO L87 Difference]: Start difference. First operand 27337 states and 105498 transitions. Second operand 4 states. [2018-12-09 12:22:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:46,324 INFO L93 Difference]: Finished difference Result 8527 states and 28343 transitions. [2018-12-09 12:22:46,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:22:46,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-09 12:22:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:46,338 INFO L225 Difference]: With dead ends: 8527 [2018-12-09 12:22:46,338 INFO L226 Difference]: Without dead ends: 7465 [2018-12-09 12:22:46,339 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 12:22:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2018-12-09 12:22:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 7465. [2018-12-09 12:22:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7465 states. [2018-12-09 12:22:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7465 states to 7465 states and 24635 transitions. [2018-12-09 12:22:46,426 INFO L78 Accepts]: Start accepts. Automaton has 7465 states and 24635 transitions. Word has length 44 [2018-12-09 12:22:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:46,426 INFO L480 AbstractCegarLoop]: Abstraction has 7465 states and 24635 transitions. [2018-12-09 12:22:46,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:22:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 7465 states and 24635 transitions. [2018-12-09 12:22:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 12:22:46,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:46,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:46,427 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:46,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:46,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1459656693, now seen corresponding path program 1 times [2018-12-09 12:22:46,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:46,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:46,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:46,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:46,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:46,469 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 12:22:46,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:46,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:22:46,469 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:46,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:22:46,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:22:46,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:22:46,469 INFO L87 Difference]: Start difference. First operand 7465 states and 24635 transitions. Second operand 5 states. [2018-12-09 12:22:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:46,678 INFO L93 Difference]: Finished difference Result 13997 states and 45804 transitions. [2018-12-09 12:22:46,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:22:46,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-09 12:22:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:46,696 INFO L225 Difference]: With dead ends: 13997 [2018-12-09 12:22:46,696 INFO L226 Difference]: Without dead ends: 13929 [2018-12-09 12:22:46,696 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 12:22:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13929 states. [2018-12-09 12:22:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13929 to 9440. [2018-12-09 12:22:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9440 states. [2018-12-09 12:22:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9440 states to 9440 states and 30541 transitions. [2018-12-09 12:22:46,820 INFO L78 Accepts]: Start accepts. Automaton has 9440 states and 30541 transitions. Word has length 45 [2018-12-09 12:22:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:46,821 INFO L480 AbstractCegarLoop]: Abstraction has 9440 states and 30541 transitions. [2018-12-09 12:22:46,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:22:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 9440 states and 30541 transitions. [2018-12-09 12:22:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 12:22:46,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:46,822 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 12:22:46,822 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:46,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:46,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1598559727, now seen corresponding path program 1 times [2018-12-09 12:22:46,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:46,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:46,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:46,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:46,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:46,855 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 12:22:46,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:46,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:22:46,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:46,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:22:46,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:22:46,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:22:46,856 INFO L87 Difference]: Start difference. First operand 9440 states and 30541 transitions. Second operand 3 states. [2018-12-09 12:22:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:46,977 INFO L93 Difference]: Finished difference Result 13278 states and 42640 transitions. [2018-12-09 12:22:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:22:46,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-09 12:22:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:46,993 INFO L225 Difference]: With dead ends: 13278 [2018-12-09 12:22:46,993 INFO L226 Difference]: Without dead ends: 13278 [2018-12-09 12:22:46,993 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 12:22:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2018-12-09 12:22:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 9844. [2018-12-09 12:22:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9844 states. [2018-12-09 12:22:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9844 states to 9844 states and 31507 transitions. [2018-12-09 12:22:47,109 INFO L78 Accepts]: Start accepts. Automaton has 9844 states and 31507 transitions. Word has length 47 [2018-12-09 12:22:47,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:47,109 INFO L480 AbstractCegarLoop]: Abstraction has 9844 states and 31507 transitions. [2018-12-09 12:22:47,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:22:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 9844 states and 31507 transitions. [2018-12-09 12:22:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 12:22:47,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:47,110 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] [2018-12-09 12:22:47,110 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:47,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash -108379620, now seen corresponding path program 1 times [2018-12-09 12:22:47,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:47,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:47,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:47,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:47,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:47,175 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 12:22:47,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:47,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:22:47,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:47,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:22:47,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:22:47,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:22:47,176 INFO L87 Difference]: Start difference. First operand 9844 states and 31507 transitions. Second operand 7 states. [2018-12-09 12:22:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:47,532 INFO L93 Difference]: Finished difference Result 12284 states and 38672 transitions. [2018-12-09 12:22:47,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 12:22:47,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-09 12:22:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:47,545 INFO L225 Difference]: With dead ends: 12284 [2018-12-09 12:22:47,545 INFO L226 Difference]: Without dead ends: 12212 [2018-12-09 12:22:47,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 12:22:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2018-12-09 12:22:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 10848. [2018-12-09 12:22:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10848 states. [2018-12-09 12:22:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10848 states to 10848 states and 34562 transitions. [2018-12-09 12:22:47,656 INFO L78 Accepts]: Start accepts. Automaton has 10848 states and 34562 transitions. Word has length 51 [2018-12-09 12:22:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:47,657 INFO L480 AbstractCegarLoop]: Abstraction has 10848 states and 34562 transitions. [2018-12-09 12:22:47,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:22:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 10848 states and 34562 transitions. [2018-12-09 12:22:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 12:22:47,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:47,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:47,660 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:47,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:47,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1204429704, now seen corresponding path program 1 times [2018-12-09 12:22:47,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:47,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:47,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:47,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:47,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:47,693 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 12:22:47,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:47,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:22:47,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:47,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:22:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:22:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:22:47,694 INFO L87 Difference]: Start difference. First operand 10848 states and 34562 transitions. Second operand 4 states. [2018-12-09 12:22:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:47,769 INFO L93 Difference]: Finished difference Result 12395 states and 39571 transitions. [2018-12-09 12:22:47,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:22:47,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 12:22:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:47,783 INFO L225 Difference]: With dead ends: 12395 [2018-12-09 12:22:47,783 INFO L226 Difference]: Without dead ends: 12395 [2018-12-09 12:22:47,783 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 12:22:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12395 states. [2018-12-09 12:22:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12395 to 11368. [2018-12-09 12:22:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11368 states. [2018-12-09 12:22:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11368 states to 11368 states and 36235 transitions. [2018-12-09 12:22:47,901 INFO L78 Accepts]: Start accepts. Automaton has 11368 states and 36235 transitions. Word has length 59 [2018-12-09 12:22:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:47,901 INFO L480 AbstractCegarLoop]: Abstraction has 11368 states and 36235 transitions. [2018-12-09 12:22:47,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:22:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 11368 states and 36235 transitions. [2018-12-09 12:22:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 12:22:47,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:47,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:47,905 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:47,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:47,905 INFO L82 PathProgramCache]: Analyzing trace with hash 538380631, now seen corresponding path program 1 times [2018-12-09 12:22:47,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:47,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:47,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:47,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:47,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:47,969 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 12:22:47,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:47,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:22:47,970 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:47,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:22:47,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:22:47,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:22:47,970 INFO L87 Difference]: Start difference. First operand 11368 states and 36235 transitions. Second operand 6 states. [2018-12-09 12:22:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:48,289 INFO L93 Difference]: Finished difference Result 20968 states and 66485 transitions. [2018-12-09 12:22:48,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:22:48,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-09 12:22:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:48,316 INFO L225 Difference]: With dead ends: 20968 [2018-12-09 12:22:48,316 INFO L226 Difference]: Without dead ends: 20897 [2018-12-09 12:22:48,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:22:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20897 states. [2018-12-09 12:22:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20897 to 13754. [2018-12-09 12:22:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13754 states. [2018-12-09 12:22:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 43279 transitions. [2018-12-09 12:22:48,568 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 43279 transitions. Word has length 59 [2018-12-09 12:22:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:48,569 INFO L480 AbstractCegarLoop]: Abstraction has 13754 states and 43279 transitions. [2018-12-09 12:22:48,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:22:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 43279 transitions. [2018-12-09 12:22:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 12:22:48,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:48,573 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 12:22:48,573 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:48,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:48,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1986786434, now seen corresponding path program 1 times [2018-12-09 12:22:48,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:48,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:48,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:48,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:48,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:48,611 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 12:22:48,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:48,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:22:48,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:48,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:22:48,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:22:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:22:48,612 INFO L87 Difference]: Start difference. First operand 13754 states and 43279 transitions. Second operand 4 states. [2018-12-09 12:22:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:48,838 INFO L93 Difference]: Finished difference Result 20200 states and 61902 transitions. [2018-12-09 12:22:48,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:22:48,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 12:22:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:48,859 INFO L225 Difference]: With dead ends: 20200 [2018-12-09 12:22:48,859 INFO L226 Difference]: Without dead ends: 20200 [2018-12-09 12:22:48,860 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 12:22:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20200 states. [2018-12-09 12:22:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20200 to 15792. [2018-12-09 12:22:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2018-12-09 12:22:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 49060 transitions. [2018-12-09 12:22:49,035 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 49060 transitions. Word has length 63 [2018-12-09 12:22:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:49,035 INFO L480 AbstractCegarLoop]: Abstraction has 15792 states and 49060 transitions. [2018-12-09 12:22:49,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:22:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 49060 transitions. [2018-12-09 12:22:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 12:22:49,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:49,040 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 12:22:49,040 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:49,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1121709459, now seen corresponding path program 1 times [2018-12-09 12:22:49,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:49,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:49,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:49,074 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 12:22:49,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:49,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:22:49,074 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:49,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:22:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:22:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:22:49,075 INFO L87 Difference]: Start difference. First operand 15792 states and 49060 transitions. Second operand 4 states. [2018-12-09 12:22:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:49,273 INFO L93 Difference]: Finished difference Result 19959 states and 61084 transitions. [2018-12-09 12:22:49,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:22:49,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 12:22:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:49,295 INFO L225 Difference]: With dead ends: 19959 [2018-12-09 12:22:49,295 INFO L226 Difference]: Without dead ends: 19959 [2018-12-09 12:22:49,295 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 12:22:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19959 states. [2018-12-09 12:22:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19959 to 16086. [2018-12-09 12:22:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16086 states. [2018-12-09 12:22:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16086 states to 16086 states and 49917 transitions. [2018-12-09 12:22:49,477 INFO L78 Accepts]: Start accepts. Automaton has 16086 states and 49917 transitions. Word has length 63 [2018-12-09 12:22:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:49,477 INFO L480 AbstractCegarLoop]: Abstraction has 16086 states and 49917 transitions. [2018-12-09 12:22:49,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:22:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 16086 states and 49917 transitions. [2018-12-09 12:22:49,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 12:22:49,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:49,482 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 12:22:49,483 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:49,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:49,483 INFO L82 PathProgramCache]: Analyzing trace with hash 866972914, now seen corresponding path program 1 times [2018-12-09 12:22:49,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:49,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:49,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:49,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:49,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:22:49,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:49,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:22:49,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:49,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:22:49,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:22:49,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:22:49,517 INFO L87 Difference]: Start difference. First operand 16086 states and 49917 transitions. Second operand 3 states. [2018-12-09 12:22:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:49,658 INFO L93 Difference]: Finished difference Result 16558 states and 51205 transitions. [2018-12-09 12:22:49,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:22:49,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-09 12:22:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:49,676 INFO L225 Difference]: With dead ends: 16558 [2018-12-09 12:22:49,676 INFO L226 Difference]: Without dead ends: 16558 [2018-12-09 12:22:49,677 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 12:22:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16558 states. [2018-12-09 12:22:49,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16558 to 16322. [2018-12-09 12:22:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16322 states. [2018-12-09 12:22:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16322 states to 16322 states and 50541 transitions. [2018-12-09 12:22:49,918 INFO L78 Accepts]: Start accepts. Automaton has 16322 states and 50541 transitions. Word has length 63 [2018-12-09 12:22:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:49,918 INFO L480 AbstractCegarLoop]: Abstraction has 16322 states and 50541 transitions. [2018-12-09 12:22:49,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:22:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 16322 states and 50541 transitions. [2018-12-09 12:22:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 12:22:49,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:49,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:49,924 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:49,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1567726820, now seen corresponding path program 1 times [2018-12-09 12:22:49,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:49,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:49,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:49,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:49,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:22:49,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:49,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:22:49,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:49,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:22:49,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:22:49,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:22:49,995 INFO L87 Difference]: Start difference. First operand 16322 states and 50541 transitions. Second operand 6 states. [2018-12-09 12:22:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:50,245 INFO L93 Difference]: Finished difference Result 17646 states and 53545 transitions. [2018-12-09 12:22:50,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:22:50,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 12:22:50,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:50,263 INFO L225 Difference]: With dead ends: 17646 [2018-12-09 12:22:50,264 INFO L226 Difference]: Without dead ends: 17646 [2018-12-09 12:22:50,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:22:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17646 states. [2018-12-09 12:22:50,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17646 to 16546. [2018-12-09 12:22:50,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16546 states. [2018-12-09 12:22:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16546 states to 16546 states and 50764 transitions. [2018-12-09 12:22:50,430 INFO L78 Accepts]: Start accepts. Automaton has 16546 states and 50764 transitions. Word has length 65 [2018-12-09 12:22:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:50,431 INFO L480 AbstractCegarLoop]: Abstraction has 16546 states and 50764 transitions. [2018-12-09 12:22:50,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:22:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 16546 states and 50764 transitions. [2018-12-09 12:22:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 12:22:50,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:50,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] [2018-12-09 12:22:50,436 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:50,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:50,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1500720067, now seen corresponding path program 1 times [2018-12-09 12:22:50,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:50,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:50,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:50,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:50,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:22:50,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:50,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:22:50,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:50,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:22:50,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:22:50,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:22:50,489 INFO L87 Difference]: Start difference. First operand 16546 states and 50764 transitions. Second operand 5 states. [2018-12-09 12:22:50,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:50,723 INFO L93 Difference]: Finished difference Result 21334 states and 64873 transitions. [2018-12-09 12:22:50,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:22:50,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 12:22:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:50,745 INFO L225 Difference]: With dead ends: 21334 [2018-12-09 12:22:50,745 INFO L226 Difference]: Without dead ends: 21334 [2018-12-09 12:22:50,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:22:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21334 states. [2018-12-09 12:22:50,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21334 to 19570. [2018-12-09 12:22:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19570 states. [2018-12-09 12:22:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19570 states to 19570 states and 59494 transitions. [2018-12-09 12:22:50,946 INFO L78 Accepts]: Start accepts. Automaton has 19570 states and 59494 transitions. Word has length 65 [2018-12-09 12:22:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:50,946 INFO L480 AbstractCegarLoop]: Abstraction has 19570 states and 59494 transitions. [2018-12-09 12:22:50,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:22:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 19570 states and 59494 transitions. [2018-12-09 12:22:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 12:22:50,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:50,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:50,953 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:50,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash 990185890, now seen corresponding path program 1 times [2018-12-09 12:22:50,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:50,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:50,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:50,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:50,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:50,993 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 12:22:50,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:50,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:22:50,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:50,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:22:50,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:22:50,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:22:50,994 INFO L87 Difference]: Start difference. First operand 19570 states and 59494 transitions. Second operand 5 states. [2018-12-09 12:22:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:51,287 INFO L93 Difference]: Finished difference Result 30156 states and 90237 transitions. [2018-12-09 12:22:51,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:22:51,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 12:22:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:51,320 INFO L225 Difference]: With dead ends: 30156 [2018-12-09 12:22:51,320 INFO L226 Difference]: Without dead ends: 30156 [2018-12-09 12:22:51,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:22:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2018-12-09 12:22:51,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 26760. [2018-12-09 12:22:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26760 states. [2018-12-09 12:22:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26760 states to 26760 states and 80370 transitions. [2018-12-09 12:22:51,652 INFO L78 Accepts]: Start accepts. Automaton has 26760 states and 80370 transitions. Word has length 65 [2018-12-09 12:22:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:51,653 INFO L480 AbstractCegarLoop]: Abstraction has 26760 states and 80370 transitions. [2018-12-09 12:22:51,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:22:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 26760 states and 80370 transitions. [2018-12-09 12:22:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 12:22:51,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:51,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:51,664 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:51,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:51,664 INFO L82 PathProgramCache]: Analyzing trace with hash -817268573, now seen corresponding path program 1 times [2018-12-09 12:22:51,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:51,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:51,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:51,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:51,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:51,719 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 12:22:51,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:51,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:22:51,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:51,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:22:51,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:22:51,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:22:51,720 INFO L87 Difference]: Start difference. First operand 26760 states and 80370 transitions. Second operand 4 states. [2018-12-09 12:22:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:52,168 INFO L93 Difference]: Finished difference Result 36608 states and 110252 transitions. [2018-12-09 12:22:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:22:52,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 12:22:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:52,207 INFO L225 Difference]: With dead ends: 36608 [2018-12-09 12:22:52,207 INFO L226 Difference]: Without dead ends: 36344 [2018-12-09 12:22:52,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:22:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36344 states. [2018-12-09 12:22:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36344 to 33704. [2018-12-09 12:22:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33704 states. [2018-12-09 12:22:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33704 states to 33704 states and 101614 transitions. [2018-12-09 12:22:52,564 INFO L78 Accepts]: Start accepts. Automaton has 33704 states and 101614 transitions. Word has length 65 [2018-12-09 12:22:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:52,564 INFO L480 AbstractCegarLoop]: Abstraction has 33704 states and 101614 transitions. [2018-12-09 12:22:52,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:22:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 33704 states and 101614 transitions. [2018-12-09 12:22:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 12:22:52,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:52,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:52,574 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:52,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:52,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1680747364, now seen corresponding path program 1 times [2018-12-09 12:22:52,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:52,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:52,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:52,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:52,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:52,600 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 12:22:52,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:52,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:22:52,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:52,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:22:52,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:22:52,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:22:52,601 INFO L87 Difference]: Start difference. First operand 33704 states and 101614 transitions. Second operand 5 states. [2018-12-09 12:22:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:52,641 INFO L93 Difference]: Finished difference Result 8356 states and 20403 transitions. [2018-12-09 12:22:52,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:22:52,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 12:22:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:52,646 INFO L225 Difference]: With dead ends: 8356 [2018-12-09 12:22:52,646 INFO L226 Difference]: Without dead ends: 6588 [2018-12-09 12:22:52,647 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 12:22:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2018-12-09 12:22:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 5161. [2018-12-09 12:22:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2018-12-09 12:22:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 12358 transitions. [2018-12-09 12:22:52,689 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 12358 transitions. Word has length 65 [2018-12-09 12:22:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:52,690 INFO L480 AbstractCegarLoop]: Abstraction has 5161 states and 12358 transitions. [2018-12-09 12:22:52,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:22:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 12358 transitions. [2018-12-09 12:22:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 12:22:52,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:52,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:52,693 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:52,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2026999384, now seen corresponding path program 1 times [2018-12-09 12:22:52,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:52,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:52,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:52,708 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 12:22:52,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:52,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:22:52,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:52,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:22:52,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:22:52,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:22:52,709 INFO L87 Difference]: Start difference. First operand 5161 states and 12358 transitions. Second operand 3 states. [2018-12-09 12:22:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:52,740 INFO L93 Difference]: Finished difference Result 7236 states and 17318 transitions. [2018-12-09 12:22:52,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:22:52,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-09 12:22:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:52,747 INFO L225 Difference]: With dead ends: 7236 [2018-12-09 12:22:52,748 INFO L226 Difference]: Without dead ends: 7236 [2018-12-09 12:22:52,748 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 12:22:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2018-12-09 12:22:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 5104. [2018-12-09 12:22:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2018-12-09 12:22:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 11991 transitions. [2018-12-09 12:22:52,792 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 11991 transitions. Word has length 65 [2018-12-09 12:22:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:52,792 INFO L480 AbstractCegarLoop]: Abstraction has 5104 states and 11991 transitions. [2018-12-09 12:22:52,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:22:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 11991 transitions. [2018-12-09 12:22:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 12:22:52,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:52,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:52,796 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:52,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:52,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1343049765, now seen corresponding path program 1 times [2018-12-09 12:22:52,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:52,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:52,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:52,833 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 12:22:52,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:52,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:22:52,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:52,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:22:52,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:22:52,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:22:52,834 INFO L87 Difference]: Start difference. First operand 5104 states and 11991 transitions. Second operand 5 states. [2018-12-09 12:22:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:52,924 INFO L93 Difference]: Finished difference Result 6127 states and 14344 transitions. [2018-12-09 12:22:52,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:22:52,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-09 12:22:52,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:52,929 INFO L225 Difference]: With dead ends: 6127 [2018-12-09 12:22:52,929 INFO L226 Difference]: Without dead ends: 6127 [2018-12-09 12:22:52,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:22:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2018-12-09 12:22:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 5496. [2018-12-09 12:22:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5496 states. [2018-12-09 12:22:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 12892 transitions. [2018-12-09 12:22:52,970 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 12892 transitions. Word has length 71 [2018-12-09 12:22:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:52,970 INFO L480 AbstractCegarLoop]: Abstraction has 5496 states and 12892 transitions. [2018-12-09 12:22:52,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:22:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 12892 transitions. [2018-12-09 12:22:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 12:22:52,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:52,974 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] [2018-12-09 12:22:52,974 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:52,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:52,974 INFO L82 PathProgramCache]: Analyzing trace with hash 399760570, now seen corresponding path program 1 times [2018-12-09 12:22:52,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:52,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:52,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:52,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:52,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:53,101 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 12:22:53,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:53,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 12:22:53,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:53,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 12:22:53,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 12:22:53,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:22:53,101 INFO L87 Difference]: Start difference. First operand 5496 states and 12892 transitions. Second operand 9 states. [2018-12-09 12:22:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:53,385 INFO L93 Difference]: Finished difference Result 7583 states and 17690 transitions. [2018-12-09 12:22:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 12:22:53,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2018-12-09 12:22:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:53,390 INFO L225 Difference]: With dead ends: 7583 [2018-12-09 12:22:53,390 INFO L226 Difference]: Without dead ends: 7528 [2018-12-09 12:22:53,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-09 12:22:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7528 states. [2018-12-09 12:22:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7528 to 5564. [2018-12-09 12:22:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5564 states. [2018-12-09 12:22:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5564 states to 5564 states and 12958 transitions. [2018-12-09 12:22:53,436 INFO L78 Accepts]: Start accepts. Automaton has 5564 states and 12958 transitions. Word has length 71 [2018-12-09 12:22:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:53,436 INFO L480 AbstractCegarLoop]: Abstraction has 5564 states and 12958 transitions. [2018-12-09 12:22:53,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 12:22:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5564 states and 12958 transitions. [2018-12-09 12:22:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 12:22:53,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:53,440 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] [2018-12-09 12:22:53,440 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:53,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash -226879915, now seen corresponding path program 1 times [2018-12-09 12:22:53,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:53,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:53,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:53,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:53,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:53,464 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 12:22:53,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:53,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:22:53,465 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:53,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:22:53,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:22:53,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:22:53,465 INFO L87 Difference]: Start difference. First operand 5564 states and 12958 transitions. Second operand 3 states. [2018-12-09 12:22:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:53,560 INFO L93 Difference]: Finished difference Result 7293 states and 16480 transitions. [2018-12-09 12:22:53,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:22:53,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-09 12:22:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:53,564 INFO L225 Difference]: With dead ends: 7293 [2018-12-09 12:22:53,564 INFO L226 Difference]: Without dead ends: 6965 [2018-12-09 12:22:53,565 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 12:22:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2018-12-09 12:22:53,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6435. [2018-12-09 12:22:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6435 states. [2018-12-09 12:22:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 14760 transitions. [2018-12-09 12:22:53,610 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 14760 transitions. Word has length 90 [2018-12-09 12:22:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:53,610 INFO L480 AbstractCegarLoop]: Abstraction has 6435 states and 14760 transitions. [2018-12-09 12:22:53,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:22:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 14760 transitions. [2018-12-09 12:22:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 12:22:53,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:53,614 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] [2018-12-09 12:22:53,614 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:53,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:53,614 INFO L82 PathProgramCache]: Analyzing trace with hash 871185909, now seen corresponding path program 1 times [2018-12-09 12:22:53,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:53,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:53,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:53,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:53,660 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 12:22:53,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:53,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:22:53,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:53,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:22:53,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:22:53,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:22:53,661 INFO L87 Difference]: Start difference. First operand 6435 states and 14760 transitions. Second operand 4 states. [2018-12-09 12:22:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:53,721 INFO L93 Difference]: Finished difference Result 6823 states and 15667 transitions. [2018-12-09 12:22:53,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:22:53,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-09 12:22:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:53,726 INFO L225 Difference]: With dead ends: 6823 [2018-12-09 12:22:53,726 INFO L226 Difference]: Without dead ends: 6823 [2018-12-09 12:22:53,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:22:53,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2018-12-09 12:22:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 6359. [2018-12-09 12:22:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6359 states. [2018-12-09 12:22:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6359 states to 6359 states and 14673 transitions. [2018-12-09 12:22:53,768 INFO L78 Accepts]: Start accepts. Automaton has 6359 states and 14673 transitions. Word has length 90 [2018-12-09 12:22:53,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:53,769 INFO L480 AbstractCegarLoop]: Abstraction has 6359 states and 14673 transitions. [2018-12-09 12:22:53,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:22:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6359 states and 14673 transitions. [2018-12-09 12:22:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 12:22:53,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:53,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:53,773 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:53,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:53,773 INFO L82 PathProgramCache]: Analyzing trace with hash -71232549, now seen corresponding path program 1 times [2018-12-09 12:22:53,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:53,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:53,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:53,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:53,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:53,810 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 12:22:53,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:53,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:22:53,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:53,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:22:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:22:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:22:53,811 INFO L87 Difference]: Start difference. First operand 6359 states and 14673 transitions. Second operand 5 states. [2018-12-09 12:22:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:53,869 INFO L93 Difference]: Finished difference Result 7324 states and 16774 transitions. [2018-12-09 12:22:53,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:22:53,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 12:22:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:53,874 INFO L225 Difference]: With dead ends: 7324 [2018-12-09 12:22:53,874 INFO L226 Difference]: Without dead ends: 7324 [2018-12-09 12:22:53,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:22:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2018-12-09 12:22:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 5724. [2018-12-09 12:22:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5724 states. [2018-12-09 12:22:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5724 states to 5724 states and 13218 transitions. [2018-12-09 12:22:53,916 INFO L78 Accepts]: Start accepts. Automaton has 5724 states and 13218 transitions. Word has length 92 [2018-12-09 12:22:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:53,916 INFO L480 AbstractCegarLoop]: Abstraction has 5724 states and 13218 transitions. [2018-12-09 12:22:53,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:22:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5724 states and 13218 transitions. [2018-12-09 12:22:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 12:22:53,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:53,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:53,920 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:53,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash -325969094, now seen corresponding path program 1 times [2018-12-09 12:22:53,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:53,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:53,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:53,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:53,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:22:53,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:53,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:22:53,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:53,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:22:53,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:22:53,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:22:53,954 INFO L87 Difference]: Start difference. First operand 5724 states and 13218 transitions. Second operand 5 states. [2018-12-09 12:22:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:54,208 INFO L93 Difference]: Finished difference Result 9776 states and 22784 transitions. [2018-12-09 12:22:54,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:22:54,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 12:22:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:54,214 INFO L225 Difference]: With dead ends: 9776 [2018-12-09 12:22:54,214 INFO L226 Difference]: Without dead ends: 9760 [2018-12-09 12:22:54,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:22:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2018-12-09 12:22:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 6548. [2018-12-09 12:22:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2018-12-09 12:22:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 15152 transitions. [2018-12-09 12:22:54,268 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 15152 transitions. Word has length 92 [2018-12-09 12:22:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:54,268 INFO L480 AbstractCegarLoop]: Abstraction has 6548 states and 15152 transitions. [2018-12-09 12:22:54,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:22:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 15152 transitions. [2018-12-09 12:22:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 12:22:54,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:54,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:54,273 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:54,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:54,273 INFO L82 PathProgramCache]: Analyzing trace with hash 918795387, now seen corresponding path program 1 times [2018-12-09 12:22:54,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:54,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:54,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:54,305 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 12:22:54,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:54,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:22:54,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:54,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:22:54,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:22:54,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:22:54,305 INFO L87 Difference]: Start difference. First operand 6548 states and 15152 transitions. Second operand 6 states. [2018-12-09 12:22:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:54,495 INFO L93 Difference]: Finished difference Result 8814 states and 20118 transitions. [2018-12-09 12:22:54,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 12:22:54,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 12:22:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:54,500 INFO L225 Difference]: With dead ends: 8814 [2018-12-09 12:22:54,500 INFO L226 Difference]: Without dead ends: 8814 [2018-12-09 12:22:54,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:22:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2018-12-09 12:22:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 6687. [2018-12-09 12:22:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6687 states. [2018-12-09 12:22:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 15343 transitions. [2018-12-09 12:22:54,553 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 15343 transitions. Word has length 92 [2018-12-09 12:22:54,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:54,553 INFO L480 AbstractCegarLoop]: Abstraction has 6687 states and 15343 transitions. [2018-12-09 12:22:54,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:22:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 15343 transitions. [2018-12-09 12:22:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 12:22:54,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:54,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:54,558 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:54,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2034234414, now seen corresponding path program 1 times [2018-12-09 12:22:54,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:54,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:54,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:54,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:54,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:54,661 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 12:22:54,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:54,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:22:54,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:54,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:22:54,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:22:54,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:22:54,662 INFO L87 Difference]: Start difference. First operand 6687 states and 15343 transitions. Second operand 7 states. [2018-12-09 12:22:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:54,833 INFO L93 Difference]: Finished difference Result 8708 states and 19628 transitions. [2018-12-09 12:22:54,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:22:54,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-09 12:22:54,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:54,839 INFO L225 Difference]: With dead ends: 8708 [2018-12-09 12:22:54,839 INFO L226 Difference]: Without dead ends: 8600 [2018-12-09 12:22:54,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:22:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8600 states. [2018-12-09 12:22:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8600 to 7161. [2018-12-09 12:22:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7161 states. [2018-12-09 12:22:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7161 states to 7161 states and 16336 transitions. [2018-12-09 12:22:54,892 INFO L78 Accepts]: Start accepts. Automaton has 7161 states and 16336 transitions. Word has length 92 [2018-12-09 12:22:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:54,892 INFO L480 AbstractCegarLoop]: Abstraction has 7161 states and 16336 transitions. [2018-12-09 12:22:54,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:22:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 7161 states and 16336 transitions. [2018-12-09 12:22:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 12:22:54,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:54,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:54,898 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:54,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:54,898 INFO L82 PathProgramCache]: Analyzing trace with hash -42974929, now seen corresponding path program 1 times [2018-12-09 12:22:54,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:54,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:54,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:54,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:54,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:22:54,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:54,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 12:22:54,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:54,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 12:22:54,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 12:22:54,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:22:54,980 INFO L87 Difference]: Start difference. First operand 7161 states and 16336 transitions. Second operand 9 states. [2018-12-09 12:22:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:55,325 INFO L93 Difference]: Finished difference Result 10311 states and 23437 transitions. [2018-12-09 12:22:55,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 12:22:55,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2018-12-09 12:22:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:55,332 INFO L225 Difference]: With dead ends: 10311 [2018-12-09 12:22:55,332 INFO L226 Difference]: Without dead ends: 10279 [2018-12-09 12:22:55,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-09 12:22:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10279 states. [2018-12-09 12:22:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10279 to 8967. [2018-12-09 12:22:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8967 states. [2018-12-09 12:22:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8967 states to 8967 states and 20311 transitions. [2018-12-09 12:22:55,401 INFO L78 Accepts]: Start accepts. Automaton has 8967 states and 20311 transitions. Word has length 92 [2018-12-09 12:22:55,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:55,402 INFO L480 AbstractCegarLoop]: Abstraction has 8967 states and 20311 transitions. [2018-12-09 12:22:55,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 12:22:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 8967 states and 20311 transitions. [2018-12-09 12:22:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 12:22:55,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:55,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:55,408 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:55,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:55,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1839926288, now seen corresponding path program 1 times [2018-12-09 12:22:55,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:55,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:55,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:55,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:55,468 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 12:22:55,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:55,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:22:55,468 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:55,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:22:55,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:22:55,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:22:55,469 INFO L87 Difference]: Start difference. First operand 8967 states and 20311 transitions. Second operand 8 states. [2018-12-09 12:22:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:55,769 INFO L93 Difference]: Finished difference Result 13472 states and 31134 transitions. [2018-12-09 12:22:55,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:22:55,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-09 12:22:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:55,778 INFO L225 Difference]: With dead ends: 13472 [2018-12-09 12:22:55,778 INFO L226 Difference]: Without dead ends: 13472 [2018-12-09 12:22:55,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 12:22:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13472 states. [2018-12-09 12:22:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13472 to 9477. [2018-12-09 12:22:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9477 states. [2018-12-09 12:22:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9477 states to 9477 states and 21668 transitions. [2018-12-09 12:22:55,866 INFO L78 Accepts]: Start accepts. Automaton has 9477 states and 21668 transitions. Word has length 92 [2018-12-09 12:22:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:55,866 INFO L480 AbstractCegarLoop]: Abstraction has 9477 states and 21668 transitions. [2018-12-09 12:22:55,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:22:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 9477 states and 21668 transitions. [2018-12-09 12:22:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 12:22:55,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:55,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:55,873 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:55,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash -952422607, now seen corresponding path program 1 times [2018-12-09 12:22:55,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:55,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:55,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:55,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:55,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:22:55,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:55,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:22:55,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:55,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:22:55,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:22:55,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:22:55,916 INFO L87 Difference]: Start difference. First operand 9477 states and 21668 transitions. Second operand 6 states. [2018-12-09 12:22:55,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:55,951 INFO L93 Difference]: Finished difference Result 12003 states and 27498 transitions. [2018-12-09 12:22:55,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:22:55,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 12:22:55,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:55,959 INFO L225 Difference]: With dead ends: 12003 [2018-12-09 12:22:55,959 INFO L226 Difference]: Without dead ends: 12003 [2018-12-09 12:22:55,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:22:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12003 states. [2018-12-09 12:22:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12003 to 9739. [2018-12-09 12:22:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9739 states. [2018-12-09 12:22:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9739 states to 9739 states and 22123 transitions. [2018-12-09 12:22:56,036 INFO L78 Accepts]: Start accepts. Automaton has 9739 states and 22123 transitions. Word has length 92 [2018-12-09 12:22:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:56,037 INFO L480 AbstractCegarLoop]: Abstraction has 9739 states and 22123 transitions. [2018-12-09 12:22:56,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:22:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 9739 states and 22123 transitions. [2018-12-09 12:22:56,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 12:22:56,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:56,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:56,043 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:56,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:56,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1019429360, now seen corresponding path program 1 times [2018-12-09 12:22:56,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:56,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:56,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:56,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:56,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:56,112 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 12:22:56,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:56,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:22:56,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:56,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:22:56,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:22:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:22:56,113 INFO L87 Difference]: Start difference. First operand 9739 states and 22123 transitions. Second operand 7 states. [2018-12-09 12:22:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:56,225 INFO L93 Difference]: Finished difference Result 13063 states and 30000 transitions. [2018-12-09 12:22:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:22:56,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-09 12:22:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:56,235 INFO L225 Difference]: With dead ends: 13063 [2018-12-09 12:22:56,235 INFO L226 Difference]: Without dead ends: 13063 [2018-12-09 12:22:56,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:22:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13063 states. [2018-12-09 12:22:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13063 to 9137. [2018-12-09 12:22:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9137 states. [2018-12-09 12:22:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9137 states to 9137 states and 20655 transitions. [2018-12-09 12:22:56,320 INFO L78 Accepts]: Start accepts. Automaton has 9137 states and 20655 transitions. Word has length 92 [2018-12-09 12:22:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:56,320 INFO L480 AbstractCegarLoop]: Abstraction has 9137 states and 20655 transitions. [2018-12-09 12:22:56,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:22:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 9137 states and 20655 transitions. [2018-12-09 12:22:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 12:22:56,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:56,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:56,327 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:56,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:56,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1543562384, now seen corresponding path program 1 times [2018-12-09 12:22:56,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:56,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:56,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:56,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:56,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:56,390 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 12:22:56,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:56,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:22:56,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:56,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:22:56,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:22:56,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:22:56,391 INFO L87 Difference]: Start difference. First operand 9137 states and 20655 transitions. Second operand 6 states. [2018-12-09 12:22:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:56,464 INFO L93 Difference]: Finished difference Result 8657 states and 19199 transitions. [2018-12-09 12:22:56,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:22:56,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 12:22:56,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:56,469 INFO L225 Difference]: With dead ends: 8657 [2018-12-09 12:22:56,470 INFO L226 Difference]: Without dead ends: 8657 [2018-12-09 12:22:56,470 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 12:22:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2018-12-09 12:22:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 5230. [2018-12-09 12:22:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5230 states. [2018-12-09 12:22:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 11603 transitions. [2018-12-09 12:22:56,519 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 11603 transitions. Word has length 92 [2018-12-09 12:22:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:56,519 INFO L480 AbstractCegarLoop]: Abstraction has 5230 states and 11603 transitions. [2018-12-09 12:22:56,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:22:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 11603 transitions. [2018-12-09 12:22:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:22:56,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:56,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:56,522 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:56,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash -34543133, now seen corresponding path program 1 times [2018-12-09 12:22:56,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:56,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:56,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:56,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:56,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:56,649 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 12:22:56,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:56,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 12:22:56,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:56,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 12:22:56,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 12:22:56,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:22:56,650 INFO L87 Difference]: Start difference. First operand 5230 states and 11603 transitions. Second operand 13 states. [2018-12-09 12:22:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:57,346 INFO L93 Difference]: Finished difference Result 7435 states and 16209 transitions. [2018-12-09 12:22:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 12:22:57,346 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-12-09 12:22:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:57,351 INFO L225 Difference]: With dead ends: 7435 [2018-12-09 12:22:57,351 INFO L226 Difference]: Without dead ends: 7435 [2018-12-09 12:22:57,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-09 12:22:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2018-12-09 12:22:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6126. [2018-12-09 12:22:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6126 states. [2018-12-09 12:22:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6126 states to 6126 states and 13501 transitions. [2018-12-09 12:22:57,397 INFO L78 Accepts]: Start accepts. Automaton has 6126 states and 13501 transitions. Word has length 94 [2018-12-09 12:22:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:57,397 INFO L480 AbstractCegarLoop]: Abstraction has 6126 states and 13501 transitions. [2018-12-09 12:22:57,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 12:22:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6126 states and 13501 transitions. [2018-12-09 12:22:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:22:57,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:57,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:57,401 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:57,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:57,401 INFO L82 PathProgramCache]: Analyzing trace with hash 852960548, now seen corresponding path program 1 times [2018-12-09 12:22:57,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:57,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:57,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:57,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:57,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:22:57,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:57,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 12:22:57,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:57,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 12:22:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 12:22:57,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:22:57,484 INFO L87 Difference]: Start difference. First operand 6126 states and 13501 transitions. Second operand 11 states. [2018-12-09 12:22:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:58,445 INFO L93 Difference]: Finished difference Result 12214 states and 27167 transitions. [2018-12-09 12:22:58,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 12:22:58,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-12-09 12:22:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:58,451 INFO L225 Difference]: With dead ends: 12214 [2018-12-09 12:22:58,451 INFO L226 Difference]: Without dead ends: 8454 [2018-12-09 12:22:58,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 12:22:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8454 states. [2018-12-09 12:22:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8454 to 6145. [2018-12-09 12:22:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6145 states. [2018-12-09 12:22:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 13469 transitions. [2018-12-09 12:22:58,499 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 13469 transitions. Word has length 94 [2018-12-09 12:22:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:58,499 INFO L480 AbstractCegarLoop]: Abstraction has 6145 states and 13469 transitions. [2018-12-09 12:22:58,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 12:22:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 13469 transitions. [2018-12-09 12:22:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:22:58,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:58,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:22:58,504 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:58,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:58,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1818748071, now seen corresponding path program 2 times [2018-12-09 12:22:58,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:58,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:58,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:22:58,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:58,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:22:58,605 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 12:22:58,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:22:58,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:22:58,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:22:58,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:22:58,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:22:58,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:22:58,606 INFO L87 Difference]: Start difference. First operand 6145 states and 13469 transitions. Second operand 8 states. [2018-12-09 12:22:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:22:58,853 INFO L93 Difference]: Finished difference Result 7558 states and 16521 transitions. [2018-12-09 12:22:58,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 12:22:58,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-09 12:22:58,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:22:58,861 INFO L225 Difference]: With dead ends: 7558 [2018-12-09 12:22:58,861 INFO L226 Difference]: Without dead ends: 7558 [2018-12-09 12:22:58,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-09 12:22:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2018-12-09 12:22:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 6568. [2018-12-09 12:22:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6568 states. [2018-12-09 12:22:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6568 states to 6568 states and 14369 transitions. [2018-12-09 12:22:58,918 INFO L78 Accepts]: Start accepts. Automaton has 6568 states and 14369 transitions. Word has length 94 [2018-12-09 12:22:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:22:58,918 INFO L480 AbstractCegarLoop]: Abstraction has 6568 states and 14369 transitions. [2018-12-09 12:22:58,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:22:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6568 states and 14369 transitions. [2018-12-09 12:22:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 12:22:58,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:22:58,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] [2018-12-09 12:22:58,923 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:22:58,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:22:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1588715544, now seen corresponding path program 2 times [2018-12-09 12:22:58,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:22:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:58,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:22:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:22:58,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:22:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:22:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:22:58,959 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:22:59,025 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 12:22:59,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:22:59 BasicIcfg [2018-12-09 12:22:59,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:22:59,027 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:22:59,027 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:22:59,027 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:22:59,027 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:22:42" (3/4) ... [2018-12-09 12:22:59,029 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:22:59,094 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f46b424c-ab9f-4ef5-b939-88d4cf7c455d/bin-2019/utaipan/witness.graphml [2018-12-09 12:22:59,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:22:59,095 INFO L168 Benchmark]: Toolchain (without parser) took 16912.80 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 951.7 MB in the beginning and 1.9 GB in the end (delta: -933.3 MB). Peak memory consumption was 711.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:22:59,096 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:22:59,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -99.8 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:22:59,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.58 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-09 12:22:59,096 INFO L168 Benchmark]: Boogie Preprocessor took 19.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:22:59,096 INFO L168 Benchmark]: RCFGBuilder took 335.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.2 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2018-12-09 12:22:59,097 INFO L168 Benchmark]: TraceAbstraction took 16118.81 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 993.2 MB in the beginning and 1.9 GB in the end (delta: -925.5 MB). Peak memory consumption was 643.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:22:59,097 INFO L168 Benchmark]: Witness Printer took 67.87 ms. Allocated memory is still 2.7 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-12-09 12:22:59,098 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -99.8 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.58 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 335.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.2 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16118.81 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 993.2 MB in the beginning and 1.9 GB in the end (delta: -925.5 MB). Peak memory consumption was 643.1 MB. Max. memory is 11.5 GB. * Witness Printer took 67.87 ms. Allocated memory is still 2.7 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -1 pthread_t t1445; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] FCALL, FORK -1 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 1 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1446; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 2 [L730] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L731] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L732] 1 y$flush_delayed = weak$$choice2 [L733] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L735] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L740] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$flush_delayed ? y$mem_tmp : y [L743] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L784] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. UNSAFE Result, 16.0s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8356 SDtfs, 9100 SDslu, 20553 SDs, 0 SdLazy, 8607 SolverSat, 425 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 90 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34805occurred 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: 4.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 86864 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2442 NumberOfCodeBlocks, 2442 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2316 ConstructedInterpolants, 0 QuantifiedInterpolants, 502579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...