./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/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 c60fa6dcffe947607e07f04cc37f17d0aae2288e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-5842f4b [2018-11-18 13:15:15,088 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:15:15,089 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:15:15,098 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:15:15,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:15:15,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:15:15,099 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:15:15,101 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:15:15,102 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:15:15,102 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:15:15,103 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:15:15,103 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:15:15,104 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:15:15,104 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:15:15,105 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:15:15,106 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:15:15,106 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:15:15,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:15:15,109 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:15:15,110 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:15:15,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:15:15,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:15:15,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:15:15,113 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:15:15,113 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:15:15,114 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:15:15,114 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:15:15,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:15:15,115 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:15:15,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:15:15,116 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:15:15,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:15:15,117 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:15:15,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:15:15,118 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:15:15,118 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:15:15,118 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 13:15:15,127 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:15:15,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:15:15,128 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:15:15,128 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:15:15,128 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:15:15,128 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:15:15,129 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:15:15,129 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 13:15:15,129 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:15:15,129 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:15:15,129 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 13:15:15,129 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 13:15:15,129 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:15:15,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:15:15,130 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:15:15,130 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:15:15,130 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:15:15,130 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:15:15,130 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:15:15,131 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:15:15,131 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:15:15,131 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:15:15,131 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:15:15,131 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:15:15,131 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:15:15,131 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:15:15,131 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:15:15,132 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:15:15,132 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:15:15,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:15:15,132 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:15:15,132 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:15:15,132 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:15:15,132 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 13:15:15,132 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:15:15,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:15:15,133 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 13:15:15,133 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_f8585331-c499-4ec4-8c5e-55724701a271/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 -> c60fa6dcffe947607e07f04cc37f17d0aae2288e [2018-11-18 13:15:15,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:15:15,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:15:15,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:15:15,167 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:15:15,168 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:15:15,168 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 13:15:15,215 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/bin-2019/utaipan/data/5b158f73a/cc221820ee0a47fda50eae00043367b2/FLAG8e3875b44 [2018-11-18 13:15:15,624 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:15:15,625 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 13:15:15,638 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/bin-2019/utaipan/data/5b158f73a/cc221820ee0a47fda50eae00043367b2/FLAG8e3875b44 [2018-11-18 13:15:15,649 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/bin-2019/utaipan/data/5b158f73a/cc221820ee0a47fda50eae00043367b2 [2018-11-18 13:15:15,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:15:15,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:15:15,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:15:15,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:15:15,657 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:15:15,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:15:15" (1/1) ... [2018-11-18 13:15:15,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40945a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:15, skipping insertion in model container [2018-11-18 13:15:15,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:15:15" (1/1) ... [2018-11-18 13:15:15,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:15:15,709 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:15:15,988 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:15:15,991 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:15:16,125 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:15:16,146 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:15:16,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16 WrapperNode [2018-11-18 13:15:16,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:15:16,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:15:16,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:15:16,147 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:15:16,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16" (1/1) ... [2018-11-18 13:15:16,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16" (1/1) ... [2018-11-18 13:15:16,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:15:16,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:15:16,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:15:16,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:15:16,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16" (1/1) ... [2018-11-18 13:15:16,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16" (1/1) ... [2018-11-18 13:15:16,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16" (1/1) ... [2018-11-18 13:15:16,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16" (1/1) ... [2018-11-18 13:15:16,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16" (1/1) ... [2018-11-18 13:15:16,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16" (1/1) ... [2018-11-18 13:15:16,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16" (1/1) ... [2018-11-18 13:15:16,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:15:16,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:15:16,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:15:16,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:15:16,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/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-11-18 13:15:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-18 13:15:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-18 13:15:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 13:15:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 13:15:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-11-18 13:15:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-11-18 13:15:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-18 13:15:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-18 13:15:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:15:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:15:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 13:15:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 13:15:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-18 13:15:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-18 13:15:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-18 13:15:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-18 13:15:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 13:15:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 13:15:16,295 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-18 13:15:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-18 13:15:16,295 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 13:15:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 13:15:16,295 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-18 13:15:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-18 13:15:16,295 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-18 13:15:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-18 13:15:16,295 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-18 13:15:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-18 13:15:16,295 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 13:15:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 13:15:16,296 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 13:15:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 13:15:16,296 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-18 13:15:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-18 13:15:16,296 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-18 13:15:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-18 13:15:16,296 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 13:15:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 13:15:16,296 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-18 13:15:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-18 13:15:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 13:15:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 13:15:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-18 13:15:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-18 13:15:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:15:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:15:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-18 13:15:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-18 13:15:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-18 13:15:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-18 13:15:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:15:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:15:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-18 13:15:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-18 13:15:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-11-18 13:15:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-11-18 13:15:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-18 13:15:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-18 13:15:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-18 13:15:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-18 13:15:16,654 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:15:16,654 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:15:16,727 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:15:16,728 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:15:16,796 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:15:16,796 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:15:16,851 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:15:16,852 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:15:16,916 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:15:16,916 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:15:17,023 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:15:17,023 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:15:17,057 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:15:17,057 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:15:17,071 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:15:17,072 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:15:17,206 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:15:17,206 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:15:17,221 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:15:17,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:15:17 BoogieIcfgContainer [2018-11-18 13:15:17,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:15:17,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:15:17,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:15:17,226 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:15:17,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:15:15" (1/3) ... [2018-11-18 13:15:17,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512cc8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:15:17, skipping insertion in model container [2018-11-18 13:15:17,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:15:16" (2/3) ... [2018-11-18 13:15:17,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512cc8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:15:17, skipping insertion in model container [2018-11-18 13:15:17,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:15:17" (3/3) ... [2018-11-18 13:15:17,228 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 13:15:17,236 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:15:17,243 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 13:15:17,257 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 13:15:17,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:15:17,287 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:15:17,287 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:15:17,288 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:15:17,288 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:15:17,288 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:15:17,288 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:15:17,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:15:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states. [2018-11-18 13:15:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 13:15:17,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:17,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:17,321 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:17,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:17,326 INFO L82 PathProgramCache]: Analyzing trace with hash -448213016, now seen corresponding path program 1 times [2018-11-18 13:15:17,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:17,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:17,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:17,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:17,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:17,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:17,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:17,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:17,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:17,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:17,539 INFO L87 Difference]: Start difference. First operand 518 states. Second operand 3 states. [2018-11-18 13:15:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:17,711 INFO L93 Difference]: Finished difference Result 893 states and 1383 transitions. [2018-11-18 13:15:17,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:17,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 13:15:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:17,726 INFO L225 Difference]: With dead ends: 893 [2018-11-18 13:15:17,726 INFO L226 Difference]: Without dead ends: 510 [2018-11-18 13:15:17,731 INFO L604 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-11-18 13:15:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-11-18 13:15:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2018-11-18 13:15:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-11-18 13:15:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 741 transitions. [2018-11-18 13:15:17,790 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 741 transitions. Word has length 20 [2018-11-18 13:15:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:17,790 INFO L480 AbstractCegarLoop]: Abstraction has 510 states and 741 transitions. [2018-11-18 13:15:17,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 741 transitions. [2018-11-18 13:15:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 13:15:17,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:17,792 INFO L375 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] [2018-11-18 13:15:17,792 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:17,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1549764761, now seen corresponding path program 1 times [2018-11-18 13:15:17,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:17,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:17,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:17,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:17,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:17,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-11-18 13:15:17,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:17,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:17,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:17,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:17,890 INFO L87 Difference]: Start difference. First operand 510 states and 741 transitions. Second operand 3 states. [2018-11-18 13:15:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:18,159 INFO L93 Difference]: Finished difference Result 798 states and 1129 transitions. [2018-11-18 13:15:18,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:18,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 13:15:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:18,166 INFO L225 Difference]: With dead ends: 798 [2018-11-18 13:15:18,166 INFO L226 Difference]: Without dead ends: 676 [2018-11-18 13:15:18,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-11-18 13:15:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 656. [2018-11-18 13:15:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-18 13:15:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 936 transitions. [2018-11-18 13:15:18,201 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 936 transitions. Word has length 25 [2018-11-18 13:15:18,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:18,202 INFO L480 AbstractCegarLoop]: Abstraction has 656 states and 936 transitions. [2018-11-18 13:15:18,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 936 transitions. [2018-11-18 13:15:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 13:15:18,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:18,203 INFO L375 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] [2018-11-18 13:15:18,204 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:18,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:18,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2086478551, now seen corresponding path program 1 times [2018-11-18 13:15:18,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:18,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:18,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:18,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:18,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:18,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:18,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:18,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:18,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:18,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:18,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:18,267 INFO L87 Difference]: Start difference. First operand 656 states and 936 transitions. Second operand 3 states. [2018-11-18 13:15:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:18,321 INFO L93 Difference]: Finished difference Result 1005 states and 1391 transitions. [2018-11-18 13:15:18,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:18,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 13:15:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:18,327 INFO L225 Difference]: With dead ends: 1005 [2018-11-18 13:15:18,327 INFO L226 Difference]: Without dead ends: 827 [2018-11-18 13:15:18,328 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-18 13:15:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-11-18 13:15:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 773. [2018-11-18 13:15:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-11-18 13:15:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1098 transitions. [2018-11-18 13:15:18,365 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1098 transitions. Word has length 30 [2018-11-18 13:15:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:18,366 INFO L480 AbstractCegarLoop]: Abstraction has 773 states and 1098 transitions. [2018-11-18 13:15:18,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1098 transitions. [2018-11-18 13:15:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 13:15:18,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:18,368 INFO L375 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] [2018-11-18 13:15:18,368 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:18,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:18,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1660288331, now seen corresponding path program 1 times [2018-11-18 13:15:18,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:18,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:18,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:18,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:18,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:18,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:18,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:18,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:18,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:18,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:18,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:18,418 INFO L87 Difference]: Start difference. First operand 773 states and 1098 transitions. Second operand 3 states. [2018-11-18 13:15:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:18,633 INFO L93 Difference]: Finished difference Result 1442 states and 2113 transitions. [2018-11-18 13:15:18,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:18,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 13:15:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:18,640 INFO L225 Difference]: With dead ends: 1442 [2018-11-18 13:15:18,640 INFO L226 Difference]: Without dead ends: 1172 [2018-11-18 13:15:18,642 INFO L604 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-11-18 13:15:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-11-18 13:15:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 909. [2018-11-18 13:15:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2018-11-18 13:15:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1334 transitions. [2018-11-18 13:15:18,688 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1334 transitions. Word has length 31 [2018-11-18 13:15:18,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:18,688 INFO L480 AbstractCegarLoop]: Abstraction has 909 states and 1334 transitions. [2018-11-18 13:15:18,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1334 transitions. [2018-11-18 13:15:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 13:15:18,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:18,690 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:18,690 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:18,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:18,690 INFO L82 PathProgramCache]: Analyzing trace with hash -167724303, now seen corresponding path program 1 times [2018-11-18 13:15:18,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:18,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:18,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:18,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:18,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:18,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:18,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:18,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:18,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:18,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:18,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:18,749 INFO L87 Difference]: Start difference. First operand 909 states and 1334 transitions. Second operand 5 states. [2018-11-18 13:15:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:19,401 INFO L93 Difference]: Finished difference Result 1582 states and 2329 transitions. [2018-11-18 13:15:19,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:15:19,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-18 13:15:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:19,407 INFO L225 Difference]: With dead ends: 1582 [2018-11-18 13:15:19,407 INFO L226 Difference]: Without dead ends: 998 [2018-11-18 13:15:19,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:15:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-11-18 13:15:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 897. [2018-11-18 13:15:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-11-18 13:15:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1310 transitions. [2018-11-18 13:15:19,453 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1310 transitions. Word has length 32 [2018-11-18 13:15:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:19,453 INFO L480 AbstractCegarLoop]: Abstraction has 897 states and 1310 transitions. [2018-11-18 13:15:19,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1310 transitions. [2018-11-18 13:15:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 13:15:19,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:19,457 INFO L375 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] [2018-11-18 13:15:19,457 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:19,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash 769348745, now seen corresponding path program 1 times [2018-11-18 13:15:19,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:19,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:19,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:19,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:19,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:19,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:19,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:19,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:19,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:19,500 INFO L87 Difference]: Start difference. First operand 897 states and 1310 transitions. Second operand 3 states. [2018-11-18 13:15:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:19,574 INFO L93 Difference]: Finished difference Result 900 states and 1312 transitions. [2018-11-18 13:15:19,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:19,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 13:15:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:19,579 INFO L225 Difference]: With dead ends: 900 [2018-11-18 13:15:19,579 INFO L226 Difference]: Without dead ends: 896 [2018-11-18 13:15:19,580 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-11-18 13:15:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2018-11-18 13:15:19,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-11-18 13:15:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1307 transitions. [2018-11-18 13:15:19,623 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1307 transitions. Word has length 36 [2018-11-18 13:15:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:19,624 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 1307 transitions. [2018-11-18 13:15:19,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1307 transitions. [2018-11-18 13:15:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 13:15:19,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:19,625 INFO L375 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] [2018-11-18 13:15:19,626 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:19,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:19,626 INFO L82 PathProgramCache]: Analyzing trace with hash 247206429, now seen corresponding path program 1 times [2018-11-18 13:15:19,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:19,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:19,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:19,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:19,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:19,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:19,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:19,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:19,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:19,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:19,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:19,685 INFO L87 Difference]: Start difference. First operand 896 states and 1307 transitions. Second operand 3 states. [2018-11-18 13:15:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:19,737 INFO L93 Difference]: Finished difference Result 1292 states and 1836 transitions. [2018-11-18 13:15:19,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:19,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 13:15:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:19,742 INFO L225 Difference]: With dead ends: 1292 [2018-11-18 13:15:19,742 INFO L226 Difference]: Without dead ends: 1027 [2018-11-18 13:15:19,744 INFO L604 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-11-18 13:15:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-11-18 13:15:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 882. [2018-11-18 13:15:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-11-18 13:15:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1249 transitions. [2018-11-18 13:15:19,792 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1249 transitions. Word has length 39 [2018-11-18 13:15:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:19,792 INFO L480 AbstractCegarLoop]: Abstraction has 882 states and 1249 transitions. [2018-11-18 13:15:19,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1249 transitions. [2018-11-18 13:15:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:15:19,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:19,794 INFO L375 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] [2018-11-18 13:15:19,794 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:19,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1349629560, now seen corresponding path program 1 times [2018-11-18 13:15:19,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:19,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:19,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:19,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:19,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:19,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:19,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:19,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:19,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:19,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:19,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:19,834 INFO L87 Difference]: Start difference. First operand 882 states and 1249 transitions. Second operand 3 states. [2018-11-18 13:15:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:19,903 INFO L93 Difference]: Finished difference Result 984 states and 1377 transitions. [2018-11-18 13:15:19,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:19,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 13:15:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:19,909 INFO L225 Difference]: With dead ends: 984 [2018-11-18 13:15:19,909 INFO L226 Difference]: Without dead ends: 964 [2018-11-18 13:15:19,910 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-11-18 13:15:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 908. [2018-11-18 13:15:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-11-18 13:15:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1284 transitions. [2018-11-18 13:15:19,967 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1284 transitions. Word has length 40 [2018-11-18 13:15:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:19,968 INFO L480 AbstractCegarLoop]: Abstraction has 908 states and 1284 transitions. [2018-11-18 13:15:19,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1284 transitions. [2018-11-18 13:15:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 13:15:19,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:19,971 INFO L375 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-11-18 13:15:19,971 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:19,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1046559798, now seen corresponding path program 1 times [2018-11-18 13:15:19,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:19,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:19,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:19,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:20,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:20,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:20,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:20,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:20,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:20,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:20,018 INFO L87 Difference]: Start difference. First operand 908 states and 1284 transitions. Second operand 3 states. [2018-11-18 13:15:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:20,093 INFO L93 Difference]: Finished difference Result 1187 states and 1663 transitions. [2018-11-18 13:15:20,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:20,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-18 13:15:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:20,098 INFO L225 Difference]: With dead ends: 1187 [2018-11-18 13:15:20,098 INFO L226 Difference]: Without dead ends: 941 [2018-11-18 13:15:20,099 INFO L604 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-11-18 13:15:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2018-11-18 13:15:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 908. [2018-11-18 13:15:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-11-18 13:15:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1283 transitions. [2018-11-18 13:15:20,145 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1283 transitions. Word has length 46 [2018-11-18 13:15:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:20,146 INFO L480 AbstractCegarLoop]: Abstraction has 908 states and 1283 transitions. [2018-11-18 13:15:20,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1283 transitions. [2018-11-18 13:15:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 13:15:20,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:20,148 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:20,148 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:20,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:20,149 INFO L82 PathProgramCache]: Analyzing trace with hash -574742039, now seen corresponding path program 1 times [2018-11-18 13:15:20,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:20,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:20,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:20,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:20,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:20,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:20,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:15:20,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:20,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:15:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:15:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:15:20,205 INFO L87 Difference]: Start difference. First operand 908 states and 1283 transitions. Second operand 4 states. [2018-11-18 13:15:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:20,552 INFO L93 Difference]: Finished difference Result 1030 states and 1429 transitions. [2018-11-18 13:15:20,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:15:20,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-18 13:15:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:20,557 INFO L225 Difference]: With dead ends: 1030 [2018-11-18 13:15:20,557 INFO L226 Difference]: Without dead ends: 797 [2018-11-18 13:15:20,558 INFO L604 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-11-18 13:15:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-11-18 13:15:20,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 763. [2018-11-18 13:15:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-18 13:15:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1072 transitions. [2018-11-18 13:15:20,597 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1072 transitions. Word has length 47 [2018-11-18 13:15:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:20,598 INFO L480 AbstractCegarLoop]: Abstraction has 763 states and 1072 transitions. [2018-11-18 13:15:20,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:15:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1072 transitions. [2018-11-18 13:15:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 13:15:20,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:20,600 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:20,600 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:20,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:20,600 INFO L82 PathProgramCache]: Analyzing trace with hash -992605317, now seen corresponding path program 1 times [2018-11-18 13:15:20,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:20,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:20,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:20,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:20,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:20,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:20,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:20,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:20,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:20,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:20,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:20,634 INFO L87 Difference]: Start difference. First operand 763 states and 1072 transitions. Second operand 3 states. [2018-11-18 13:15:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:20,688 INFO L93 Difference]: Finished difference Result 883 states and 1220 transitions. [2018-11-18 13:15:20,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:20,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-18 13:15:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:20,691 INFO L225 Difference]: With dead ends: 883 [2018-11-18 13:15:20,692 INFO L226 Difference]: Without dead ends: 787 [2018-11-18 13:15:20,692 INFO L604 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-11-18 13:15:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-18 13:15:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 762. [2018-11-18 13:15:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-11-18 13:15:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1067 transitions. [2018-11-18 13:15:20,731 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1067 transitions. Word has length 47 [2018-11-18 13:15:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:20,731 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 1067 transitions. [2018-11-18 13:15:20,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1067 transitions. [2018-11-18 13:15:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 13:15:20,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:20,733 INFO L375 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-11-18 13:15:20,733 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:20,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1733809897, now seen corresponding path program 1 times [2018-11-18 13:15:20,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:20,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:20,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:20,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:20,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:20,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:20,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:20,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:20,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:20,787 INFO L87 Difference]: Start difference. First operand 762 states and 1067 transitions. Second operand 3 states. [2018-11-18 13:15:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:20,889 INFO L93 Difference]: Finished difference Result 963 states and 1332 transitions. [2018-11-18 13:15:20,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:20,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 13:15:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:20,894 INFO L225 Difference]: With dead ends: 963 [2018-11-18 13:15:20,894 INFO L226 Difference]: Without dead ends: 949 [2018-11-18 13:15:20,894 INFO L604 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-11-18 13:15:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-11-18 13:15:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 841. [2018-11-18 13:15:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-11-18 13:15:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1159 transitions. [2018-11-18 13:15:20,939 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1159 transitions. Word has length 48 [2018-11-18 13:15:20,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:20,939 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 1159 transitions. [2018-11-18 13:15:20,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1159 transitions. [2018-11-18 13:15:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 13:15:20,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:20,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:20,942 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:20,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1764634278, now seen corresponding path program 1 times [2018-11-18 13:15:20,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:20,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:20,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:20,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:20,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:20,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:20,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 13:15:20,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:20,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 13:15:20,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:15:20,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:15:20,994 INFO L87 Difference]: Start difference. First operand 841 states and 1159 transitions. Second operand 8 states. [2018-11-18 13:15:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:21,149 INFO L93 Difference]: Finished difference Result 867 states and 1193 transitions. [2018-11-18 13:15:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:15:21,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-18 13:15:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:21,153 INFO L225 Difference]: With dead ends: 867 [2018-11-18 13:15:21,153 INFO L226 Difference]: Without dead ends: 863 [2018-11-18 13:15:21,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:15:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-11-18 13:15:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 860. [2018-11-18 13:15:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-11-18 13:15:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1186 transitions. [2018-11-18 13:15:21,203 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1186 transitions. Word has length 49 [2018-11-18 13:15:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:21,203 INFO L480 AbstractCegarLoop]: Abstraction has 860 states and 1186 transitions. [2018-11-18 13:15:21,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 13:15:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1186 transitions. [2018-11-18 13:15:21,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 13:15:21,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:21,205 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:21,205 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:21,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:21,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1764911108, now seen corresponding path program 1 times [2018-11-18 13:15:21,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:21,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:21,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:21,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:21,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:21,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:21,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 13:15:21,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:21,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 13:15:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:15:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:15:21,256 INFO L87 Difference]: Start difference. First operand 860 states and 1186 transitions. Second operand 8 states. [2018-11-18 13:15:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:21,352 INFO L93 Difference]: Finished difference Result 902 states and 1238 transitions. [2018-11-18 13:15:21,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:15:21,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-18 13:15:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:21,356 INFO L225 Difference]: With dead ends: 902 [2018-11-18 13:15:21,356 INFO L226 Difference]: Without dead ends: 881 [2018-11-18 13:15:21,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:15:21,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-11-18 13:15:21,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 880. [2018-11-18 13:15:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-18 13:15:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1210 transitions. [2018-11-18 13:15:21,402 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1210 transitions. Word has length 49 [2018-11-18 13:15:21,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:21,403 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 1210 transitions. [2018-11-18 13:15:21,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 13:15:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1210 transitions. [2018-11-18 13:15:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 13:15:21,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:21,405 INFO L375 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] [2018-11-18 13:15:21,405 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:21,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:21,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1085825170, now seen corresponding path program 1 times [2018-11-18 13:15:21,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:21,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:21,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:21,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:21,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:21,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:21,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:15:21,433 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:21,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:15:21,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:15:21,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:15:21,434 INFO L87 Difference]: Start difference. First operand 880 states and 1210 transitions. Second operand 4 states. [2018-11-18 13:15:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:21,500 INFO L93 Difference]: Finished difference Result 905 states and 1235 transitions. [2018-11-18 13:15:21,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:15:21,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-18 13:15:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:21,504 INFO L225 Difference]: With dead ends: 905 [2018-11-18 13:15:21,504 INFO L226 Difference]: Without dead ends: 883 [2018-11-18 13:15:21,505 INFO L604 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-11-18 13:15:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-11-18 13:15:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2018-11-18 13:15:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-18 13:15:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1209 transitions. [2018-11-18 13:15:21,562 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1209 transitions. Word has length 50 [2018-11-18 13:15:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:21,562 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 1209 transitions. [2018-11-18 13:15:21,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:15:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1209 transitions. [2018-11-18 13:15:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 13:15:21,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:21,566 INFO L375 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] [2018-11-18 13:15:21,566 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:21,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash -908319536, now seen corresponding path program 1 times [2018-11-18 13:15:21,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:21,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:21,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:21,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:21,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:21,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:21,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:15:21,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:21,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 13:15:21,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:15:21,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:15:21,640 INFO L87 Difference]: Start difference. First operand 880 states and 1209 transitions. Second operand 7 states. [2018-11-18 13:15:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:22,956 INFO L93 Difference]: Finished difference Result 1092 states and 1543 transitions. [2018-11-18 13:15:22,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:15:22,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-18 13:15:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:22,961 INFO L225 Difference]: With dead ends: 1092 [2018-11-18 13:15:22,961 INFO L226 Difference]: Without dead ends: 1001 [2018-11-18 13:15:22,962 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:15:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2018-11-18 13:15:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 859. [2018-11-18 13:15:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2018-11-18 13:15:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1172 transitions. [2018-11-18 13:15:23,016 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1172 transitions. Word has length 50 [2018-11-18 13:15:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:23,016 INFO L480 AbstractCegarLoop]: Abstraction has 859 states and 1172 transitions. [2018-11-18 13:15:23,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 13:15:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1172 transitions. [2018-11-18 13:15:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 13:15:23,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:23,019 INFO L375 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] [2018-11-18 13:15:23,019 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:23,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:23,019 INFO L82 PathProgramCache]: Analyzing trace with hash -761626734, now seen corresponding path program 1 times [2018-11-18 13:15:23,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:23,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:23,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:23,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:23,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:23,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:23,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:23,074 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:23,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:23,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:23,074 INFO L87 Difference]: Start difference. First operand 859 states and 1172 transitions. Second operand 3 states. [2018-11-18 13:15:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:23,178 INFO L93 Difference]: Finished difference Result 1043 states and 1413 transitions. [2018-11-18 13:15:23,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:23,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-18 13:15:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:23,183 INFO L225 Difference]: With dead ends: 1043 [2018-11-18 13:15:23,183 INFO L226 Difference]: Without dead ends: 1003 [2018-11-18 13:15:23,186 INFO L604 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-11-18 13:15:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-18 13:15:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 893. [2018-11-18 13:15:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-11-18 13:15:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1204 transitions. [2018-11-18 13:15:23,241 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1204 transitions. Word has length 50 [2018-11-18 13:15:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:23,241 INFO L480 AbstractCegarLoop]: Abstraction has 893 states and 1204 transitions. [2018-11-18 13:15:23,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1204 transitions. [2018-11-18 13:15:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 13:15:23,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:23,243 INFO L375 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] [2018-11-18 13:15:23,245 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:23,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:23,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1782043445, now seen corresponding path program 1 times [2018-11-18 13:15:23,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:23,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:23,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:23,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:23,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:23,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:23,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:15:23,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:23,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:15:23,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:15:23,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:15:23,317 INFO L87 Difference]: Start difference. First operand 893 states and 1204 transitions. Second operand 9 states. [2018-11-18 13:15:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:24,702 INFO L93 Difference]: Finished difference Result 1215 states and 1676 transitions. [2018-11-18 13:15:24,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 13:15:24,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-18 13:15:24,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:24,707 INFO L225 Difference]: With dead ends: 1215 [2018-11-18 13:15:24,707 INFO L226 Difference]: Without dead ends: 1146 [2018-11-18 13:15:24,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-18 13:15:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2018-11-18 13:15:24,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 906. [2018-11-18 13:15:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-11-18 13:15:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1229 transitions. [2018-11-18 13:15:24,765 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1229 transitions. Word has length 50 [2018-11-18 13:15:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:24,766 INFO L480 AbstractCegarLoop]: Abstraction has 906 states and 1229 transitions. [2018-11-18 13:15:24,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:15:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1229 transitions. [2018-11-18 13:15:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 13:15:24,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:24,768 INFO L375 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-11-18 13:15:24,768 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:24,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash 417807011, now seen corresponding path program 1 times [2018-11-18 13:15:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:24,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:24,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:24,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:24,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:24,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:24,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:24,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:24,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:24,807 INFO L87 Difference]: Start difference. First operand 906 states and 1229 transitions. Second operand 3 states. [2018-11-18 13:15:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:24,913 INFO L93 Difference]: Finished difference Result 934 states and 1261 transitions. [2018-11-18 13:15:24,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:24,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-18 13:15:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:24,917 INFO L225 Difference]: With dead ends: 934 [2018-11-18 13:15:24,917 INFO L226 Difference]: Without dead ends: 929 [2018-11-18 13:15:24,918 INFO L604 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-11-18 13:15:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-11-18 13:15:24,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 923. [2018-11-18 13:15:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-18 13:15:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1250 transitions. [2018-11-18 13:15:24,975 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1250 transitions. Word has length 52 [2018-11-18 13:15:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:24,975 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1250 transitions. [2018-11-18 13:15:24,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1250 transitions. [2018-11-18 13:15:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 13:15:24,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:24,978 INFO L375 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] [2018-11-18 13:15:24,978 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:24,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:24,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1677129215, now seen corresponding path program 1 times [2018-11-18 13:15:24,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:24,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:24,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:24,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:24,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:25,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:25,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:25,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:25,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:25,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:25,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:25,014 INFO L87 Difference]: Start difference. First operand 923 states and 1250 transitions. Second operand 3 states. [2018-11-18 13:15:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:25,124 INFO L93 Difference]: Finished difference Result 1142 states and 1544 transitions. [2018-11-18 13:15:25,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:25,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-18 13:15:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:25,128 INFO L225 Difference]: With dead ends: 1142 [2018-11-18 13:15:25,128 INFO L226 Difference]: Without dead ends: 892 [2018-11-18 13:15:25,129 INFO L604 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-11-18 13:15:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2018-11-18 13:15:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2018-11-18 13:15:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-18 13:15:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1210 transitions. [2018-11-18 13:15:25,183 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1210 transitions. Word has length 54 [2018-11-18 13:15:25,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:25,183 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1210 transitions. [2018-11-18 13:15:25,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1210 transitions. [2018-11-18 13:15:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 13:15:25,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:25,185 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:25,185 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:25,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:25,186 INFO L82 PathProgramCache]: Analyzing trace with hash 510703600, now seen corresponding path program 1 times [2018-11-18 13:15:25,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:25,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:25,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:25,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:25,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:25,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:25,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:25,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:25,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:25,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:25,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:25,235 INFO L87 Difference]: Start difference. First operand 892 states and 1210 transitions. Second operand 5 states. [2018-11-18 13:15:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:25,709 INFO L93 Difference]: Finished difference Result 904 states and 1220 transitions. [2018-11-18 13:15:25,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:25,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-18 13:15:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:25,713 INFO L225 Difference]: With dead ends: 904 [2018-11-18 13:15:25,713 INFO L226 Difference]: Without dead ends: 898 [2018-11-18 13:15:25,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:15:25,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-11-18 13:15:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 892. [2018-11-18 13:15:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-18 13:15:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1209 transitions. [2018-11-18 13:15:25,772 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1209 transitions. Word has length 53 [2018-11-18 13:15:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:25,773 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1209 transitions. [2018-11-18 13:15:25,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1209 transitions. [2018-11-18 13:15:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 13:15:25,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:25,775 INFO L375 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-11-18 13:15:25,775 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:25,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:25,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1022255578, now seen corresponding path program 1 times [2018-11-18 13:15:25,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:25,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:25,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:25,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:25,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:25,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:25,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:25,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:25,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:25,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:25,826 INFO L87 Difference]: Start difference. First operand 892 states and 1209 transitions. Second operand 5 states. [2018-11-18 13:15:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:26,251 INFO L93 Difference]: Finished difference Result 907 states and 1224 transitions. [2018-11-18 13:15:26,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:26,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-18 13:15:26,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:26,254 INFO L225 Difference]: With dead ends: 907 [2018-11-18 13:15:26,254 INFO L226 Difference]: Without dead ends: 871 [2018-11-18 13:15:26,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:15:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-11-18 13:15:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 865. [2018-11-18 13:15:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-18 13:15:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1179 transitions. [2018-11-18 13:15:26,313 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1179 transitions. Word has length 52 [2018-11-18 13:15:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:26,314 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1179 transitions. [2018-11-18 13:15:26,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1179 transitions. [2018-11-18 13:15:26,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 13:15:26,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:26,316 INFO L375 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] [2018-11-18 13:15:26,316 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:26,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1980078936, now seen corresponding path program 1 times [2018-11-18 13:15:26,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:26,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:26,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:26,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:26,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:26,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:26,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:26,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:26,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:26,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:26,356 INFO L87 Difference]: Start difference. First operand 865 states and 1179 transitions. Second operand 5 states. [2018-11-18 13:15:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:26,787 INFO L93 Difference]: Finished difference Result 875 states and 1187 transitions. [2018-11-18 13:15:26,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:26,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-18 13:15:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:26,791 INFO L225 Difference]: With dead ends: 875 [2018-11-18 13:15:26,791 INFO L226 Difference]: Without dead ends: 869 [2018-11-18 13:15:26,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:15:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-11-18 13:15:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 865. [2018-11-18 13:15:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-18 13:15:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1178 transitions. [2018-11-18 13:15:26,848 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1178 transitions. Word has length 54 [2018-11-18 13:15:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:26,848 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1178 transitions. [2018-11-18 13:15:26,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1178 transitions. [2018-11-18 13:15:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 13:15:26,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:26,851 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:26,851 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:26,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash -940758887, now seen corresponding path program 1 times [2018-11-18 13:15:26,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:26,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:26,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:26,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:26,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:26,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:26,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:15:26,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:26,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:15:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:15:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:15:26,936 INFO L87 Difference]: Start difference. First operand 865 states and 1178 transitions. Second operand 9 states. [2018-11-18 13:15:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:27,091 INFO L93 Difference]: Finished difference Result 892 states and 1208 transitions. [2018-11-18 13:15:27,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:15:27,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-18 13:15:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:27,094 INFO L225 Difference]: With dead ends: 892 [2018-11-18 13:15:27,094 INFO L226 Difference]: Without dead ends: 856 [2018-11-18 13:15:27,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:15:27,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-18 13:15:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-18 13:15:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-18 13:15:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1154 transitions. [2018-11-18 13:15:27,151 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1154 transitions. Word has length 55 [2018-11-18 13:15:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:27,151 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1154 transitions. [2018-11-18 13:15:27,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:15:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1154 transitions. [2018-11-18 13:15:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 13:15:27,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:27,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:27,154 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:27,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:27,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1784333833, now seen corresponding path program 1 times [2018-11-18 13:15:27,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:27,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:27,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:27,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:27,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 13:15:27,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:27,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:15:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:15:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:15:27,264 INFO L87 Difference]: Start difference. First operand 856 states and 1154 transitions. Second operand 10 states. [2018-11-18 13:15:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:27,477 INFO L93 Difference]: Finished difference Result 872 states and 1171 transitions. [2018-11-18 13:15:27,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 13:15:27,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-18 13:15:27,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:27,481 INFO L225 Difference]: With dead ends: 872 [2018-11-18 13:15:27,481 INFO L226 Difference]: Without dead ends: 854 [2018-11-18 13:15:27,482 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:15:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-18 13:15:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2018-11-18 13:15:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-11-18 13:15:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1150 transitions. [2018-11-18 13:15:27,538 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1150 transitions. Word has length 55 [2018-11-18 13:15:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:27,539 INFO L480 AbstractCegarLoop]: Abstraction has 854 states and 1150 transitions. [2018-11-18 13:15:27,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:15:27,539 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1150 transitions. [2018-11-18 13:15:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 13:15:27,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:27,544 INFO L375 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] [2018-11-18 13:15:27,544 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:27,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1216941212, now seen corresponding path program 1 times [2018-11-18 13:15:27,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:27,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:27,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:27,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:27,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 13:15:27,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:27,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:15:27,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:15:27,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:15:27,683 INFO L87 Difference]: Start difference. First operand 854 states and 1150 transitions. Second operand 10 states. [2018-11-18 13:15:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:27,894 INFO L93 Difference]: Finished difference Result 867 states and 1164 transitions. [2018-11-18 13:15:27,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 13:15:27,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-18 13:15:27,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:27,897 INFO L225 Difference]: With dead ends: 867 [2018-11-18 13:15:27,897 INFO L226 Difference]: Without dead ends: 849 [2018-11-18 13:15:27,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:15:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-11-18 13:15:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2018-11-18 13:15:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-11-18 13:15:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1143 transitions. [2018-11-18 13:15:27,930 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1143 transitions. Word has length 56 [2018-11-18 13:15:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:27,930 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1143 transitions. [2018-11-18 13:15:27,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:15:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1143 transitions. [2018-11-18 13:15:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 13:15:27,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:27,932 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 13:15:27,932 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:27,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:27,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1022243439, now seen corresponding path program 1 times [2018-11-18 13:15:27,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:27,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:27,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:27,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:27,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:27,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:27,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:27,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:27,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:27,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:27,968 INFO L87 Difference]: Start difference. First operand 849 states and 1143 transitions. Second operand 5 states. [2018-11-18 13:15:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:28,290 INFO L93 Difference]: Finished difference Result 1286 states and 1741 transitions. [2018-11-18 13:15:28,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:28,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-18 13:15:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:28,294 INFO L225 Difference]: With dead ends: 1286 [2018-11-18 13:15:28,294 INFO L226 Difference]: Without dead ends: 838 [2018-11-18 13:15:28,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:15:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-18 13:15:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-11-18 13:15:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-18 13:15:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1114 transitions. [2018-11-18 13:15:28,348 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1114 transitions. Word has length 73 [2018-11-18 13:15:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:28,348 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1114 transitions. [2018-11-18 13:15:28,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1114 transitions. [2018-11-18 13:15:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 13:15:28,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:28,350 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 13:15:28,350 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:28,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:28,351 INFO L82 PathProgramCache]: Analyzing trace with hash 114642694, now seen corresponding path program 1 times [2018-11-18 13:15:28,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:28,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:28,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:28,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:28,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:28,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:28,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:28,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:28,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:28,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:28,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:28,402 INFO L87 Difference]: Start difference. First operand 838 states and 1114 transitions. Second operand 3 states. [2018-11-18 13:15:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:28,466 INFO L93 Difference]: Finished difference Result 970 states and 1274 transitions. [2018-11-18 13:15:28,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:28,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-18 13:15:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:28,470 INFO L225 Difference]: With dead ends: 970 [2018-11-18 13:15:28,470 INFO L226 Difference]: Without dead ends: 878 [2018-11-18 13:15:28,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-11-18 13:15:28,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 855. [2018-11-18 13:15:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2018-11-18 13:15:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1133 transitions. [2018-11-18 13:15:28,513 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1133 transitions. Word has length 74 [2018-11-18 13:15:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:28,513 INFO L480 AbstractCegarLoop]: Abstraction has 855 states and 1133 transitions. [2018-11-18 13:15:28,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1133 transitions. [2018-11-18 13:15:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 13:15:28,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:28,515 INFO L375 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] [2018-11-18 13:15:28,515 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:28,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash -511443696, now seen corresponding path program 1 times [2018-11-18 13:15:28,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:28,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:28,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:28,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:28,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:28,672 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-18 13:15:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:28,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:28,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:28,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:28,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:28,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:28,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:28,681 INFO L87 Difference]: Start difference. First operand 855 states and 1133 transitions. Second operand 5 states. [2018-11-18 13:15:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:28,920 INFO L93 Difference]: Finished difference Result 890 states and 1175 transitions. [2018-11-18 13:15:28,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:28,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-18 13:15:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:28,925 INFO L225 Difference]: With dead ends: 890 [2018-11-18 13:15:28,927 INFO L226 Difference]: Without dead ends: 862 [2018-11-18 13:15:28,928 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:15:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2018-11-18 13:15:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 860. [2018-11-18 13:15:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-11-18 13:15:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1142 transitions. [2018-11-18 13:15:29,005 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1142 transitions. Word has length 62 [2018-11-18 13:15:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:29,005 INFO L480 AbstractCegarLoop]: Abstraction has 860 states and 1142 transitions. [2018-11-18 13:15:29,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1142 transitions. [2018-11-18 13:15:29,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 13:15:29,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:29,007 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:29,007 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:29,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:29,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1954254295, now seen corresponding path program 1 times [2018-11-18 13:15:29,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:29,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:29,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:29,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:29,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:29,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:29,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 13:15:29,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:29,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 13:15:29,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:15:29,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:15:29,134 INFO L87 Difference]: Start difference. First operand 860 states and 1142 transitions. Second operand 12 states. [2018-11-18 13:15:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:29,300 INFO L93 Difference]: Finished difference Result 886 states and 1171 transitions. [2018-11-18 13:15:29,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:15:29,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-18 13:15:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:29,303 INFO L225 Difference]: With dead ends: 886 [2018-11-18 13:15:29,303 INFO L226 Difference]: Without dead ends: 861 [2018-11-18 13:15:29,303 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 13:15:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-11-18 13:15:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 859. [2018-11-18 13:15:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2018-11-18 13:15:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1131 transitions. [2018-11-18 13:15:29,338 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1131 transitions. Word has length 59 [2018-11-18 13:15:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:29,338 INFO L480 AbstractCegarLoop]: Abstraction has 859 states and 1131 transitions. [2018-11-18 13:15:29,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 13:15:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1131 transitions. [2018-11-18 13:15:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 13:15:29,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:29,339 INFO L375 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] [2018-11-18 13:15:29,340 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:29,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1309677282, now seen corresponding path program 1 times [2018-11-18 13:15:29,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:29,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:29,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:29,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:29,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:29,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:29,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 13:15:29,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:29,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:15:29,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:15:29,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:15:29,467 INFO L87 Difference]: Start difference. First operand 859 states and 1131 transitions. Second operand 11 states. [2018-11-18 13:15:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:29,631 INFO L93 Difference]: Finished difference Result 876 states and 1149 transitions. [2018-11-18 13:15:29,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:15:29,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-18 13:15:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:29,633 INFO L225 Difference]: With dead ends: 876 [2018-11-18 13:15:29,634 INFO L226 Difference]: Without dead ends: 856 [2018-11-18 13:15:29,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:15:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-18 13:15:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-18 13:15:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-18 13:15:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1126 transitions. [2018-11-18 13:15:29,670 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1126 transitions. Word has length 58 [2018-11-18 13:15:29,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:29,670 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1126 transitions. [2018-11-18 13:15:29,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:15:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1126 transitions. [2018-11-18 13:15:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 13:15:29,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:29,672 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:29,672 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:29,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:29,673 INFO L82 PathProgramCache]: Analyzing trace with hash -719999499, now seen corresponding path program 1 times [2018-11-18 13:15:29,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:29,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:29,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:29,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:29,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:29,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:29,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 13:15:29,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:29,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:15:29,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:15:29,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:15:29,751 INFO L87 Difference]: Start difference. First operand 856 states and 1126 transitions. Second operand 10 states. [2018-11-18 13:15:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:30,051 INFO L93 Difference]: Finished difference Result 923 states and 1201 transitions. [2018-11-18 13:15:30,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:15:30,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-11-18 13:15:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:30,052 INFO L225 Difference]: With dead ends: 923 [2018-11-18 13:15:30,052 INFO L226 Difference]: Without dead ends: 814 [2018-11-18 13:15:30,053 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:15:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2018-11-18 13:15:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 811. [2018-11-18 13:15:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-11-18 13:15:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1045 transitions. [2018-11-18 13:15:30,084 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1045 transitions. Word has length 59 [2018-11-18 13:15:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:30,084 INFO L480 AbstractCegarLoop]: Abstraction has 811 states and 1045 transitions. [2018-11-18 13:15:30,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:15:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1045 transitions. [2018-11-18 13:15:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 13:15:30,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:30,086 INFO L375 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-11-18 13:15:30,086 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:30,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash -98888530, now seen corresponding path program 1 times [2018-11-18 13:15:30,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:30,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:30,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:30,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:30,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:30,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:30,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:15:30,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:30,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:15:30,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:15:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:15:30,108 INFO L87 Difference]: Start difference. First operand 811 states and 1045 transitions. Second operand 4 states. [2018-11-18 13:15:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:30,214 INFO L93 Difference]: Finished difference Result 956 states and 1239 transitions. [2018-11-18 13:15:30,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:15:30,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-18 13:15:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:30,217 INFO L225 Difference]: With dead ends: 956 [2018-11-18 13:15:30,218 INFO L226 Difference]: Without dead ends: 849 [2018-11-18 13:15:30,219 INFO L604 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-11-18 13:15:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-11-18 13:15:30,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 818. [2018-11-18 13:15:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-11-18 13:15:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1059 transitions. [2018-11-18 13:15:30,253 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1059 transitions. Word has length 60 [2018-11-18 13:15:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:30,253 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1059 transitions. [2018-11-18 13:15:30,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:15:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1059 transitions. [2018-11-18 13:15:30,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 13:15:30,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:30,255 INFO L375 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-11-18 13:15:30,255 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:30,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash 175871084, now seen corresponding path program 1 times [2018-11-18 13:15:30,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:30,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:30,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:30,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:30,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 13:15:30,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:30,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:15:30,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:15:30,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:15:30,316 INFO L87 Difference]: Start difference. First operand 818 states and 1059 transitions. Second operand 11 states. [2018-11-18 13:15:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:30,407 INFO L93 Difference]: Finished difference Result 885 states and 1148 transitions. [2018-11-18 13:15:30,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:15:30,408 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-18 13:15:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:30,410 INFO L225 Difference]: With dead ends: 885 [2018-11-18 13:15:30,410 INFO L226 Difference]: Without dead ends: 830 [2018-11-18 13:15:30,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:15:30,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2018-11-18 13:15:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 822. [2018-11-18 13:15:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2018-11-18 13:15:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1076 transitions. [2018-11-18 13:15:30,442 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1076 transitions. Word has length 60 [2018-11-18 13:15:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:30,442 INFO L480 AbstractCegarLoop]: Abstraction has 822 states and 1076 transitions. [2018-11-18 13:15:30,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:15:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1076 transitions. [2018-11-18 13:15:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 13:15:30,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:30,444 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:30,444 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:30,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash -45856341, now seen corresponding path program 1 times [2018-11-18 13:15:30,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:30,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:30,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:30,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:30,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:30,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:30,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 13:15:30,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:30,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 13:15:30,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:15:30,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:15:30,522 INFO L87 Difference]: Start difference. First operand 822 states and 1076 transitions. Second operand 12 states. [2018-11-18 13:15:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:30,672 INFO L93 Difference]: Finished difference Result 844 states and 1099 transitions. [2018-11-18 13:15:30,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:15:30,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-18 13:15:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:30,675 INFO L225 Difference]: With dead ends: 844 [2018-11-18 13:15:30,675 INFO L226 Difference]: Without dead ends: 820 [2018-11-18 13:15:30,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 13:15:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2018-11-18 13:15:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 820. [2018-11-18 13:15:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-11-18 13:15:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1071 transitions. [2018-11-18 13:15:30,707 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1071 transitions. Word has length 63 [2018-11-18 13:15:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:30,708 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 1071 transitions. [2018-11-18 13:15:30,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 13:15:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1071 transitions. [2018-11-18 13:15:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 13:15:30,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:30,709 INFO L375 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] [2018-11-18 13:15:30,710 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:30,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash 190156178, now seen corresponding path program 1 times [2018-11-18 13:15:30,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:30,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:30,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:30,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:30,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:30,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:30,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 13:15:30,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:30,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 13:15:30,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:15:30,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:15:30,783 INFO L87 Difference]: Start difference. First operand 820 states and 1071 transitions. Second operand 12 states. [2018-11-18 13:15:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:30,922 INFO L93 Difference]: Finished difference Result 844 states and 1096 transitions. [2018-11-18 13:15:30,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:15:30,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-18 13:15:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:30,925 INFO L225 Difference]: With dead ends: 844 [2018-11-18 13:15:30,925 INFO L226 Difference]: Without dead ends: 820 [2018-11-18 13:15:30,925 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 13:15:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2018-11-18 13:15:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 818. [2018-11-18 13:15:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-11-18 13:15:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1067 transitions. [2018-11-18 13:15:30,957 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1067 transitions. Word has length 62 [2018-11-18 13:15:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:30,957 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1067 transitions. [2018-11-18 13:15:30,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 13:15:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1067 transitions. [2018-11-18 13:15:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 13:15:30,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:30,959 INFO L375 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] [2018-11-18 13:15:30,959 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:30,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash 478731919, now seen corresponding path program 1 times [2018-11-18 13:15:30,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:30,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:30,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:30,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:30,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:30,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:30,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:30,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:30,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:30,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:30,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:30,986 INFO L87 Difference]: Start difference. First operand 818 states and 1067 transitions. Second operand 3 states. [2018-11-18 13:15:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:31,015 INFO L93 Difference]: Finished difference Result 1072 states and 1392 transitions. [2018-11-18 13:15:31,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:31,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-18 13:15:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:31,018 INFO L225 Difference]: With dead ends: 1072 [2018-11-18 13:15:31,018 INFO L226 Difference]: Without dead ends: 764 [2018-11-18 13:15:31,020 INFO L604 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-11-18 13:15:31,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-11-18 13:15:31,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 746. [2018-11-18 13:15:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-11-18 13:15:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 950 transitions. [2018-11-18 13:15:31,052 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 950 transitions. Word has length 62 [2018-11-18 13:15:31,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:31,052 INFO L480 AbstractCegarLoop]: Abstraction has 746 states and 950 transitions. [2018-11-18 13:15:31,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 950 transitions. [2018-11-18 13:15:31,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 13:15:31,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:31,054 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:31,054 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:31,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:31,054 INFO L82 PathProgramCache]: Analyzing trace with hash -48275879, now seen corresponding path program 1 times [2018-11-18 13:15:31,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:31,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:31,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:31,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:31,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:31,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:31,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 13:15:31,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:31,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 13:15:31,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 13:15:31,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:15:31,155 INFO L87 Difference]: Start difference. First operand 746 states and 950 transitions. Second operand 13 states. [2018-11-18 13:15:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:31,310 INFO L93 Difference]: Finished difference Result 763 states and 968 transitions. [2018-11-18 13:15:31,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 13:15:31,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-18 13:15:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:31,311 INFO L225 Difference]: With dead ends: 763 [2018-11-18 13:15:31,312 INFO L226 Difference]: Without dead ends: 741 [2018-11-18 13:15:31,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 13:15:31,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-18 13:15:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2018-11-18 13:15:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-11-18 13:15:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 943 transitions. [2018-11-18 13:15:31,369 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 943 transitions. Word has length 63 [2018-11-18 13:15:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:31,369 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 943 transitions. [2018-11-18 13:15:31,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 13:15:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 943 transitions. [2018-11-18 13:15:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 13:15:31,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:31,371 INFO L375 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] [2018-11-18 13:15:31,371 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:31,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:31,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1663625934, now seen corresponding path program 1 times [2018-11-18 13:15:31,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:31,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:31,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:31,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:31,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:31,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:31,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 13:15:31,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:31,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 13:15:31,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 13:15:31,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:15:31,512 INFO L87 Difference]: Start difference. First operand 741 states and 943 transitions. Second operand 13 states. [2018-11-18 13:15:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:31,737 INFO L93 Difference]: Finished difference Result 758 states and 961 transitions. [2018-11-18 13:15:31,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 13:15:31,738 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-18 13:15:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:31,740 INFO L225 Difference]: With dead ends: 758 [2018-11-18 13:15:31,740 INFO L226 Difference]: Without dead ends: 733 [2018-11-18 13:15:31,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 13:15:31,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-18 13:15:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2018-11-18 13:15:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-18 13:15:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 933 transitions. [2018-11-18 13:15:31,789 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 933 transitions. Word has length 62 [2018-11-18 13:15:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:31,789 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 933 transitions. [2018-11-18 13:15:31,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 13:15:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 933 transitions. [2018-11-18 13:15:31,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 13:15:31,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:31,790 INFO L375 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-11-18 13:15:31,791 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:31,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:31,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1136441437, now seen corresponding path program 1 times [2018-11-18 13:15:31,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:31,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:31,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:31,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:31,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:31,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:31,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:31,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:31,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:31,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:31,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:31,835 INFO L87 Difference]: Start difference. First operand 733 states and 933 transitions. Second operand 3 states. [2018-11-18 13:15:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:31,893 INFO L93 Difference]: Finished difference Result 855 states and 1091 transitions. [2018-11-18 13:15:31,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:31,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 13:15:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:31,896 INFO L225 Difference]: With dead ends: 855 [2018-11-18 13:15:31,896 INFO L226 Difference]: Without dead ends: 733 [2018-11-18 13:15:31,897 INFO L604 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-11-18 13:15:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-18 13:15:31,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2018-11-18 13:15:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-18 13:15:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 931 transitions. [2018-11-18 13:15:31,947 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 931 transitions. Word has length 66 [2018-11-18 13:15:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:31,950 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 931 transitions. [2018-11-18 13:15:31,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 931 transitions. [2018-11-18 13:15:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 13:15:31,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:31,951 INFO L375 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-11-18 13:15:31,952 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:31,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:31,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1639810645, now seen corresponding path program 1 times [2018-11-18 13:15:31,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:31,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:31,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:31,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:31,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:32,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:32,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 13:15:32,074 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:32,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 13:15:32,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:15:32,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:15:32,075 INFO L87 Difference]: Start difference. First operand 733 states and 931 transitions. Second operand 12 states. [2018-11-18 13:15:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:32,229 INFO L93 Difference]: Finished difference Result 757 states and 956 transitions. [2018-11-18 13:15:32,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:15:32,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-18 13:15:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:32,232 INFO L225 Difference]: With dead ends: 757 [2018-11-18 13:15:32,232 INFO L226 Difference]: Without dead ends: 733 [2018-11-18 13:15:32,232 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 13:15:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-18 13:15:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2018-11-18 13:15:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-11-18 13:15:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 927 transitions. [2018-11-18 13:15:32,262 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 927 transitions. Word has length 66 [2018-11-18 13:15:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:32,262 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 927 transitions. [2018-11-18 13:15:32,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 13:15:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 927 transitions. [2018-11-18 13:15:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 13:15:32,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:32,264 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:32,264 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:32,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1875964411, now seen corresponding path program 1 times [2018-11-18 13:15:32,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:32,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:32,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:32,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:32,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:32,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:32,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:32,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:32,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:32,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:32,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:32,295 INFO L87 Difference]: Start difference. First operand 731 states and 927 transitions. Second operand 5 states. [2018-11-18 13:15:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:32,343 INFO L93 Difference]: Finished difference Result 777 states and 974 transitions. [2018-11-18 13:15:32,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:32,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-18 13:15:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:32,345 INFO L225 Difference]: With dead ends: 777 [2018-11-18 13:15:32,345 INFO L226 Difference]: Without dead ends: 725 [2018-11-18 13:15:32,346 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-11-18 13:15:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2018-11-18 13:15:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-18 13:15:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 917 transitions. [2018-11-18 13:15:32,374 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 917 transitions. Word has length 65 [2018-11-18 13:15:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:32,375 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 917 transitions. [2018-11-18 13:15:32,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 917 transitions. [2018-11-18 13:15:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 13:15:32,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:32,376 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:32,376 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:32,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1469104238, now seen corresponding path program 1 times [2018-11-18 13:15:32,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:32,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:32,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:32,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:32,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:32,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:32,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 13:15:32,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:32,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 13:15:32,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:15:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:15:32,475 INFO L87 Difference]: Start difference. First operand 725 states and 917 transitions. Second operand 12 states. [2018-11-18 13:15:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:32,595 INFO L93 Difference]: Finished difference Result 748 states and 941 transitions. [2018-11-18 13:15:32,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:15:32,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-18 13:15:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:32,597 INFO L225 Difference]: With dead ends: 748 [2018-11-18 13:15:32,597 INFO L226 Difference]: Without dead ends: 725 [2018-11-18 13:15:32,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-18 13:15:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-11-18 13:15:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2018-11-18 13:15:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-18 13:15:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 916 transitions. [2018-11-18 13:15:32,627 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 916 transitions. Word has length 70 [2018-11-18 13:15:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:32,627 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 916 transitions. [2018-11-18 13:15:32,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 13:15:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 916 transitions. [2018-11-18 13:15:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 13:15:32,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:32,629 INFO L375 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] [2018-11-18 13:15:32,629 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:32,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1037531791, now seen corresponding path program 1 times [2018-11-18 13:15:32,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:32,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:32,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:32,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:32,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:32,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:32,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 13:15:32,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:32,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 13:15:32,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:15:32,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:15:32,713 INFO L87 Difference]: Start difference. First operand 725 states and 916 transitions. Second operand 12 states. [2018-11-18 13:15:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:32,835 INFO L93 Difference]: Finished difference Result 747 states and 939 transitions. [2018-11-18 13:15:32,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:15:32,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-18 13:15:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:32,838 INFO L225 Difference]: With dead ends: 747 [2018-11-18 13:15:32,838 INFO L226 Difference]: Without dead ends: 723 [2018-11-18 13:15:32,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 13:15:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-11-18 13:15:32,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2018-11-18 13:15:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-11-18 13:15:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 912 transitions. [2018-11-18 13:15:32,867 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 912 transitions. Word has length 67 [2018-11-18 13:15:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:32,867 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 912 transitions. [2018-11-18 13:15:32,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 13:15:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 912 transitions. [2018-11-18 13:15:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 13:15:32,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:32,869 INFO L375 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] [2018-11-18 13:15:32,869 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:32,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1477541838, now seen corresponding path program 1 times [2018-11-18 13:15:32,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:32,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:32,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:32,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:32,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:32,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:32,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:32,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:32,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:32,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:32,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:32,903 INFO L87 Difference]: Start difference. First operand 723 states and 912 transitions. Second operand 5 states. [2018-11-18 13:15:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:32,950 INFO L93 Difference]: Finished difference Result 757 states and 947 transitions. [2018-11-18 13:15:32,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:32,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-18 13:15:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:32,953 INFO L225 Difference]: With dead ends: 757 [2018-11-18 13:15:32,953 INFO L226 Difference]: Without dead ends: 718 [2018-11-18 13:15:32,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-11-18 13:15:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2018-11-18 13:15:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-11-18 13:15:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 905 transitions. [2018-11-18 13:15:32,987 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 905 transitions. Word has length 67 [2018-11-18 13:15:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:32,987 INFO L480 AbstractCegarLoop]: Abstraction has 718 states and 905 transitions. [2018-11-18 13:15:32,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 905 transitions. [2018-11-18 13:15:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 13:15:32,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:32,989 INFO L375 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] [2018-11-18 13:15:32,989 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:32,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:32,989 INFO L82 PathProgramCache]: Analyzing trace with hash 800562057, now seen corresponding path program 1 times [2018-11-18 13:15:32,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:32,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:32,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:32,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:32,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:33,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:33,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:33,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:33,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:33,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:33,038 INFO L87 Difference]: Start difference. First operand 718 states and 905 transitions. Second operand 5 states. [2018-11-18 13:15:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:33,348 INFO L93 Difference]: Finished difference Result 802 states and 1010 transitions. [2018-11-18 13:15:33,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:33,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-18 13:15:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:33,350 INFO L225 Difference]: With dead ends: 802 [2018-11-18 13:15:33,350 INFO L226 Difference]: Without dead ends: 793 [2018-11-18 13:15:33,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:15:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-11-18 13:15:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 718. [2018-11-18 13:15:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-11-18 13:15:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 903 transitions. [2018-11-18 13:15:33,401 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 903 transitions. Word has length 68 [2018-11-18 13:15:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:33,401 INFO L480 AbstractCegarLoop]: Abstraction has 718 states and 903 transitions. [2018-11-18 13:15:33,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 903 transitions. [2018-11-18 13:15:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 13:15:33,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:33,402 INFO L375 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-11-18 13:15:33,403 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:33,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash -130625566, now seen corresponding path program 1 times [2018-11-18 13:15:33,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:33,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:33,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:33,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:33,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:33,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:33,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 13:15:33,562 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:33,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 13:15:33,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 13:15:33,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:15:33,563 INFO L87 Difference]: Start difference. First operand 718 states and 903 transitions. Second operand 13 states. [2018-11-18 13:15:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:33,728 INFO L93 Difference]: Finished difference Result 738 states and 924 transitions. [2018-11-18 13:15:33,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 13:15:33,728 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-18 13:15:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:33,729 INFO L225 Difference]: With dead ends: 738 [2018-11-18 13:15:33,729 INFO L226 Difference]: Without dead ends: 716 [2018-11-18 13:15:33,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 13:15:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-11-18 13:15:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2018-11-18 13:15:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-11-18 13:15:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 899 transitions. [2018-11-18 13:15:33,757 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 899 transitions. Word has length 72 [2018-11-18 13:15:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:33,757 INFO L480 AbstractCegarLoop]: Abstraction has 716 states and 899 transitions. [2018-11-18 13:15:33,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 13:15:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 899 transitions. [2018-11-18 13:15:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 13:15:33,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:33,758 INFO L375 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] [2018-11-18 13:15:33,758 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:33,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1067040035, now seen corresponding path program 1 times [2018-11-18 13:15:33,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:33,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:33,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:33,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:33,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 13:15:33,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:33,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 13:15:33,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 13:15:33,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:15:33,878 INFO L87 Difference]: Start difference. First operand 716 states and 899 transitions. Second operand 13 states. [2018-11-18 13:15:34,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:34,049 INFO L93 Difference]: Finished difference Result 733 states and 917 transitions. [2018-11-18 13:15:34,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 13:15:34,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-18 13:15:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:34,051 INFO L225 Difference]: With dead ends: 733 [2018-11-18 13:15:34,051 INFO L226 Difference]: Without dead ends: 705 [2018-11-18 13:15:34,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 13:15:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-11-18 13:15:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2018-11-18 13:15:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-11-18 13:15:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 884 transitions. [2018-11-18 13:15:34,100 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 884 transitions. Word has length 69 [2018-11-18 13:15:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:34,100 INFO L480 AbstractCegarLoop]: Abstraction has 705 states and 884 transitions. [2018-11-18 13:15:34,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 13:15:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 884 transitions. [2018-11-18 13:15:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 13:15:34,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:34,101 INFO L375 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] [2018-11-18 13:15:34,102 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:34,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1565081602, now seen corresponding path program 1 times [2018-11-18 13:15:34,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:34,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:34,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:34,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:34,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:34,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:34,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:15:34,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:34,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 13:15:34,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:15:34,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:15:34,163 INFO L87 Difference]: Start difference. First operand 705 states and 884 transitions. Second operand 7 states. [2018-11-18 13:15:34,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:34,256 INFO L93 Difference]: Finished difference Result 751 states and 931 transitions. [2018-11-18 13:15:34,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:15:34,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-18 13:15:34,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:34,258 INFO L225 Difference]: With dead ends: 751 [2018-11-18 13:15:34,258 INFO L226 Difference]: Without dead ends: 706 [2018-11-18 13:15:34,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:15:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-11-18 13:15:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 704. [2018-11-18 13:15:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-11-18 13:15:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 880 transitions. [2018-11-18 13:15:34,294 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 880 transitions. Word has length 74 [2018-11-18 13:15:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:34,294 INFO L480 AbstractCegarLoop]: Abstraction has 704 states and 880 transitions. [2018-11-18 13:15:34,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 13:15:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 880 transitions. [2018-11-18 13:15:34,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 13:15:34,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:34,296 INFO L375 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] [2018-11-18 13:15:34,296 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:34,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:34,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2028285820, now seen corresponding path program 1 times [2018-11-18 13:15:34,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:34,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:34,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:34,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:34,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:34,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:34,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 13:15:34,433 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:34,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 13:15:34,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 13:15:34,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:15:34,433 INFO L87 Difference]: Start difference. First operand 704 states and 880 transitions. Second operand 14 states. [2018-11-18 13:15:34,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:34,562 INFO L93 Difference]: Finished difference Result 726 states and 903 transitions. [2018-11-18 13:15:34,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 13:15:34,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-18 13:15:34,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:34,565 INFO L225 Difference]: With dead ends: 726 [2018-11-18 13:15:34,565 INFO L226 Difference]: Without dead ends: 694 [2018-11-18 13:15:34,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:15:34,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-11-18 13:15:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2018-11-18 13:15:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-11-18 13:15:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 865 transitions. [2018-11-18 13:15:34,595 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 865 transitions. Word has length 74 [2018-11-18 13:15:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:34,595 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 865 transitions. [2018-11-18 13:15:34,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 13:15:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 865 transitions. [2018-11-18 13:15:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 13:15:34,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:34,597 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:34,597 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:34,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2124263184, now seen corresponding path program 1 times [2018-11-18 13:15:34,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:34,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:34,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:34,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:34,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:34,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:34,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 13:15:34,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:34,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 13:15:34,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 13:15:34,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:15:34,684 INFO L87 Difference]: Start difference. First operand 694 states and 865 transitions. Second operand 14 states. [2018-11-18 13:15:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:34,809 INFO L93 Difference]: Finished difference Result 718 states and 891 transitions. [2018-11-18 13:15:34,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 13:15:34,810 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-18 13:15:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:34,811 INFO L225 Difference]: With dead ends: 718 [2018-11-18 13:15:34,811 INFO L226 Difference]: Without dead ends: 690 [2018-11-18 13:15:34,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:15:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-11-18 13:15:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2018-11-18 13:15:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-11-18 13:15:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 859 transitions. [2018-11-18 13:15:34,841 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 859 transitions. Word has length 70 [2018-11-18 13:15:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:34,841 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 859 transitions. [2018-11-18 13:15:34,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 13:15:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 859 transitions. [2018-11-18 13:15:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 13:15:34,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:34,842 INFO L375 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] [2018-11-18 13:15:34,843 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:34,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1425039817, now seen corresponding path program 1 times [2018-11-18 13:15:34,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:34,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:34,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:34,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:34,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:34,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:34,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:34,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:34,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:34,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:34,916 INFO L87 Difference]: Start difference. First operand 690 states and 859 transitions. Second operand 5 states. [2018-11-18 13:15:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:34,973 INFO L93 Difference]: Finished difference Result 724 states and 894 transitions. [2018-11-18 13:15:34,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:34,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-18 13:15:34,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:34,974 INFO L225 Difference]: With dead ends: 724 [2018-11-18 13:15:34,974 INFO L226 Difference]: Without dead ends: 685 [2018-11-18 13:15:34,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-11-18 13:15:35,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2018-11-18 13:15:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2018-11-18 13:15:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 852 transitions. [2018-11-18 13:15:35,003 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 852 transitions. Word has length 69 [2018-11-18 13:15:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:35,003 INFO L480 AbstractCegarLoop]: Abstraction has 685 states and 852 transitions. [2018-11-18 13:15:35,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:35,003 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 852 transitions. [2018-11-18 13:15:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 13:15:35,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:35,004 INFO L375 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] [2018-11-18 13:15:35,004 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:35,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1329535212, now seen corresponding path program 1 times [2018-11-18 13:15:35,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:35,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:35,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:35,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:35,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 13:15:35,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:35,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:15:35,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:15:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:15:35,063 INFO L87 Difference]: Start difference. First operand 685 states and 852 transitions. Second operand 11 states. [2018-11-18 13:15:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:35,135 INFO L93 Difference]: Finished difference Result 712 states and 882 transitions. [2018-11-18 13:15:35,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:15:35,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-18 13:15:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:35,136 INFO L225 Difference]: With dead ends: 712 [2018-11-18 13:15:35,136 INFO L226 Difference]: Without dead ends: 682 [2018-11-18 13:15:35,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:15:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-11-18 13:15:35,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2018-11-18 13:15:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-11-18 13:15:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 847 transitions. [2018-11-18 13:15:35,164 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 847 transitions. Word has length 69 [2018-11-18 13:15:35,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:35,165 INFO L480 AbstractCegarLoop]: Abstraction has 682 states and 847 transitions. [2018-11-18 13:15:35,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:15:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 847 transitions. [2018-11-18 13:15:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 13:15:35,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:35,165 INFO L375 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] [2018-11-18 13:15:35,166 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:35,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:35,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1592706261, now seen corresponding path program 1 times [2018-11-18 13:15:35,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:35,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:35,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 13:15:35,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:35,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:15:35,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:15:35,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:15:35,251 INFO L87 Difference]: Start difference. First operand 682 states and 847 transitions. Second operand 11 states. [2018-11-18 13:15:35,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:35,371 INFO L93 Difference]: Finished difference Result 692 states and 856 transitions. [2018-11-18 13:15:35,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:15:35,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-18 13:15:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:35,372 INFO L225 Difference]: With dead ends: 692 [2018-11-18 13:15:35,372 INFO L226 Difference]: Without dead ends: 686 [2018-11-18 13:15:35,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:15:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-11-18 13:15:35,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 679. [2018-11-18 13:15:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2018-11-18 13:15:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 840 transitions. [2018-11-18 13:15:35,399 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 840 transitions. Word has length 69 [2018-11-18 13:15:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:35,399 INFO L480 AbstractCegarLoop]: Abstraction has 679 states and 840 transitions. [2018-11-18 13:15:35,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:15:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 840 transitions. [2018-11-18 13:15:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 13:15:35,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:35,400 INFO L375 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] [2018-11-18 13:15:35,400 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:35,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:35,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1592983091, now seen corresponding path program 1 times [2018-11-18 13:15:35,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:35,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:35,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:35,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:35,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:35,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:35,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:35,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:35,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:35,433 INFO L87 Difference]: Start difference. First operand 679 states and 840 transitions. Second operand 5 states. [2018-11-18 13:15:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:35,665 INFO L93 Difference]: Finished difference Result 757 states and 939 transitions. [2018-11-18 13:15:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:35,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-18 13:15:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:35,667 INFO L225 Difference]: With dead ends: 757 [2018-11-18 13:15:35,667 INFO L226 Difference]: Without dead ends: 722 [2018-11-18 13:15:35,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:15:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-11-18 13:15:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 650. [2018-11-18 13:15:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-11-18 13:15:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 804 transitions. [2018-11-18 13:15:35,696 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 804 transitions. Word has length 69 [2018-11-18 13:15:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:35,696 INFO L480 AbstractCegarLoop]: Abstraction has 650 states and 804 transitions. [2018-11-18 13:15:35,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 804 transitions. [2018-11-18 13:15:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 13:15:35,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:35,697 INFO L375 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] [2018-11-18 13:15:35,697 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:35,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1499782956, now seen corresponding path program 1 times [2018-11-18 13:15:35,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:35,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:35,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:35,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:35,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:15:35,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:35,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:15:35,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:15:35,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:15:35,727 INFO L87 Difference]: Start difference. First operand 650 states and 804 transitions. Second operand 3 states. [2018-11-18 13:15:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:35,774 INFO L93 Difference]: Finished difference Result 676 states and 834 transitions. [2018-11-18 13:15:35,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:15:35,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-18 13:15:35,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:35,776 INFO L225 Difference]: With dead ends: 676 [2018-11-18 13:15:35,776 INFO L226 Difference]: Without dead ends: 636 [2018-11-18 13:15:35,776 INFO L604 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-11-18 13:15:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-11-18 13:15:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 632. [2018-11-18 13:15:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-11-18 13:15:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 779 transitions. [2018-11-18 13:15:35,803 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 779 transitions. Word has length 69 [2018-11-18 13:15:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:35,803 INFO L480 AbstractCegarLoop]: Abstraction has 632 states and 779 transitions. [2018-11-18 13:15:35,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:15:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 779 transitions. [2018-11-18 13:15:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 13:15:35,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:35,805 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:35,805 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:35,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:35,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1675736100, now seen corresponding path program 1 times [2018-11-18 13:15:35,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:35,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:35,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:35,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:35,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:35,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:35,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:35,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:35,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:35,835 INFO L87 Difference]: Start difference. First operand 632 states and 779 transitions. Second operand 5 states. [2018-11-18 13:15:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:35,878 INFO L93 Difference]: Finished difference Result 679 states and 828 transitions. [2018-11-18 13:15:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:35,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-18 13:15:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:35,880 INFO L225 Difference]: With dead ends: 679 [2018-11-18 13:15:35,880 INFO L226 Difference]: Without dead ends: 636 [2018-11-18 13:15:35,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-11-18 13:15:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 632. [2018-11-18 13:15:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-11-18 13:15:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 778 transitions. [2018-11-18 13:15:35,905 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 778 transitions. Word has length 71 [2018-11-18 13:15:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:35,905 INFO L480 AbstractCegarLoop]: Abstraction has 632 states and 778 transitions. [2018-11-18 13:15:35,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 778 transitions. [2018-11-18 13:15:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 13:15:35,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:35,906 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:35,906 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:35,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:35,906 INFO L82 PathProgramCache]: Analyzing trace with hash -568247198, now seen corresponding path program 1 times [2018-11-18 13:15:35,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:35,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:35,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:35,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 13:15:35,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:35,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 13:15:35,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 13:15:35,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:15:35,979 INFO L87 Difference]: Start difference. First operand 632 states and 778 transitions. Second operand 14 states. [2018-11-18 13:15:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:36,091 INFO L93 Difference]: Finished difference Result 656 states and 804 transitions. [2018-11-18 13:15:36,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 13:15:36,091 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-18 13:15:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:36,092 INFO L225 Difference]: With dead ends: 656 [2018-11-18 13:15:36,092 INFO L226 Difference]: Without dead ends: 625 [2018-11-18 13:15:36,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:15:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-18 13:15:36,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2018-11-18 13:15:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-11-18 13:15:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 768 transitions. [2018-11-18 13:15:36,119 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 768 transitions. Word has length 71 [2018-11-18 13:15:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:36,119 INFO L480 AbstractCegarLoop]: Abstraction has 625 states and 768 transitions. [2018-11-18 13:15:36,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 13:15:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 768 transitions. [2018-11-18 13:15:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 13:15:36,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:36,120 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:36,120 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:36,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:36,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1632308359, now seen corresponding path program 1 times [2018-11-18 13:15:36,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:36,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:36,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:36,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:36,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:36,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:36,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 13:15:36,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:36,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 13:15:36,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 13:15:36,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:15:36,198 INFO L87 Difference]: Start difference. First operand 625 states and 768 transitions. Second operand 14 states. [2018-11-18 13:15:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:36,317 INFO L93 Difference]: Finished difference Result 689 states and 836 transitions. [2018-11-18 13:15:36,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 13:15:36,318 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-18 13:15:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:36,319 INFO L225 Difference]: With dead ends: 689 [2018-11-18 13:15:36,319 INFO L226 Difference]: Without dead ends: 619 [2018-11-18 13:15:36,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:15:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-18 13:15:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2018-11-18 13:15:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-11-18 13:15:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 759 transitions. [2018-11-18 13:15:36,350 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 759 transitions. Word has length 71 [2018-11-18 13:15:36,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:36,350 INFO L480 AbstractCegarLoop]: Abstraction has 619 states and 759 transitions. [2018-11-18 13:15:36,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 13:15:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 759 transitions. [2018-11-18 13:15:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 13:15:36,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:36,351 INFO L375 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] [2018-11-18 13:15:36,351 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:36,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash 696988224, now seen corresponding path program 1 times [2018-11-18 13:15:36,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:36,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:36,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:36,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:36,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:15:36,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:36,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 13:15:36,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:15:36,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:15:36,423 INFO L87 Difference]: Start difference. First operand 619 states and 759 transitions. Second operand 7 states. [2018-11-18 13:15:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:36,496 INFO L93 Difference]: Finished difference Result 673 states and 820 transitions. [2018-11-18 13:15:36,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:15:36,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-18 13:15:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:36,498 INFO L225 Difference]: With dead ends: 673 [2018-11-18 13:15:36,498 INFO L226 Difference]: Without dead ends: 617 [2018-11-18 13:15:36,498 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:15:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-18 13:15:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2018-11-18 13:15:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-11-18 13:15:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 749 transitions. [2018-11-18 13:15:36,523 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 749 transitions. Word has length 77 [2018-11-18 13:15:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:36,523 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 749 transitions. [2018-11-18 13:15:36,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 13:15:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 749 transitions. [2018-11-18 13:15:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 13:15:36,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:36,524 INFO L375 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] [2018-11-18 13:15:36,524 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:36,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:36,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1398588098, now seen corresponding path program 1 times [2018-11-18 13:15:36,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:36,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:36,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:36,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:36,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 13:15:36,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:36,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 13:15:36,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 13:15:36,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:15:36,601 INFO L87 Difference]: Start difference. First operand 613 states and 749 transitions. Second operand 14 states. [2018-11-18 13:15:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:36,706 INFO L93 Difference]: Finished difference Result 639 states and 777 transitions. [2018-11-18 13:15:36,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 13:15:36,707 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-11-18 13:15:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:36,708 INFO L225 Difference]: With dead ends: 639 [2018-11-18 13:15:36,708 INFO L226 Difference]: Without dead ends: 615 [2018-11-18 13:15:36,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:15:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-11-18 13:15:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2018-11-18 13:15:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-11-18 13:15:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 745 transitions. [2018-11-18 13:15:36,732 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 745 transitions. Word has length 77 [2018-11-18 13:15:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:36,732 INFO L480 AbstractCegarLoop]: Abstraction has 611 states and 745 transitions. [2018-11-18 13:15:36,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 13:15:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 745 transitions. [2018-11-18 13:15:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 13:15:36,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:36,733 INFO L375 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-11-18 13:15:36,733 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:36,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:36,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1770872291, now seen corresponding path program 1 times [2018-11-18 13:15:36,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:36,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:36,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:36,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:36,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:36,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:36,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 13:15:36,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:36,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 13:15:36,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 13:15:36,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:15:36,834 INFO L87 Difference]: Start difference. First operand 611 states and 745 transitions. Second operand 14 states. [2018-11-18 13:15:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:36,942 INFO L93 Difference]: Finished difference Result 670 states and 807 transitions. [2018-11-18 13:15:36,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 13:15:36,942 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-18 13:15:36,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:36,943 INFO L225 Difference]: With dead ends: 670 [2018-11-18 13:15:36,943 INFO L226 Difference]: Without dead ends: 599 [2018-11-18 13:15:36,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:15:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-11-18 13:15:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2018-11-18 13:15:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-11-18 13:15:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 726 transitions. [2018-11-18 13:15:36,968 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 726 transitions. Word has length 72 [2018-11-18 13:15:36,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:36,968 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 726 transitions. [2018-11-18 13:15:36,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 13:15:36,968 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 726 transitions. [2018-11-18 13:15:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 13:15:36,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:36,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:15:36,969 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:36,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:36,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1718873266, now seen corresponding path program 1 times [2018-11-18 13:15:36,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:36,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:36,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:36,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:36,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:37,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:37,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 13:15:37,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:37,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:15:37,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:15:37,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:15:37,041 INFO L87 Difference]: Start difference. First operand 599 states and 726 transitions. Second operand 11 states. [2018-11-18 13:15:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:37,116 INFO L93 Difference]: Finished difference Result 781 states and 937 transitions. [2018-11-18 13:15:37,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:15:37,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-18 13:15:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:37,117 INFO L225 Difference]: With dead ends: 781 [2018-11-18 13:15:37,118 INFO L226 Difference]: Without dead ends: 641 [2018-11-18 13:15:37,118 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:15:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-11-18 13:15:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 605. [2018-11-18 13:15:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-11-18 13:15:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 728 transitions. [2018-11-18 13:15:37,143 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 728 transitions. Word has length 71 [2018-11-18 13:15:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:37,143 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 728 transitions. [2018-11-18 13:15:37,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:15:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 728 transitions. [2018-11-18 13:15:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 13:15:37,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:37,144 INFO L375 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] [2018-11-18 13:15:37,144 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:37,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:37,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1138430218, now seen corresponding path program 1 times [2018-11-18 13:15:37,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:37,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:37,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:37,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:37,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:37,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 13:15:37,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:37,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:15:37,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:15:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:15:37,203 INFO L87 Difference]: Start difference. First operand 605 states and 728 transitions. Second operand 10 states. [2018-11-18 13:15:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:38,058 INFO L93 Difference]: Finished difference Result 1255 states and 1504 transitions. [2018-11-18 13:15:38,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 13:15:38,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-18 13:15:38,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:38,060 INFO L225 Difference]: With dead ends: 1255 [2018-11-18 13:15:38,060 INFO L226 Difference]: Without dead ends: 1108 [2018-11-18 13:15:38,061 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-18 13:15:38,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2018-11-18 13:15:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 967. [2018-11-18 13:15:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2018-11-18 13:15:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1182 transitions. [2018-11-18 13:15:38,103 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1182 transitions. Word has length 73 [2018-11-18 13:15:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:38,104 INFO L480 AbstractCegarLoop]: Abstraction has 967 states and 1182 transitions. [2018-11-18 13:15:38,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:15:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1182 transitions. [2018-11-18 13:15:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 13:15:38,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:38,105 INFO L375 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] [2018-11-18 13:15:38,105 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:38,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1817702472, now seen corresponding path program 1 times [2018-11-18 13:15:38,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:38,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:38,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:38,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:38,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:38,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:38,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:15:38,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:38,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:15:38,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:15:38,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:15:38,142 INFO L87 Difference]: Start difference. First operand 967 states and 1182 transitions. Second operand 6 states. [2018-11-18 13:15:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:38,575 INFO L93 Difference]: Finished difference Result 1253 states and 1496 transitions. [2018-11-18 13:15:38,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:15:38,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-18 13:15:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:38,577 INFO L225 Difference]: With dead ends: 1253 [2018-11-18 13:15:38,577 INFO L226 Difference]: Without dead ends: 1123 [2018-11-18 13:15:38,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:15:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-11-18 13:15:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1047. [2018-11-18 13:15:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2018-11-18 13:15:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1273 transitions. [2018-11-18 13:15:38,625 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1273 transitions. Word has length 73 [2018-11-18 13:15:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:38,625 INFO L480 AbstractCegarLoop]: Abstraction has 1047 states and 1273 transitions. [2018-11-18 13:15:38,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:15:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1273 transitions. [2018-11-18 13:15:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 13:15:38,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:38,627 INFO L375 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] [2018-11-18 13:15:38,627 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:38,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1443465868, now seen corresponding path program 1 times [2018-11-18 13:15:38,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:38,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:38,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:38,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:38,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:15:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:15:38,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:15:38,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:15:38,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:15:38,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:15:38,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:15:38,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:38,657 INFO L87 Difference]: Start difference. First operand 1047 states and 1273 transitions. Second operand 5 states. [2018-11-18 13:15:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:15:38,712 INFO L93 Difference]: Finished difference Result 1092 states and 1321 transitions. [2018-11-18 13:15:38,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:15:38,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-18 13:15:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:15:38,715 INFO L225 Difference]: With dead ends: 1092 [2018-11-18 13:15:38,715 INFO L226 Difference]: Without dead ends: 1031 [2018-11-18 13:15:38,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:15:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-11-18 13:15:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1031. [2018-11-18 13:15:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-11-18 13:15:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1249 transitions. [2018-11-18 13:15:38,786 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1249 transitions. Word has length 73 [2018-11-18 13:15:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:15:38,786 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 1249 transitions. [2018-11-18 13:15:38,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:15:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1249 transitions. [2018-11-18 13:15:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 13:15:38,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:15:38,788 INFO L375 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] [2018-11-18 13:15:38,788 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:15:38,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:15:38,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2027501370, now seen corresponding path program 1 times [2018-11-18 13:15:38,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:15:38,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:38,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:15:38,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:15:38,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:15:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:15:38,835 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 13:15:38,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:15:38 BoogieIcfgContainer [2018-11-18 13:15:38,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:15:38,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:15:38,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:15:38,904 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:15:38,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:15:17" (3/4) ... [2018-11-18 13:15:38,907 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 13:15:38,968 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f8585331-c499-4ec4-8c5e-55724701a271/bin-2019/utaipan/witness.graphml [2018-11-18 13:15:38,969 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:15:38,969 INFO L168 Benchmark]: Toolchain (without parser) took 23316.96 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 731.9 MB). Free memory was 951.1 MB in the beginning and 1.4 GB in the end (delta: -404.1 MB). Peak memory consumption was 327.8 MB. Max. memory is 11.5 GB. [2018-11-18 13:15:38,970 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:15:38,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -206.4 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:15:38,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:15:38,970 INFO L168 Benchmark]: Boogie Preprocessor took 60.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2018-11-18 13:15:38,970 INFO L168 Benchmark]: RCFGBuilder took 987.01 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: 144.2 MB). Peak memory consumption was 144.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:15:38,971 INFO L168 Benchmark]: TraceAbstraction took 21680.80 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 557.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -367.0 MB). Peak memory consumption was 190.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:15:38,971 INFO L168 Benchmark]: Witness Printer took 64.72 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:15:38,972 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 493.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -206.4 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 987.01 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: 144.2 MB). Peak memory consumption was 144.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21680.80 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 557.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -367.0 MB). Peak memory consumption was 190.3 MB. Max. memory is 11.5 GB. * Witness Printer took 64.72 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] int s ; [L32] int UNLOADED ; [L33] int NP ; [L34] int DC ; [L35] int SKIP1 ; [L36] int SKIP2 ; [L37] int MPR1 ; [L38] int MPR3 ; [L39] int IPC ; [L40] int pended ; [L41] int compFptr ; [L42] int compRegistered ; [L43] int lowerDriverReturn ; [L44] int setEventCalled ; [L45] int customIrp ; [L46] int routine ; [L47] int myStatus ; [L48] int pirp ; [L49] int Executive ; [L50] int Suspended ; [L51] int KernelMode ; [L52] int DeviceUsageTypePaging ; VAL [\old(compFptr)=276, \old(compRegistered)=265, \old(customIrp)=268, \old(DC)=261, \old(DeviceUsageTypePaging)=273, \old(Executive)=266, \old(IPC)=262, \old(KernelMode)=281, \old(lowerDriverReturn)=279, \old(MPR1)=275, \old(MPR3)=271, \old(myStatus)=278, \old(NP)=267, \old(pended)=280, \old(pirp)=272, \old(routine)=269, \old(s)=263, \old(setEventCalled)=274, \old(SKIP1)=270, \old(SKIP2)=264, \old(Suspended)=277, \old(UNLOADED)=260, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1717] int pirp__IoStatus__Status ; [L1718] int d = __VERIFIER_nondet_int() ; [L1719] int status = __VERIFIER_nondet_int() ; [L1720] int irp = __VERIFIER_nondet_int() ; [L1721] int we_should_unload = __VERIFIER_nondet_int() ; [L1722] int irp_choice = __VERIFIER_nondet_int() ; [L1723] int devobj = __VERIFIER_nondet_int() ; [L1724] int __cil_tmp9 ; [L1729] s = 0 [L1730] UNLOADED = 0 [L1731] NP = 0 [L1732] DC = 0 [L1733] SKIP1 = 0 [L1734] SKIP2 = 0 [L1735] MPR1 = 0 [L1736] MPR3 = 0 [L1737] IPC = 0 [L1738] pended = 0 [L1739] compFptr = 0 [L1740] compRegistered = 0 [L1741] lowerDriverReturn = 0 [L1742] setEventCalled = 0 [L1743] customIrp = 0 [L1744] routine = 0 [L1745] myStatus = 0 [L1746] pirp = 0 [L1747] Executive = 0 [L1748] Suspended = 5 [L1749] KernelMode = 0 [L1750] DeviceUsageTypePaging = 1 [L1753] pirp = irp VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=0, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=0, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1754] CALL _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=1, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=5, UNLOADED=0] [L66] UNLOADED = 0 [L67] NP = 1 [L68] DC = 2 [L69] SKIP1 = 3 [L70] SKIP2 = 4 [L71] MPR1 = 5 [L72] MPR3 = 6 [L73] IPC = 7 [L74] s = UNLOADED [L75] pended = 0 [L76] compFptr = 0 [L77] compRegistered = 0 [L78] lowerDriverReturn = 0 [L79] setEventCalled = 0 [L80] RET customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1754] _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1756] COND TRUE status >= 0 [L1757] s = NP [L1758] customIrp = 0 [L1759] setEventCalled = customIrp [L1760] lowerDriverReturn = setEventCalled [L1761] compRegistered = lowerDriverReturn [L1762] compFptr = compRegistered [L1763] pended = compFptr [L1764] pirp__IoStatus__Status = 0 [L1765] myStatus = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1766] COND TRUE irp_choice == 0 [L1767] pirp__IoStatus__Status = -1073741637 [L1768] myStatus = -1073741637 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1771] CALL stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1706] s = NP [L1707] customIrp = 0 [L1708] setEventCalled = customIrp [L1709] lowerDriverReturn = setEventCalled [L1710] compRegistered = lowerDriverReturn [L1711] compFptr = compRegistered [L1712] RET pended = compFptr VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1771] stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1774] COND FALSE !(status < 0) [L1778] int tmp_ndt_1; [L1779] tmp_ndt_1 = __VERIFIER_nondet_int() [L1780] COND TRUE tmp_ndt_1 == 2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1797] CALL, EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L312] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L313] int status ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L316] COND FALSE !(deviceExtension__Active == 2) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L319] COND FALSE !(deviceExtension__Active == 3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L322] COND FALSE !(deviceExtension__Active == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L325] COND TRUE deviceExtension__Active == 7 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L347] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1590] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1591] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1592] int irpSp__Control ; [L1593] int tmp ; [L1594] int tmp___0 ; [L1595] int __cil_tmp8 ; [L1596] int __cil_tmp9 ; [L1597] int __cil_tmp10 ; [L1598] int __cil_tmp11 ; [L1599] int __cil_tmp12 ; [L1603] __cil_tmp8 = 56 [L1604] __cil_tmp9 = 16384 [L1605] __cil_tmp10 = 131072 [L1606] __cil_tmp11 = 147456 [L1607] __cil_tmp12 = 147512 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1608] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND FALSE !(s != NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1614] COND FALSE !(compRegistered != 0) [L1619] compRegistered = 1 [L1620] routine = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1624] irpSp__Control = 224 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1899] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1900] int returnVal2 ; [L1901] int compRetStatus ; [L1902] int lcontext = __VERIFIER_nondet_int() ; [L1903] unsigned long __cil_tmp8 ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1906] COND TRUE \read(compRegistered) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE routine == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1909] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1568] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1569] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1572] COND TRUE \read(Irp__PendingReturned) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1573] COND TRUE pended == 0 [L1574] pended = 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1581] COND FALSE !(myStatus >= 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1586] RET return (myStatus); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=-1073741637, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1909] EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, HPCdrCompletion(DeviceObject, Irp, lcontext)=-1073741637, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1909] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1919] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1920] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1927] COND FALSE !(\read(Irp__PendingReturned)) [L1930] int tmp_ndt_4; [L1931] tmp_ndt_4 = __VERIFIER_nondet_int() [L1932] COND TRUE tmp_ndt_4 == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1943] returnVal2 = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1957] COND TRUE s == NP [L1958] s = IPC [L1959] lowerDriverReturn = returnVal2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1980] RET return (returnVal2); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1625] EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IofCallDriver(deviceExtension__TargetDeviceObject, Irp)=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1627] RET return (tmp); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L347] EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioHPCdrDeviceControl(DeviceObject, Irp)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L347] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L362] RET return (status); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1797] EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioDeviceControl(devobj, pirp)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1797] status = CdAudioDeviceControl(devobj, pirp) [L1818] COND FALSE !(\read(we_should_unload)) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1824] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1825] COND FALSE !(s == NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1832] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1833] COND FALSE !(s == MPR3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1840] COND TRUE s != UNLOADED VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1841] COND TRUE status != -1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1842] COND TRUE s != SKIP2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1843] COND FALSE !(s != IPC) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1856] COND FALSE !(pended != 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1868] COND TRUE status != 259 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1870] CALL errorFn() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L58] __VERIFIER_error() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 537 locations, 1 error locations. UNSAFE Result, 21.6s OverallTime, 67 OverallIterations, 2 TraceHistogramMax, 13.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39013 SDtfs, 17103 SDslu, 165129 SDs, 0 SdLazy, 13871 SolverSat, 2927 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 629 GetRequests, 149 SyntacticMatches, 6 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1047occurred in iteration=65, 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: 2.6s AutomataMinimizationTime, 66 MinimizatonAttempts, 1876 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 3962 NumberOfCodeBlocks, 3962 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 3823 ConstructedInterpolants, 0 QuantifiedInterpolants, 493771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 66 InterpolantComputations, 66 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...