./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/podwr000_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/podwr000_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/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 93d9672c84edcf162d876282cd7f9d57e4a9018f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 11:48:21,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:48:21,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:48:21,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:48:21,017 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:48:21,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:48:21,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:48:21,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:48:21,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:48:21,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:48:21,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:48:21,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:48:21,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:48:21,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:48:21,023 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:48:21,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:48:21,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:48:21,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:48:21,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:48:21,026 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:48:21,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:48:21,028 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:48:21,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:48:21,029 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:48:21,029 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:48:21,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:48:21,030 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:48:21,031 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:48:21,031 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:48:21,032 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:48:21,032 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:48:21,032 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:48:21,032 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:48:21,033 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:48:21,033 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:48:21,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:48:21,034 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 11:48:21,041 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:48:21,041 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:48:21,042 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:48:21,042 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:48:21,042 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 11:48:21,042 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 11:48:21,042 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 11:48:21,043 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 11:48:21,043 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 11:48:21,043 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 11:48:21,043 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 11:48:21,043 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 11:48:21,043 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 11:48:21,044 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:48:21,044 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:48:21,044 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:48:21,044 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:48:21,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:48:21,044 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 11:48:21,044 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:48:21,044 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 11:48:21,045 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:48:21,045 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:48:21,045 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 11:48:21,045 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:48:21,045 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:48:21,045 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:48:21,045 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:48:21,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:48:21,045 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:48:21,046 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:48:21,046 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 11:48:21,046 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 11:48:21,046 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:48:21,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 11:48:21,046 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 11:48:21,046 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_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/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 -> 93d9672c84edcf162d876282cd7f9d57e4a9018f [2018-12-09 11:48:21,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:48:21,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:48:21,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:48:21,076 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:48:21,076 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:48:21,077 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/podwr000_tso.opt_false-unreach-call.i [2018-12-09 11:48:21,122 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/bin-2019/utaipan/data/11838caff/10cbf53d7c9a41d7bf61d804032c4cc7/FLAG0f63d5a2a [2018-12-09 11:48:21,557 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:48:21,557 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/sv-benchmarks/c/pthread-wmm/podwr000_tso.opt_false-unreach-call.i [2018-12-09 11:48:21,565 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/bin-2019/utaipan/data/11838caff/10cbf53d7c9a41d7bf61d804032c4cc7/FLAG0f63d5a2a [2018-12-09 11:48:21,574 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/bin-2019/utaipan/data/11838caff/10cbf53d7c9a41d7bf61d804032c4cc7 [2018-12-09 11:48:21,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:48:21,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:48:21,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:48:21,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:48:21,579 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:48:21,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:48:21" (1/1) ... [2018-12-09 11:48:21,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21, skipping insertion in model container [2018-12-09 11:48:21,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:48:21" (1/1) ... [2018-12-09 11:48:21,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:48:21,606 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:48:21,779 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:48:21,787 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:48:21,859 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:48:21,889 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:48:21,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21 WrapperNode [2018-12-09 11:48:21,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:48:21,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:48:21,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:48:21,890 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:48:21,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21" (1/1) ... [2018-12-09 11:48:21,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21" (1/1) ... [2018-12-09 11:48:21,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:48:21,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:48:21,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:48:21,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:48:21,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21" (1/1) ... [2018-12-09 11:48:21,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21" (1/1) ... [2018-12-09 11:48:21,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21" (1/1) ... [2018-12-09 11:48:21,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21" (1/1) ... [2018-12-09 11:48:21,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21" (1/1) ... [2018-12-09 11:48:21,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21" (1/1) ... [2018-12-09 11:48:21,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21" (1/1) ... [2018-12-09 11:48:21,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:48:21,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:48:21,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:48:21,942 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:48:21,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/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 11:48:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:48:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 11:48:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 11:48:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:48:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 11:48:21,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 11:48:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 11:48:21,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 11:48:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 11:48:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:48:21,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:48:21,976 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 11:48:22,258 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:48:22,258 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 11:48:22,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:48:22 BoogieIcfgContainer [2018-12-09 11:48:22,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:48:22,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:48:22,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:48:22,261 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:48:22,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:48:21" (1/3) ... [2018-12-09 11:48:22,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f832a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:48:22, skipping insertion in model container [2018-12-09 11:48:22,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:48:21" (2/3) ... [2018-12-09 11:48:22,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f832a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:48:22, skipping insertion in model container [2018-12-09 11:48:22,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:48:22" (3/3) ... [2018-12-09 11:48:22,263 INFO L112 eAbstractionObserver]: Analyzing ICFG podwr000_tso.opt_false-unreach-call.i [2018-12-09 11:48:22,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,286 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,286 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,286 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,286 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,286 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,286 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,287 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,288 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,291 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,291 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,293 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,294 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:48:22,304 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 11:48:22,304 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:48:22,310 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 11:48:22,319 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 11:48:22,335 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:48:22,335 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 11:48:22,335 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:48:22,335 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:48:22,335 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:48:22,335 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:48:22,335 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:48:22,335 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:48:22,342 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-09 11:48:23,875 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-09 11:48:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-09 11:48:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 11:48:23,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:23,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:23,883 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:23,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:23,887 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-12-09 11:48:23,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:23,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:23,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:23,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:23,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:24,025 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 11:48:24,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:24,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:48:24,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:24,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:48:24,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:48:24,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:48:24,040 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-09 11:48:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:24,499 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-09 11:48:24,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:48:24,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-09 11:48:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:24,670 INFO L225 Difference]: With dead ends: 60790 [2018-12-09 11:48:24,670 INFO L226 Difference]: Without dead ends: 44270 [2018-12-09 11:48:24,671 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 11:48:24,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-09 11:48:25,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-09 11:48:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-09 11:48:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-09 11:48:25,415 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-09 11:48:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:25,415 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-09 11:48:25,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:48:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-09 11:48:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 11:48:25,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:25,420 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 11:48:25,420 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:25,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-12-09 11:48:25,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:25,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:25,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:25,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:25,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:25,470 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 11:48:25,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:48:25,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:25,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:48:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:48:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:48:25,472 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-09 11:48:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:25,535 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-09 11:48:25,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:48:25,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 11:48:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:25,548 INFO L225 Difference]: With dead ends: 8528 [2018-12-09 11:48:25,549 INFO L226 Difference]: Without dead ends: 7466 [2018-12-09 11:48:25,549 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 11:48:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-09 11:48:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-09 11:48:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-09 11:48:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-09 11:48:25,635 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-09 11:48:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:25,635 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-09 11:48:25,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:48:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-09 11:48:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 11:48:25,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:25,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:25,637 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:25,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:25,637 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-12-09 11:48:25,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:25,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:25,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:25,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:25,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:25,694 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 11:48:25,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:25,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:48:25,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:25,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:48:25,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:48:25,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:48:25,695 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-09 11:48:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:25,891 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-09 11:48:25,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:48:25,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 11:48:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:25,920 INFO L225 Difference]: With dead ends: 13998 [2018-12-09 11:48:25,920 INFO L226 Difference]: Without dead ends: 13930 [2018-12-09 11:48:25,920 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 11:48:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-09 11:48:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-09 11:48:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-09 11:48:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-09 11:48:26,138 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-09 11:48:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:26,139 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-09 11:48:26,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:48:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-09 11:48:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 11:48:26,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:26,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:26,141 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:26,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:26,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-12-09 11:48:26,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:26,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:26,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:26,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:26,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:26,168 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 11:48:26,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:26,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:48:26,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:26,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:48:26,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:48:26,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:48:26,169 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-09 11:48:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:26,224 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-09 11:48:26,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:48:26,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 11:48:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:26,241 INFO L225 Difference]: With dead ends: 13279 [2018-12-09 11:48:26,241 INFO L226 Difference]: Without dead ends: 13279 [2018-12-09 11:48:26,242 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 11:48:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-09 11:48:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-09 11:48:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-09 11:48:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-09 11:48:26,361 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-09 11:48:26,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:26,362 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-09 11:48:26,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:48:26,362 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-09 11:48:26,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 11:48:26,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:26,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:26,363 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:26,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:26,363 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-12-09 11:48:26,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:26,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:26,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:26,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:26,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:26,425 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 11:48:26,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:26,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:48:26,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:26,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:48:26,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:48:26,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:48:26,425 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-09 11:48:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:26,834 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-09 11:48:26,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:48:26,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-09 11:48:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:26,847 INFO L225 Difference]: With dead ends: 12285 [2018-12-09 11:48:26,847 INFO L226 Difference]: Without dead ends: 12213 [2018-12-09 11:48:26,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-09 11:48:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-09 11:48:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-09 11:48:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-09 11:48:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-09 11:48:26,961 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-09 11:48:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:26,961 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-09 11:48:26,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:48:26,961 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-09 11:48:26,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 11:48:26,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:26,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:26,964 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:26,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:26,965 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-12-09 11:48:26,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:26,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:26,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:26,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:26,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:27,018 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 11:48:27,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:27,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:48:27,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:27,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:48:27,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:48:27,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:48:27,019 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-09 11:48:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:27,097 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-09 11:48:27,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:48:27,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-09 11:48:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:27,110 INFO L225 Difference]: With dead ends: 12396 [2018-12-09 11:48:27,110 INFO L226 Difference]: Without dead ends: 12396 [2018-12-09 11:48:27,111 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 11:48:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-09 11:48:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-09 11:48:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-09 11:48:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-09 11:48:27,244 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-09 11:48:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:27,245 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-09 11:48:27,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:48:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-09 11:48:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 11:48:27,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:27,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:27,248 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:27,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-12-09 11:48:27,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:27,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:27,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:27,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:27,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:48:27,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:27,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:48:27,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:27,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:48:27,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:48:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:48:27,314 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-09 11:48:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:27,656 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-09 11:48:27,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 11:48:27,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-09 11:48:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:27,678 INFO L225 Difference]: With dead ends: 20969 [2018-12-09 11:48:27,678 INFO L226 Difference]: Without dead ends: 20898 [2018-12-09 11:48:27,678 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 11:48:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-09 11:48:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-09 11:48:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-09 11:48:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-09 11:48:27,849 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-09 11:48:27,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:27,849 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-09 11:48:27,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:48:27,849 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-09 11:48:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 11:48:27,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:27,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:27,853 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:27,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:27,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1699576415, now seen corresponding path program 1 times [2018-12-09 11:48:27,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:27,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:27,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:27,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:27,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:27,907 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 11:48:27,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:27,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:48:27,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:27,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:48:27,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:48:27,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:48:27,908 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-09 11:48:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:28,098 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-12-09 11:48:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:48:28,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 11:48:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:28,117 INFO L225 Difference]: With dead ends: 17635 [2018-12-09 11:48:28,117 INFO L226 Difference]: Without dead ends: 17635 [2018-12-09 11:48:28,117 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 11:48:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-09 11:48:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-12-09 11:48:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-12-09 11:48:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-12-09 11:48:28,284 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-12-09 11:48:28,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:28,284 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-12-09 11:48:28,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:48:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-12-09 11:48:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 11:48:28,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:28,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:28,290 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:28,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:28,290 INFO L82 PathProgramCache]: Analyzing trace with hash -377632928, now seen corresponding path program 1 times [2018-12-09 11:48:28,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:28,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:28,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:28,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:28,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:28,318 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 11:48:28,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:28,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:48:28,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:28,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:48:28,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:48:28,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:48:28,319 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-12-09 11:48:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:28,479 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-12-09 11:48:28,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:48:28,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-09 11:48:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:28,497 INFO L225 Difference]: With dead ends: 16385 [2018-12-09 11:48:28,498 INFO L226 Difference]: Without dead ends: 16385 [2018-12-09 11:48:28,498 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 11:48:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-12-09 11:48:28,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-12-09 11:48:28,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-12-09 11:48:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-12-09 11:48:28,667 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-12-09 11:48:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:28,668 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-12-09 11:48:28,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:48:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-12-09 11:48:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 11:48:28,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:28,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:28,674 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:28,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:28,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1938632710, now seen corresponding path program 1 times [2018-12-09 11:48:28,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:28,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:28,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:28,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:28,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:28,820 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 11:48:28,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:28,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:48:28,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:28,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:48:28,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:48:28,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:48:28,821 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-12-09 11:48:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:29,393 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-12-09 11:48:29,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:48:29,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 11:48:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:29,415 INFO L225 Difference]: With dead ends: 19821 [2018-12-09 11:48:29,415 INFO L226 Difference]: Without dead ends: 19821 [2018-12-09 11:48:29,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:48:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-12-09 11:48:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-12-09 11:48:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-12-09 11:48:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-12-09 11:48:29,605 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-12-09 11:48:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:29,605 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-12-09 11:48:29,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:48:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-12-09 11:48:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 11:48:29,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:29,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:29,612 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:29,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:29,612 INFO L82 PathProgramCache]: Analyzing trace with hash -138576633, now seen corresponding path program 1 times [2018-12-09 11:48:29,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:29,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:29,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:29,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:29,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:29,668 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 11:48:29,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:29,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:48:29,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:29,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:48:29,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:48:29,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:48:29,668 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-12-09 11:48:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:29,947 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-12-09 11:48:29,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:48:29,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 11:48:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:29,970 INFO L225 Difference]: With dead ends: 21449 [2018-12-09 11:48:29,970 INFO L226 Difference]: Without dead ends: 21449 [2018-12-09 11:48:29,970 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 11:48:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-12-09 11:48:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-12-09 11:48:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-12-09 11:48:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-12-09 11:48:30,169 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-12-09 11:48:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:30,169 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-12-09 11:48:30,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:48:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-12-09 11:48:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 11:48:30,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:30,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:30,176 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:30,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:30,177 INFO L82 PathProgramCache]: Analyzing trace with hash 72774280, now seen corresponding path program 1 times [2018-12-09 11:48:30,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:30,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:30,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:30,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:30,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:30,227 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 11:48:30,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:30,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:48:30,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:30,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:48:30,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:48:30,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:48:30,228 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-12-09 11:48:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:30,485 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-12-09 11:48:30,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:48:30,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 11:48:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:30,514 INFO L225 Difference]: With dead ends: 25024 [2018-12-09 11:48:30,515 INFO L226 Difference]: Without dead ends: 25024 [2018-12-09 11:48:30,515 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 11:48:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-12-09 11:48:30,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-12-09 11:48:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-12-09 11:48:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-12-09 11:48:30,768 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-12-09 11:48:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:30,768 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-12-09 11:48:30,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:48:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-12-09 11:48:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 11:48:30,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:30,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:30,776 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:30,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash -437759897, now seen corresponding path program 1 times [2018-12-09 11:48:30,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:30,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:30,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:30,829 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 11:48:30,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:30,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:48:30,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:30,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:48:30,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:48:30,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:48:30,830 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 4 states. [2018-12-09 11:48:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:31,254 INFO L93 Difference]: Finished difference Result 31689 states and 95699 transitions. [2018-12-09 11:48:31,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:48:31,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-09 11:48:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:31,287 INFO L225 Difference]: With dead ends: 31689 [2018-12-09 11:48:31,287 INFO L226 Difference]: Without dead ends: 31537 [2018-12-09 11:48:31,287 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 11:48:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31537 states. [2018-12-09 11:48:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31537 to 28553. [2018-12-09 11:48:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28553 states. [2018-12-09 11:48:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28553 states to 28553 states and 86263 transitions. [2018-12-09 11:48:31,601 INFO L78 Accepts]: Start accepts. Automaton has 28553 states and 86263 transitions. Word has length 66 [2018-12-09 11:48:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:31,601 INFO L480 AbstractCegarLoop]: Abstraction has 28553 states and 86263 transitions. [2018-12-09 11:48:31,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:48:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 28553 states and 86263 transitions. [2018-12-09 11:48:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 11:48:31,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:31,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:48:31,610 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:31,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:31,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1369694566, now seen corresponding path program 1 times [2018-12-09 11:48:31,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:31,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:31,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:31,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:31,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:31,650 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 11:48:31,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:31,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:48:31,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:31,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:48:31,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:48:31,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:48:31,651 INFO L87 Difference]: Start difference. First operand 28553 states and 86263 transitions. Second operand 5 states. [2018-12-09 11:48:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:31,955 INFO L93 Difference]: Finished difference Result 40195 states and 119844 transitions. [2018-12-09 11:48:31,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:48:31,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 11:48:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:31,999 INFO L225 Difference]: With dead ends: 40195 [2018-12-09 11:48:31,999 INFO L226 Difference]: Without dead ends: 39987 [2018-12-09 11:48:32,000 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 11:48:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39987 states. [2018-12-09 11:48:32,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39987 to 35807. [2018-12-09 11:48:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-12-09 11:48:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-12-09 11:48:32,402 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-12-09 11:48:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:32,402 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-12-09 11:48:32,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:48:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-12-09 11:48:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 11:48:32,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:32,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:32,411 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:32,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:32,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2060256040, now seen corresponding path program 1 times [2018-12-09 11:48:32,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:32,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:32,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:32,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:32,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:32,492 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 11:48:32,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:32,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 11:48:32,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:32,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 11:48:32,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 11:48:32,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:48:32,493 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 9 states. [2018-12-09 11:48:33,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:33,149 INFO L93 Difference]: Finished difference Result 44023 states and 131291 transitions. [2018-12-09 11:48:33,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:48:33,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-12-09 11:48:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:33,193 INFO L225 Difference]: With dead ends: 44023 [2018-12-09 11:48:33,193 INFO L226 Difference]: Without dead ends: 44023 [2018-12-09 11:48:33,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:48:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44023 states. [2018-12-09 11:48:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44023 to 38973. [2018-12-09 11:48:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38973 states. [2018-12-09 11:48:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38973 states to 38973 states and 116711 transitions. [2018-12-09 11:48:33,600 INFO L78 Accepts]: Start accepts. Automaton has 38973 states and 116711 transitions. Word has length 66 [2018-12-09 11:48:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:33,601 INFO L480 AbstractCegarLoop]: Abstraction has 38973 states and 116711 transitions. [2018-12-09 11:48:33,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 11:48:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 38973 states and 116711 transitions. [2018-12-09 11:48:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 11:48:33,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:33,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:48:33,611 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:33,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1347207575, now seen corresponding path program 1 times [2018-12-09 11:48:33,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:33,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:33,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:33,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:33,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:33,645 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 11:48:33,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:33,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:48:33,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:33,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:48:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:48:33,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:48:33,646 INFO L87 Difference]: Start difference. First operand 38973 states and 116711 transitions. Second operand 5 states. [2018-12-09 11:48:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:33,683 INFO L93 Difference]: Finished difference Result 9637 states and 23357 transitions. [2018-12-09 11:48:33,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:48:33,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 11:48:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:33,688 INFO L225 Difference]: With dead ends: 9637 [2018-12-09 11:48:33,688 INFO L226 Difference]: Without dead ends: 7669 [2018-12-09 11:48:33,689 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 11:48:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2018-12-09 11:48:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 6276. [2018-12-09 11:48:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6276 states. [2018-12-09 11:48:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 14833 transitions. [2018-12-09 11:48:33,740 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 14833 transitions. Word has length 66 [2018-12-09 11:48:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:33,740 INFO L480 AbstractCegarLoop]: Abstraction has 6276 states and 14833 transitions. [2018-12-09 11:48:33,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:48:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 14833 transitions. [2018-12-09 11:48:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 11:48:33,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:33,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:33,743 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:33,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-12-09 11:48:33,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:33,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:33,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:33,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:33,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:48:33,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:33,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:48:33,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:33,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:48:33,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:48:33,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:48:33,768 INFO L87 Difference]: Start difference. First operand 6276 states and 14833 transitions. Second operand 3 states. [2018-12-09 11:48:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:33,792 INFO L93 Difference]: Finished difference Result 8733 states and 20570 transitions. [2018-12-09 11:48:33,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:48:33,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-09 11:48:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:33,797 INFO L225 Difference]: With dead ends: 8733 [2018-12-09 11:48:33,797 INFO L226 Difference]: Without dead ends: 8733 [2018-12-09 11:48:33,798 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 11:48:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8733 states. [2018-12-09 11:48:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8733 to 6213. [2018-12-09 11:48:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2018-12-09 11:48:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 14371 transitions. [2018-12-09 11:48:33,847 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 14371 transitions. Word has length 66 [2018-12-09 11:48:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:33,847 INFO L480 AbstractCegarLoop]: Abstraction has 6213 states and 14371 transitions. [2018-12-09 11:48:33,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:48:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 14371 transitions. [2018-12-09 11:48:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 11:48:33,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:33,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:33,851 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:33,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-12-09 11:48:33,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:33,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:33,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:33,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:33,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:33,887 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 11:48:33,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:33,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:48:33,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:33,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:48:33,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:48:33,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:48:33,888 INFO L87 Difference]: Start difference. First operand 6213 states and 14371 transitions. Second operand 5 states. [2018-12-09 11:48:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:33,978 INFO L93 Difference]: Finished difference Result 7383 states and 17012 transitions. [2018-12-09 11:48:33,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:48:33,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-09 11:48:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:33,983 INFO L225 Difference]: With dead ends: 7383 [2018-12-09 11:48:33,983 INFO L226 Difference]: Without dead ends: 7383 [2018-12-09 11:48:33,984 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 11:48:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2018-12-09 11:48:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6657. [2018-12-09 11:48:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6657 states. [2018-12-09 11:48:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 15375 transitions. [2018-12-09 11:48:34,030 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 15375 transitions. Word has length 72 [2018-12-09 11:48:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:34,030 INFO L480 AbstractCegarLoop]: Abstraction has 6657 states and 15375 transitions. [2018-12-09 11:48:34,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:48:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 15375 transitions. [2018-12-09 11:48:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 11:48:34,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:34,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:34,034 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:34,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-12-09 11:48:34,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:34,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:34,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:34,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:34,116 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 11:48:34,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:34,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 11:48:34,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:34,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 11:48:34,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 11:48:34,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:48:34,117 INFO L87 Difference]: Start difference. First operand 6657 states and 15375 transitions. Second operand 9 states. [2018-12-09 11:48:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:34,497 INFO L93 Difference]: Finished difference Result 8851 states and 20272 transitions. [2018-12-09 11:48:34,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 11:48:34,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-09 11:48:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:34,502 INFO L225 Difference]: With dead ends: 8851 [2018-12-09 11:48:34,503 INFO L226 Difference]: Without dead ends: 8732 [2018-12-09 11:48:34,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-09 11:48:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8732 states. [2018-12-09 11:48:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8732 to 6746. [2018-12-09 11:48:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6746 states. [2018-12-09 11:48:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 15444 transitions. [2018-12-09 11:48:34,558 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 15444 transitions. Word has length 72 [2018-12-09 11:48:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:34,558 INFO L480 AbstractCegarLoop]: Abstraction has 6746 states and 15444 transitions. [2018-12-09 11:48:34,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 11:48:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 15444 transitions. [2018-12-09 11:48:34,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 11:48:34,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:34,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:34,563 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:34,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:34,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1109376988, now seen corresponding path program 1 times [2018-12-09 11:48:34,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:34,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:34,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:34,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:34,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:34,587 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 11:48:34,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:34,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:48:34,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:34,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:48:34,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:48:34,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:48:34,588 INFO L87 Difference]: Start difference. First operand 6746 states and 15444 transitions. Second operand 3 states. [2018-12-09 11:48:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:34,689 INFO L93 Difference]: Finished difference Result 8422 states and 18970 transitions. [2018-12-09 11:48:34,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:48:34,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-09 11:48:34,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:34,694 INFO L225 Difference]: With dead ends: 8422 [2018-12-09 11:48:34,694 INFO L226 Difference]: Without dead ends: 8422 [2018-12-09 11:48:34,694 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 11:48:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2018-12-09 11:48:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 7857. [2018-12-09 11:48:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-12-09 11:48:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 17760 transitions. [2018-12-09 11:48:34,752 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 17760 transitions. Word has length 91 [2018-12-09 11:48:34,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:34,753 INFO L480 AbstractCegarLoop]: Abstraction has 7857 states and 17760 transitions. [2018-12-09 11:48:34,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:48:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 17760 transitions. [2018-12-09 11:48:34,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 11:48:34,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:34,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:34,758 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:34,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:34,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1490266353, now seen corresponding path program 1 times [2018-12-09 11:48:34,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:34,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:34,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:34,787 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 11:48:34,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:34,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:48:34,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:34,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:48:34,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:48:34,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:48:34,788 INFO L87 Difference]: Start difference. First operand 7857 states and 17760 transitions. Second operand 4 states. [2018-12-09 11:48:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:34,859 INFO L93 Difference]: Finished difference Result 8431 states and 19074 transitions. [2018-12-09 11:48:34,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:48:34,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 11:48:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:34,864 INFO L225 Difference]: With dead ends: 8431 [2018-12-09 11:48:34,864 INFO L226 Difference]: Without dead ends: 8431 [2018-12-09 11:48:34,865 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 11:48:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2018-12-09 11:48:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 7772. [2018-12-09 11:48:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7772 states. [2018-12-09 11:48:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7772 states to 7772 states and 17676 transitions. [2018-12-09 11:48:34,923 INFO L78 Accepts]: Start accepts. Automaton has 7772 states and 17676 transitions. Word has length 91 [2018-12-09 11:48:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:34,923 INFO L480 AbstractCegarLoop]: Abstraction has 7772 states and 17676 transitions. [2018-12-09 11:48:34,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:48:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 7772 states and 17676 transitions. [2018-12-09 11:48:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 11:48:34,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:34,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:34,929 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:34,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:34,929 INFO L82 PathProgramCache]: Analyzing trace with hash 286007970, now seen corresponding path program 1 times [2018-12-09 11:48:34,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:34,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:34,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:34,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:34,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:34,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 11:48:34,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:34,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:48:34,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:34,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:48:34,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:48:34,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:48:34,981 INFO L87 Difference]: Start difference. First operand 7772 states and 17676 transitions. Second operand 5 states. [2018-12-09 11:48:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:35,062 INFO L93 Difference]: Finished difference Result 8948 states and 20243 transitions. [2018-12-09 11:48:35,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:48:35,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 11:48:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:35,069 INFO L225 Difference]: With dead ends: 8948 [2018-12-09 11:48:35,070 INFO L226 Difference]: Without dead ends: 8948 [2018-12-09 11:48:35,070 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 11:48:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8948 states. [2018-12-09 11:48:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8948 to 6902. [2018-12-09 11:48:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6902 states. [2018-12-09 11:48:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 15741 transitions. [2018-12-09 11:48:35,147 INFO L78 Accepts]: Start accepts. Automaton has 6902 states and 15741 transitions. Word has length 93 [2018-12-09 11:48:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:35,147 INFO L480 AbstractCegarLoop]: Abstraction has 6902 states and 15741 transitions. [2018-12-09 11:48:35,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:48:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6902 states and 15741 transitions. [2018-12-09 11:48:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 11:48:35,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:35,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:35,153 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:35,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:35,154 INFO L82 PathProgramCache]: Analyzing trace with hash 31271425, now seen corresponding path program 1 times [2018-12-09 11:48:35,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:35,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:35,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:35,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:35,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:35,188 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 11:48:35,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:35,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:48:35,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:35,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:48:35,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:48:35,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:48:35,189 INFO L87 Difference]: Start difference. First operand 6902 states and 15741 transitions. Second operand 5 states. [2018-12-09 11:48:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:35,449 INFO L93 Difference]: Finished difference Result 11458 states and 26340 transitions. [2018-12-09 11:48:35,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:48:35,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 11:48:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:35,456 INFO L225 Difference]: With dead ends: 11458 [2018-12-09 11:48:35,456 INFO L226 Difference]: Without dead ends: 11380 [2018-12-09 11:48:35,457 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 11:48:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2018-12-09 11:48:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 8056. [2018-12-09 11:48:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8056 states. [2018-12-09 11:48:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 18403 transitions. [2018-12-09 11:48:35,524 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 18403 transitions. Word has length 93 [2018-12-09 11:48:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:35,524 INFO L480 AbstractCegarLoop]: Abstraction has 8056 states and 18403 transitions. [2018-12-09 11:48:35,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:48:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 18403 transitions. [2018-12-09 11:48:35,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 11:48:35,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:35,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:35,530 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:35,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:35,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1276035906, now seen corresponding path program 1 times [2018-12-09 11:48:35,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:35,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:35,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:35,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:35,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:35,588 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 11:48:35,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:35,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:48:35,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:35,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:48:35,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:48:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:48:35,589 INFO L87 Difference]: Start difference. First operand 8056 states and 18403 transitions. Second operand 6 states. [2018-12-09 11:48:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:35,768 INFO L93 Difference]: Finished difference Result 10204 states and 23157 transitions. [2018-12-09 11:48:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:48:35,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 11:48:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:35,775 INFO L225 Difference]: With dead ends: 10204 [2018-12-09 11:48:35,775 INFO L226 Difference]: Without dead ends: 10125 [2018-12-09 11:48:35,775 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 11:48:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10125 states. [2018-12-09 11:48:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10125 to 7529. [2018-12-09 11:48:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2018-12-09 11:48:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 17293 transitions. [2018-12-09 11:48:35,834 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 17293 transitions. Word has length 93 [2018-12-09 11:48:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:35,835 INFO L480 AbstractCegarLoop]: Abstraction has 7529 states and 17293 transitions. [2018-12-09 11:48:35,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:48:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 17293 transitions. [2018-12-09 11:48:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 11:48:35,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:35,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:35,839 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:35,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash 659591573, now seen corresponding path program 1 times [2018-12-09 11:48:35,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:35,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:35,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:35,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:35,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:35,922 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 11:48:35,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:35,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 11:48:35,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:35,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 11:48:35,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 11:48:35,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:48:35,923 INFO L87 Difference]: Start difference. First operand 7529 states and 17293 transitions. Second operand 9 states. [2018-12-09 11:48:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:36,281 INFO L93 Difference]: Finished difference Result 10604 states and 24259 transitions. [2018-12-09 11:48:36,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 11:48:36,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-09 11:48:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:36,287 INFO L225 Difference]: With dead ends: 10604 [2018-12-09 11:48:36,288 INFO L226 Difference]: Without dead ends: 10572 [2018-12-09 11:48:36,288 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 11:48:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10572 states. [2018-12-09 11:48:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10572 to 9100. [2018-12-09 11:48:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9100 states. [2018-12-09 11:48:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9100 states to 9100 states and 20773 transitions. [2018-12-09 11:48:36,357 INFO L78 Accepts]: Start accepts. Automaton has 9100 states and 20773 transitions. Word has length 93 [2018-12-09 11:48:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:36,357 INFO L480 AbstractCegarLoop]: Abstraction has 9100 states and 20773 transitions. [2018-12-09 11:48:36,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 11:48:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9100 states and 20773 transitions. [2018-12-09 11:48:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 11:48:36,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:36,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:36,363 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:36,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:36,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1137359786, now seen corresponding path program 1 times [2018-12-09 11:48:36,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:36,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:36,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:36,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:36,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:36,415 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 11:48:36,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:36,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:48:36,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:36,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:48:36,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:48:36,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:48:36,415 INFO L87 Difference]: Start difference. First operand 9100 states and 20773 transitions. Second operand 8 states. [2018-12-09 11:48:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:36,654 INFO L93 Difference]: Finished difference Result 14198 states and 32836 transitions. [2018-12-09 11:48:36,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:48:36,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-09 11:48:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:36,664 INFO L225 Difference]: With dead ends: 14198 [2018-12-09 11:48:36,664 INFO L226 Difference]: Without dead ends: 14198 [2018-12-09 11:48:36,664 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 11:48:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14198 states. [2018-12-09 11:48:36,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14198 to 9690. [2018-12-09 11:48:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9690 states. [2018-12-09 11:48:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9690 states to 9690 states and 22304 transitions. [2018-12-09 11:48:36,753 INFO L78 Accepts]: Start accepts. Automaton has 9690 states and 22304 transitions. Word has length 93 [2018-12-09 11:48:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:36,753 INFO L480 AbstractCegarLoop]: Abstraction has 9690 states and 22304 transitions. [2018-12-09 11:48:36,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:48:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 9690 states and 22304 transitions. [2018-12-09 11:48:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 11:48:36,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:36,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:36,759 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:36,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash -249856105, now seen corresponding path program 1 times [2018-12-09 11:48:36,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:36,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:36,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:36,843 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 11:48:36,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:36,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:48:36,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:36,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:48:36,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:48:36,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:48:36,844 INFO L87 Difference]: Start difference. First operand 9690 states and 22304 transitions. Second operand 7 states. [2018-12-09 11:48:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:36,955 INFO L93 Difference]: Finished difference Result 13553 states and 31411 transitions. [2018-12-09 11:48:36,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:48:36,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 11:48:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:36,964 INFO L225 Difference]: With dead ends: 13553 [2018-12-09 11:48:36,964 INFO L226 Difference]: Without dead ends: 13553 [2018-12-09 11:48:36,964 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 11:48:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13553 states. [2018-12-09 11:48:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13553 to 9782. [2018-12-09 11:48:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9782 states. [2018-12-09 11:48:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9782 states to 9782 states and 22252 transitions. [2018-12-09 11:48:37,047 INFO L78 Accepts]: Start accepts. Automaton has 9782 states and 22252 transitions. Word has length 93 [2018-12-09 11:48:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:37,047 INFO L480 AbstractCegarLoop]: Abstraction has 9782 states and 22252 transitions. [2018-12-09 11:48:37,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:48:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 9782 states and 22252 transitions. [2018-12-09 11:48:37,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 11:48:37,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:37,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:37,054 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:37,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:37,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1981831657, now seen corresponding path program 1 times [2018-12-09 11:48:37,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:37,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:37,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:37,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:37,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:37,110 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 11:48:37,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:37,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:48:37,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:37,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:48:37,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:48:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:48:37,110 INFO L87 Difference]: Start difference. First operand 9782 states and 22252 transitions. Second operand 6 states. [2018-12-09 11:48:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:37,180 INFO L93 Difference]: Finished difference Result 9302 states and 20796 transitions. [2018-12-09 11:48:37,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:48:37,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 11:48:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:37,186 INFO L225 Difference]: With dead ends: 9302 [2018-12-09 11:48:37,187 INFO L226 Difference]: Without dead ends: 9302 [2018-12-09 11:48:37,187 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 11:48:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9302 states. [2018-12-09 11:48:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9302 to 5735. [2018-12-09 11:48:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5735 states. [2018-12-09 11:48:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 12856 transitions. [2018-12-09 11:48:37,241 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 12856 transitions. Word has length 93 [2018-12-09 11:48:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:37,241 INFO L480 AbstractCegarLoop]: Abstraction has 5735 states and 12856 transitions. [2018-12-09 11:48:37,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:48:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 12856 transitions. [2018-12-09 11:48:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 11:48:37,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:37,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:37,245 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:37,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:37,246 INFO L82 PathProgramCache]: Analyzing trace with hash -402802423, now seen corresponding path program 1 times [2018-12-09 11:48:37,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:37,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:37,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:37,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:37,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:37,304 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 11:48:37,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:37,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:48:37,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:37,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:48:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:48:37,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:48:37,305 INFO L87 Difference]: Start difference. First operand 5735 states and 12856 transitions. Second operand 5 states. [2018-12-09 11:48:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:37,330 INFO L93 Difference]: Finished difference Result 5735 states and 12840 transitions. [2018-12-09 11:48:37,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:48:37,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-09 11:48:37,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:37,333 INFO L225 Difference]: With dead ends: 5735 [2018-12-09 11:48:37,333 INFO L226 Difference]: Without dead ends: 5735 [2018-12-09 11:48:37,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:48:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2018-12-09 11:48:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 5735. [2018-12-09 11:48:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5735 states. [2018-12-09 11:48:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5735 states to 5735 states and 12840 transitions. [2018-12-09 11:48:37,368 INFO L78 Accepts]: Start accepts. Automaton has 5735 states and 12840 transitions. Word has length 95 [2018-12-09 11:48:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:37,368 INFO L480 AbstractCegarLoop]: Abstraction has 5735 states and 12840 transitions. [2018-12-09 11:48:37,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:48:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5735 states and 12840 transitions. [2018-12-09 11:48:37,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 11:48:37,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:37,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:37,372 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:37,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:37,372 INFO L82 PathProgramCache]: Analyzing trace with hash 484701258, now seen corresponding path program 1 times [2018-12-09 11:48:37,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:37,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:37,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:37,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:37,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:37,480 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 11:48:37,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:37,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 11:48:37,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:37,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 11:48:37,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 11:48:37,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:48:37,481 INFO L87 Difference]: Start difference. First operand 5735 states and 12840 transitions. Second operand 11 states. [2018-12-09 11:48:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:38,261 INFO L93 Difference]: Finished difference Result 10915 states and 24583 transitions. [2018-12-09 11:48:38,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 11:48:38,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-09 11:48:38,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:38,266 INFO L225 Difference]: With dead ends: 10915 [2018-12-09 11:48:38,266 INFO L226 Difference]: Without dead ends: 7559 [2018-12-09 11:48:38,266 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 11:48:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2018-12-09 11:48:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 5599. [2018-12-09 11:48:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5599 states. [2018-12-09 11:48:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5599 states to 5599 states and 12459 transitions. [2018-12-09 11:48:38,307 INFO L78 Accepts]: Start accepts. Automaton has 5599 states and 12459 transitions. Word has length 95 [2018-12-09 11:48:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:38,307 INFO L480 AbstractCegarLoop]: Abstraction has 5599 states and 12459 transitions. [2018-12-09 11:48:38,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 11:48:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 5599 states and 12459 transitions. [2018-12-09 11:48:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 11:48:38,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:38,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:38,311 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:38,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash -860395469, now seen corresponding path program 1 times [2018-12-09 11:48:38,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:38,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:38,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:38,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:38,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:38,376 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 11:48:38,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:38,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:48:38,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:38,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:48:38,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:48:38,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:48:38,377 INFO L87 Difference]: Start difference. First operand 5599 states and 12459 transitions. Second operand 6 states. [2018-12-09 11:48:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:38,457 INFO L93 Difference]: Finished difference Result 6357 states and 13981 transitions. [2018-12-09 11:48:38,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:48:38,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-09 11:48:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:38,461 INFO L225 Difference]: With dead ends: 6357 [2018-12-09 11:48:38,462 INFO L226 Difference]: Without dead ends: 6327 [2018-12-09 11:48:38,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:48:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6327 states. [2018-12-09 11:48:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6327 to 5471. [2018-12-09 11:48:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2018-12-09 11:48:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 12082 transitions. [2018-12-09 11:48:38,502 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 12082 transitions. Word has length 95 [2018-12-09 11:48:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:38,502 INFO L480 AbstractCegarLoop]: Abstraction has 5471 states and 12082 transitions. [2018-12-09 11:48:38,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:48:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 12082 transitions. [2018-12-09 11:48:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 11:48:38,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:38,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:38,507 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:38,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:38,507 INFO L82 PathProgramCache]: Analyzing trace with hash -42258765, now seen corresponding path program 2 times [2018-12-09 11:48:38,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:38,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:38,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:48:38,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:38,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:48:38,542 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 11:48:38,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:48:38,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:48:38,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:48:38,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:48:38,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:48:38,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:48:38,543 INFO L87 Difference]: Start difference. First operand 5471 states and 12082 transitions. Second operand 6 states. [2018-12-09 11:48:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:48:38,640 INFO L93 Difference]: Finished difference Result 5893 states and 12934 transitions. [2018-12-09 11:48:38,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:48:38,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-09 11:48:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:48:38,644 INFO L225 Difference]: With dead ends: 5893 [2018-12-09 11:48:38,644 INFO L226 Difference]: Without dead ends: 5893 [2018-12-09 11:48:38,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:48:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2018-12-09 11:48:38,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 5467. [2018-12-09 11:48:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5467 states. [2018-12-09 11:48:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5467 states to 5467 states and 12050 transitions. [2018-12-09 11:48:38,687 INFO L78 Accepts]: Start accepts. Automaton has 5467 states and 12050 transitions. Word has length 95 [2018-12-09 11:48:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:48:38,687 INFO L480 AbstractCegarLoop]: Abstraction has 5467 states and 12050 transitions. [2018-12-09 11:48:38,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:48:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5467 states and 12050 transitions. [2018-12-09 11:48:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 11:48:38,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:48:38,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:48:38,691 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:48:38,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:48:38,691 INFO L82 PathProgramCache]: Analyzing trace with hash -530629708, now seen corresponding path program 2 times [2018-12-09 11:48:38,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:48:38,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:38,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:48:38,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:48:38,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:48:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:48:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:48:38,731 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 11:48:38,813 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 11:48:38,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:48:38 BasicIcfg [2018-12-09 11:48:38,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:48:38,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:48:38,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:48:38,815 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:48:38,815 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:48:22" (3/4) ... [2018-12-09 11:48:38,817 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 11:48:38,912 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b4861da4-ca6f-4cc0-b05a-62aeb7fbadaa/bin-2019/utaipan/witness.graphml [2018-12-09 11:48:38,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:48:38,913 INFO L168 Benchmark]: Toolchain (without parser) took 17337.74 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 957.1 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-09 11:48:38,915 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:48:38,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-09 11:48:38,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 11:48:38,915 INFO L168 Benchmark]: Boogie Preprocessor took 20.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:48:38,915 INFO L168 Benchmark]: RCFGBuilder took 316.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2018-12-09 11:48:38,916 INFO L168 Benchmark]: TraceAbstraction took 16555.20 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 722.5 MB in the end (delta: 326.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-09 11:48:38,916 INFO L168 Benchmark]: Witness Printer took 97.97 ms. Allocated memory was 2.6 GB in the beginning and 3.0 GB in the end (delta: 369.1 MB). Free memory was 722.5 MB in the beginning and 2.6 GB in the end (delta: -1.9 GB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-12-09 11:48:38,918 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 316.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16555.20 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 722.5 MB in the end (delta: 326.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 97.97 ms. Allocated memory was 2.6 GB in the beginning and 3.0 GB in the end (delta: 369.1 MB). Free memory was 722.5 MB in the beginning and 2.6 GB in the end (delta: -1.9 GB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1561; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] -1 pthread_t t1562; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t1562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 16.4s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8476 SDtfs, 9121 SDslu, 20169 SDs, 0 SdLazy, 8901 SolverSat, 419 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 85 SyntacticMatches, 31 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38973occurred in iteration=15, 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.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 86931 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2452 NumberOfCodeBlocks, 2452 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2325 ConstructedInterpolants, 0 QuantifiedInterpolants, 506986 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...