./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/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_fdcfa24a-2694-46a7-a0e3-23b52101868e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/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-1dbac8b [2018-10-26 21:55:10,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:55:10,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:55:10,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:55:10,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:55:10,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:55:10,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:55:10,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:55:10,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:55:10,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:55:10,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:55:10,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:55:10,587 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:55:10,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:55:10,593 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:55:10,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:55:10,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:55:10,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:55:10,602 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:55:10,603 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:55:10,604 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:55:10,608 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:55:10,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:55:10,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:55:10,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:55:10,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:55:10,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:55:10,611 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:55:10,612 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:55:10,616 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:55:10,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:55:10,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:55:10,618 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:55:10,618 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:55:10,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:55:10,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:55:10,619 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 21:55:10,637 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:55:10,637 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:55:10,637 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:55:10,638 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:55:10,638 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:55:10,638 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:55:10,638 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 21:55:10,638 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:55:10,638 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 21:55:10,638 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 21:55:10,639 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:55:10,639 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:55:10,639 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:55:10,639 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:55:10,639 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:55:10,640 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:55:10,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:55:10,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:55:10,640 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:55:10,642 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:55:10,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:55:10,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:55:10,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:55:10,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:55:10,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:55:10,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:55:10,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:55:10,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:55:10,643 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:55:10,643 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:55:10,643 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 21:55:10,644 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:55:10,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:55:10,644 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:55:10,644 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_fdcfa24a-2694-46a7-a0e3-23b52101868e/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-10-26 21:55:10,672 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:55:10,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:55:10,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:55:10,686 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:55:10,686 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:55:10,686 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-10-26 21:55:10,735 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/bin-2019/utaipan/data/3a5342ead/1ba39957276f41efa298328646228223/FLAGa8be6b174 [2018-10-26 21:55:11,155 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:55:11,156 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-10-26 21:55:11,171 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/bin-2019/utaipan/data/3a5342ead/1ba39957276f41efa298328646228223/FLAGa8be6b174 [2018-10-26 21:55:11,185 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/bin-2019/utaipan/data/3a5342ead/1ba39957276f41efa298328646228223 [2018-10-26 21:55:11,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:55:11,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:55:11,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:55:11,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:55:11,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:55:11,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:55:11" (1/1) ... [2018-10-26 21:55:11,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77473120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11, skipping insertion in model container [2018-10-26 21:55:11,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:55:11" (1/1) ... [2018-10-26 21:55:11,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:55:11,273 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:55:11,650 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:55:11,654 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:55:11,773 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:55:11,796 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:55:11,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11 WrapperNode [2018-10-26 21:55:11,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:55:11,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:55:11,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:55:11,798 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:55:11,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11" (1/1) ... [2018-10-26 21:55:11,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11" (1/1) ... [2018-10-26 21:55:11,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:55:11,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:55:11,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:55:11,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:55:11,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11" (1/1) ... [2018-10-26 21:55:11,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11" (1/1) ... [2018-10-26 21:55:11,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11" (1/1) ... [2018-10-26 21:55:11,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11" (1/1) ... [2018-10-26 21:55:12,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11" (1/1) ... [2018-10-26 21:55:12,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11" (1/1) ... [2018-10-26 21:55:12,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11" (1/1) ... [2018-10-26 21:55:12,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:55:12,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:55:12,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:55:12,048 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:55:12,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/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-10-26 21:55:12,122 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-10-26 21:55:12,122 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-10-26 21:55:12,122 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-10-26 21:55:12,123 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-10-26 21:55:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-10-26 21:55:12,123 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-10-26 21:55:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-10-26 21:55:12,123 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-10-26 21:55:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:55:12,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:55:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-10-26 21:55:12,124 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-10-26 21:55:12,124 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-10-26 21:55:12,124 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-10-26 21:55:12,124 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-10-26 21:55:12,124 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-10-26 21:55:12,124 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-10-26 21:55:12,126 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-10-26 21:55:12,126 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-10-26 21:55:12,127 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-10-26 21:55:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-10-26 21:55:12,127 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-10-26 21:55:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-10-26 21:55:12,127 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-10-26 21:55:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-10-26 21:55:12,128 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-10-26 21:55:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-10-26 21:55:12,128 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-10-26 21:55:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-10-26 21:55:12,128 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-10-26 21:55:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-10-26 21:55:12,128 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-10-26 21:55:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-10-26 21:55:12,128 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-10-26 21:55:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-10-26 21:55:12,129 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-10-26 21:55:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-10-26 21:55:12,129 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-10-26 21:55:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-10-26 21:55:12,129 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-10-26 21:55:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-10-26 21:55:12,129 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-10-26 21:55:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-10-26 21:55:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-10-26 21:55:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:55:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:55:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-10-26 21:55:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-10-26 21:55:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-10-26 21:55:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-10-26 21:55:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:55:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:55:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-10-26 21:55:12,131 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-10-26 21:55:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-10-26 21:55:12,131 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-10-26 21:55:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-10-26 21:55:12,131 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-10-26 21:55:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-10-26 21:55:12,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-10-26 21:55:12,740 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 21:55:12,740 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 21:55:13,006 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 21:55:13,006 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 21:55:13,128 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 21:55:13,128 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 21:55:13,605 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 21:55:13,605 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 21:55:13,794 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 21:55:13,794 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 21:55:14,086 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 21:55:14,086 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 21:55:14,148 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 21:55:14,148 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 21:55:14,180 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 21:55:14,180 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 21:55:14,481 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 21:55:14,481 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 21:55:14,506 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:55:14,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:55:14 BoogieIcfgContainer [2018-10-26 21:55:14,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:55:14,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:55:14,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:55:14,511 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:55:14,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:55:11" (1/3) ... [2018-10-26 21:55:14,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b158676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:55:14, skipping insertion in model container [2018-10-26 21:55:14,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:55:11" (2/3) ... [2018-10-26 21:55:14,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b158676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:55:14, skipping insertion in model container [2018-10-26 21:55:14,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:55:14" (3/3) ... [2018-10-26 21:55:14,515 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-10-26 21:55:14,525 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:55:14,533 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:55:14,548 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:55:14,581 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:55:14,581 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:55:14,581 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:55:14,581 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:55:14,582 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:55:14,582 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:55:14,582 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:55:14,583 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:55:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states. [2018-10-26 21:55:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 21:55:14,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:14,618 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-10-26 21:55:14,621 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:14,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:14,626 INFO L82 PathProgramCache]: Analyzing trace with hash -448213016, now seen corresponding path program 1 times [2018-10-26 21:55:14,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:14,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:14,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:14,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:14,677 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:14,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:14,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:14,929 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:14,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:14,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:14,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:14,950 INFO L87 Difference]: Start difference. First operand 518 states. Second operand 3 states. [2018-10-26 21:55:15,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:15,327 INFO L93 Difference]: Finished difference Result 893 states and 1383 transitions. [2018-10-26 21:55:15,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:15,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-26 21:55:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:15,349 INFO L225 Difference]: With dead ends: 893 [2018-10-26 21:55:15,349 INFO L226 Difference]: Without dead ends: 510 [2018-10-26 21:55:15,356 INFO L605 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-10-26 21:55:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-10-26 21:55:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2018-10-26 21:55:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-10-26 21:55:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 741 transitions. [2018-10-26 21:55:15,438 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 741 transitions. Word has length 20 [2018-10-26 21:55:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:15,438 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 741 transitions. [2018-10-26 21:55:15,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 741 transitions. [2018-10-26 21:55:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:55:15,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:15,440 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-10-26 21:55:15,440 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:15,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1549764761, now seen corresponding path program 1 times [2018-10-26 21:55:15,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:15,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:15,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:15,442 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:15,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:15,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:15,629 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:15,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:15,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:15,631 INFO L87 Difference]: Start difference. First operand 510 states and 741 transitions. Second operand 3 states. [2018-10-26 21:55:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:16,079 INFO L93 Difference]: Finished difference Result 798 states and 1129 transitions. [2018-10-26 21:55:16,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:16,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 21:55:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:16,090 INFO L225 Difference]: With dead ends: 798 [2018-10-26 21:55:16,093 INFO L226 Difference]: Without dead ends: 676 [2018-10-26 21:55:16,095 INFO L605 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-10-26 21:55:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-10-26 21:55:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 656. [2018-10-26 21:55:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-10-26 21:55:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 936 transitions. [2018-10-26 21:55:16,148 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 936 transitions. Word has length 25 [2018-10-26 21:55:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:16,149 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 936 transitions. [2018-10-26 21:55:16,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 936 transitions. [2018-10-26 21:55:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:55:16,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:16,151 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-10-26 21:55:16,151 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:16,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:16,151 INFO L82 PathProgramCache]: Analyzing trace with hash 621330444, now seen corresponding path program 1 times [2018-10-26 21:55:16,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:16,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:16,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:16,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:16,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:16,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:16,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:16,285 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:16,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:16,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:16,286 INFO L87 Difference]: Start difference. First operand 656 states and 936 transitions. Second operand 3 states. [2018-10-26 21:55:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:16,352 INFO L93 Difference]: Finished difference Result 1005 states and 1391 transitions. [2018-10-26 21:55:16,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:16,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 21:55:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:16,358 INFO L225 Difference]: With dead ends: 1005 [2018-10-26 21:55:16,359 INFO L226 Difference]: Without dead ends: 827 [2018-10-26 21:55:16,360 INFO L605 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-10-26 21:55:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-10-26 21:55:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 773. [2018-10-26 21:55:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-10-26 21:55:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1098 transitions. [2018-10-26 21:55:16,404 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1098 transitions. Word has length 30 [2018-10-26 21:55:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:16,405 INFO L481 AbstractCegarLoop]: Abstraction has 773 states and 1098 transitions. [2018-10-26 21:55:16,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1098 transitions. [2018-10-26 21:55:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 21:55:16,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:16,407 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-10-26 21:55:16,407 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:16,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:16,408 INFO L82 PathProgramCache]: Analyzing trace with hash 472217655, now seen corresponding path program 1 times [2018-10-26 21:55:16,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:16,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:16,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:16,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:16,409 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:16,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:16,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:16,518 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:16,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:16,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:16,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:16,519 INFO L87 Difference]: Start difference. First operand 773 states and 1098 transitions. Second operand 3 states. [2018-10-26 21:55:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:17,662 INFO L93 Difference]: Finished difference Result 1442 states and 2113 transitions. [2018-10-26 21:55:17,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:17,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 21:55:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:17,673 INFO L225 Difference]: With dead ends: 1442 [2018-10-26 21:55:17,673 INFO L226 Difference]: Without dead ends: 1172 [2018-10-26 21:55:17,675 INFO L605 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-10-26 21:55:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-10-26 21:55:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 909. [2018-10-26 21:55:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2018-10-26 21:55:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1334 transitions. [2018-10-26 21:55:17,774 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1334 transitions. Word has length 31 [2018-10-26 21:55:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:17,774 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 1334 transitions. [2018-10-26 21:55:17,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1334 transitions. [2018-10-26 21:55:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 21:55:17,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:17,783 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-10-26 21:55:17,784 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:17,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1515451823, now seen corresponding path program 1 times [2018-10-26 21:55:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:17,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:17,786 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:17,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:17,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:17,894 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:17,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:17,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:17,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:17,895 INFO L87 Difference]: Start difference. First operand 909 states and 1334 transitions. Second operand 5 states. [2018-10-26 21:55:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:20,567 INFO L93 Difference]: Finished difference Result 1582 states and 2329 transitions. [2018-10-26 21:55:20,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:55:20,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-10-26 21:55:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:20,574 INFO L225 Difference]: With dead ends: 1582 [2018-10-26 21:55:20,574 INFO L226 Difference]: Without dead ends: 998 [2018-10-26 21:55:20,577 INFO L605 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-10-26 21:55:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-10-26 21:55:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 897. [2018-10-26 21:55:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-10-26 21:55:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1310 transitions. [2018-10-26 21:55:20,633 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1310 transitions. Word has length 32 [2018-10-26 21:55:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:20,633 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 1310 transitions. [2018-10-26 21:55:20,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1310 transitions. [2018-10-26 21:55:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 21:55:20,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:20,635 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-10-26 21:55:20,636 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:20,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:20,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2146588537, now seen corresponding path program 1 times [2018-10-26 21:55:20,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:20,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:20,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:20,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:20,637 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:20,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:20,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:20,802 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:20,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:20,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:20,803 INFO L87 Difference]: Start difference. First operand 897 states and 1310 transitions. Second operand 3 states. [2018-10-26 21:55:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:21,250 INFO L93 Difference]: Finished difference Result 900 states and 1312 transitions. [2018-10-26 21:55:21,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:21,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-26 21:55:21,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:21,258 INFO L225 Difference]: With dead ends: 900 [2018-10-26 21:55:21,258 INFO L226 Difference]: Without dead ends: 896 [2018-10-26 21:55:21,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-10-26 21:55:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2018-10-26 21:55:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-26 21:55:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1307 transitions. [2018-10-26 21:55:21,310 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1307 transitions. Word has length 36 [2018-10-26 21:55:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:21,310 INFO L481 AbstractCegarLoop]: Abstraction has 896 states and 1307 transitions. [2018-10-26 21:55:21,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1307 transitions. [2018-10-26 21:55:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:55:21,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:21,313 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-10-26 21:55:21,313 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:21,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:21,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1811578744, now seen corresponding path program 1 times [2018-10-26 21:55:21,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:21,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:21,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:21,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:21,314 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:21,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-10-26 21:55:21,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:21,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:21,422 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:21,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:21,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:21,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:21,423 INFO L87 Difference]: Start difference. First operand 896 states and 1307 transitions. Second operand 3 states. [2018-10-26 21:55:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:21,585 INFO L93 Difference]: Finished difference Result 1292 states and 1836 transitions. [2018-10-26 21:55:21,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:21,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-26 21:55:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:21,591 INFO L225 Difference]: With dead ends: 1292 [2018-10-26 21:55:21,593 INFO L226 Difference]: Without dead ends: 1027 [2018-10-26 21:55:21,595 INFO L605 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-10-26 21:55:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-10-26 21:55:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 882. [2018-10-26 21:55:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-10-26 21:55:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1249 transitions. [2018-10-26 21:55:21,639 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1249 transitions. Word has length 39 [2018-10-26 21:55:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:21,640 INFO L481 AbstractCegarLoop]: Abstraction has 882 states and 1249 transitions. [2018-10-26 21:55:21,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1249 transitions. [2018-10-26 21:55:21,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:55:21,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:21,643 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-10-26 21:55:21,643 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:21,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:21,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1349629560, now seen corresponding path program 1 times [2018-10-26 21:55:21,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:21,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:21,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:21,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:21,646 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:21,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:21,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:21,791 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:21,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:21,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:21,791 INFO L87 Difference]: Start difference. First operand 882 states and 1249 transitions. Second operand 3 states. [2018-10-26 21:55:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:22,057 INFO L93 Difference]: Finished difference Result 984 states and 1377 transitions. [2018-10-26 21:55:22,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:22,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-26 21:55:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:22,062 INFO L225 Difference]: With dead ends: 984 [2018-10-26 21:55:22,063 INFO L226 Difference]: Without dead ends: 964 [2018-10-26 21:55:22,064 INFO L605 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-10-26 21:55:22,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-10-26 21:55:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 908. [2018-10-26 21:55:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-10-26 21:55:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1284 transitions. [2018-10-26 21:55:22,109 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1284 transitions. Word has length 40 [2018-10-26 21:55:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:22,109 INFO L481 AbstractCegarLoop]: Abstraction has 908 states and 1284 transitions. [2018-10-26 21:55:22,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1284 transitions. [2018-10-26 21:55:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-26 21:55:22,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:22,112 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-10-26 21:55:22,112 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:22,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:22,114 INFO L82 PathProgramCache]: Analyzing trace with hash 291360619, now seen corresponding path program 1 times [2018-10-26 21:55:22,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:22,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:22,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:22,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:22,115 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:22,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:22,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:22,206 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:22,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:22,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:22,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:22,207 INFO L87 Difference]: Start difference. First operand 908 states and 1284 transitions. Second operand 3 states. [2018-10-26 21:55:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:22,359 INFO L93 Difference]: Finished difference Result 1187 states and 1663 transitions. [2018-10-26 21:55:22,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:22,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-26 21:55:22,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:22,365 INFO L225 Difference]: With dead ends: 1187 [2018-10-26 21:55:22,365 INFO L226 Difference]: Without dead ends: 941 [2018-10-26 21:55:22,367 INFO L605 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-10-26 21:55:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2018-10-26 21:55:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 908. [2018-10-26 21:55:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-10-26 21:55:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1283 transitions. [2018-10-26 21:55:22,419 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1283 transitions. Word has length 46 [2018-10-26 21:55:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:22,420 INFO L481 AbstractCegarLoop]: Abstraction has 908 states and 1283 transitions. [2018-10-26 21:55:22,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1283 transitions. [2018-10-26 21:55:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 21:55:22,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:22,424 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-10-26 21:55:22,424 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:22,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:22,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1783887188, now seen corresponding path program 1 times [2018-10-26 21:55:22,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:22,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:22,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:22,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:22,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:55:22,498 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:22,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:55:22,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:55:22,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:55:22,499 INFO L87 Difference]: Start difference. First operand 908 states and 1283 transitions. Second operand 4 states. [2018-10-26 21:55:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:23,036 INFO L93 Difference]: Finished difference Result 1030 states and 1429 transitions. [2018-10-26 21:55:23,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:55:23,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-10-26 21:55:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:23,040 INFO L225 Difference]: With dead ends: 1030 [2018-10-26 21:55:23,040 INFO L226 Difference]: Without dead ends: 797 [2018-10-26 21:55:23,041 INFO L605 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-10-26 21:55:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-10-26 21:55:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 763. [2018-10-26 21:55:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-10-26 21:55:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1072 transitions. [2018-10-26 21:55:23,079 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1072 transitions. Word has length 47 [2018-10-26 21:55:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:23,079 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 1072 transitions. [2018-10-26 21:55:23,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:55:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1072 transitions. [2018-10-26 21:55:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 21:55:23,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:23,082 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-10-26 21:55:23,083 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:23,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash -992605317, now seen corresponding path program 1 times [2018-10-26 21:55:23,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:23,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:23,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:23,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:23,084 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:23,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:23,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:23,166 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:23,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:23,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:23,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:23,167 INFO L87 Difference]: Start difference. First operand 763 states and 1072 transitions. Second operand 3 states. [2018-10-26 21:55:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:23,266 INFO L93 Difference]: Finished difference Result 883 states and 1220 transitions. [2018-10-26 21:55:23,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:23,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-26 21:55:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:23,270 INFO L225 Difference]: With dead ends: 883 [2018-10-26 21:55:23,270 INFO L226 Difference]: Without dead ends: 787 [2018-10-26 21:55:23,271 INFO L605 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-10-26 21:55:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-10-26 21:55:23,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 762. [2018-10-26 21:55:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-10-26 21:55:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1067 transitions. [2018-10-26 21:55:23,306 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1067 transitions. Word has length 47 [2018-10-26 21:55:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:23,306 INFO L481 AbstractCegarLoop]: Abstraction has 762 states and 1067 transitions. [2018-10-26 21:55:23,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1067 transitions. [2018-10-26 21:55:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 21:55:23,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:23,308 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-10-26 21:55:23,308 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:23,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:23,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1733809897, now seen corresponding path program 1 times [2018-10-26 21:55:23,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:23,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:23,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:23,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:23,311 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:23,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:23,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:23,394 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:23,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:23,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:23,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:23,395 INFO L87 Difference]: Start difference. First operand 762 states and 1067 transitions. Second operand 3 states. [2018-10-26 21:55:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:23,948 INFO L93 Difference]: Finished difference Result 963 states and 1332 transitions. [2018-10-26 21:55:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:23,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-10-26 21:55:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:23,954 INFO L225 Difference]: With dead ends: 963 [2018-10-26 21:55:23,954 INFO L226 Difference]: Without dead ends: 949 [2018-10-26 21:55:23,955 INFO L605 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-10-26 21:55:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-10-26 21:55:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 841. [2018-10-26 21:55:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-10-26 21:55:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1159 transitions. [2018-10-26 21:55:23,999 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1159 transitions. Word has length 48 [2018-10-26 21:55:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:23,999 INFO L481 AbstractCegarLoop]: Abstraction has 841 states and 1159 transitions. [2018-10-26 21:55:23,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1159 transitions. [2018-10-26 21:55:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 21:55:24,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:24,003 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-10-26 21:55:24,003 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:24,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1764634278, now seen corresponding path program 1 times [2018-10-26 21:55:24,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:24,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:24,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:24,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:24,007 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:24,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:24,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 21:55:24,380 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:24,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:55:24,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:55:24,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:55:24,381 INFO L87 Difference]: Start difference. First operand 841 states and 1159 transitions. Second operand 8 states. [2018-10-26 21:55:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:25,207 INFO L93 Difference]: Finished difference Result 867 states and 1193 transitions. [2018-10-26 21:55:25,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:55:25,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-10-26 21:55:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:25,210 INFO L225 Difference]: With dead ends: 867 [2018-10-26 21:55:25,211 INFO L226 Difference]: Without dead ends: 863 [2018-10-26 21:55:25,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:55:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-10-26 21:55:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 860. [2018-10-26 21:55:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-10-26 21:55:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1186 transitions. [2018-10-26 21:55:25,256 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1186 transitions. Word has length 49 [2018-10-26 21:55:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:25,256 INFO L481 AbstractCegarLoop]: Abstraction has 860 states and 1186 transitions. [2018-10-26 21:55:25,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:55:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1186 transitions. [2018-10-26 21:55:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 21:55:25,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:25,260 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-10-26 21:55:25,260 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:25,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:25,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1764911108, now seen corresponding path program 1 times [2018-10-26 21:55:25,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:25,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:25,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:25,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:25,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:25,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:25,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 21:55:25,556 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:25,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:55:25,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:55:25,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:55:25,557 INFO L87 Difference]: Start difference. First operand 860 states and 1186 transitions. Second operand 8 states. [2018-10-26 21:55:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:25,637 INFO L93 Difference]: Finished difference Result 902 states and 1238 transitions. [2018-10-26 21:55:25,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:55:25,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-10-26 21:55:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:25,641 INFO L225 Difference]: With dead ends: 902 [2018-10-26 21:55:25,641 INFO L226 Difference]: Without dead ends: 881 [2018-10-26 21:55:25,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:55:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-10-26 21:55:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 880. [2018-10-26 21:55:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-10-26 21:55:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1210 transitions. [2018-10-26 21:55:25,689 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1210 transitions. Word has length 49 [2018-10-26 21:55:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:25,689 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 1210 transitions. [2018-10-26 21:55:25,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:55:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1210 transitions. [2018-10-26 21:55:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 21:55:25,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:25,692 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-10-26 21:55:25,692 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:25,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:25,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1085825170, now seen corresponding path program 1 times [2018-10-26 21:55:25,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:25,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:25,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:25,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:25,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:25,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:25,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:55:25,846 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:25,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:55:25,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:55:25,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:55:25,847 INFO L87 Difference]: Start difference. First operand 880 states and 1210 transitions. Second operand 4 states. [2018-10-26 21:55:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:25,972 INFO L93 Difference]: Finished difference Result 905 states and 1235 transitions. [2018-10-26 21:55:25,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:55:25,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-10-26 21:55:25,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:25,978 INFO L225 Difference]: With dead ends: 905 [2018-10-26 21:55:25,978 INFO L226 Difference]: Without dead ends: 883 [2018-10-26 21:55:25,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-10-26 21:55:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2018-10-26 21:55:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-10-26 21:55:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1209 transitions. [2018-10-26 21:55:26,023 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1209 transitions. Word has length 50 [2018-10-26 21:55:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:26,024 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 1209 transitions. [2018-10-26 21:55:26,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:55:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1209 transitions. [2018-10-26 21:55:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 21:55:26,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:26,026 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-10-26 21:55:26,026 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:26,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash -908319536, now seen corresponding path program 1 times [2018-10-26 21:55:26,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:26,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:26,028 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:26,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:26,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 21:55:26,312 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:26,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:55:26,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:55:26,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:55:26,312 INFO L87 Difference]: Start difference. First operand 880 states and 1209 transitions. Second operand 7 states. [2018-10-26 21:55:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:27,767 INFO L93 Difference]: Finished difference Result 1092 states and 1543 transitions. [2018-10-26 21:55:27,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:55:27,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-10-26 21:55:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:27,771 INFO L225 Difference]: With dead ends: 1092 [2018-10-26 21:55:27,771 INFO L226 Difference]: Without dead ends: 1001 [2018-10-26 21:55:27,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:55:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2018-10-26 21:55:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 859. [2018-10-26 21:55:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2018-10-26 21:55:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1172 transitions. [2018-10-26 21:55:27,830 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1172 transitions. Word has length 50 [2018-10-26 21:55:27,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:27,830 INFO L481 AbstractCegarLoop]: Abstraction has 859 states and 1172 transitions. [2018-10-26 21:55:27,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:55:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1172 transitions. [2018-10-26 21:55:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 21:55:27,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:27,835 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-10-26 21:55:27,835 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:27,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:27,836 INFO L82 PathProgramCache]: Analyzing trace with hash -761626734, now seen corresponding path program 1 times [2018-10-26 21:55:27,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:27,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:27,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:27,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:27,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:27,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:27,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:27,931 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:27,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:27,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:27,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:27,932 INFO L87 Difference]: Start difference. First operand 859 states and 1172 transitions. Second operand 3 states. [2018-10-26 21:55:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:28,294 INFO L93 Difference]: Finished difference Result 1043 states and 1413 transitions. [2018-10-26 21:55:28,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:28,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-26 21:55:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:28,298 INFO L225 Difference]: With dead ends: 1043 [2018-10-26 21:55:28,299 INFO L226 Difference]: Without dead ends: 1003 [2018-10-26 21:55:28,299 INFO L605 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-10-26 21:55:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-10-26 21:55:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 893. [2018-10-26 21:55:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-10-26 21:55:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1204 transitions. [2018-10-26 21:55:28,360 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1204 transitions. Word has length 50 [2018-10-26 21:55:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:28,360 INFO L481 AbstractCegarLoop]: Abstraction has 893 states and 1204 transitions. [2018-10-26 21:55:28,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1204 transitions. [2018-10-26 21:55:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 21:55:28,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:28,363 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-10-26 21:55:28,363 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:28,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:28,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1782043445, now seen corresponding path program 1 times [2018-10-26 21:55:28,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:28,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:28,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:28,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:28,364 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:28,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:28,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-26 21:55:28,568 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:28,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:55:28,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:55:28,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:55:28,569 INFO L87 Difference]: Start difference. First operand 893 states and 1204 transitions. Second operand 9 states. [2018-10-26 21:55:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:30,197 INFO L93 Difference]: Finished difference Result 1215 states and 1676 transitions. [2018-10-26 21:55:30,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 21:55:30,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-10-26 21:55:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:30,202 INFO L225 Difference]: With dead ends: 1215 [2018-10-26 21:55:30,203 INFO L226 Difference]: Without dead ends: 1146 [2018-10-26 21:55:30,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-10-26 21:55:30,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2018-10-26 21:55:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 906. [2018-10-26 21:55:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-10-26 21:55:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1229 transitions. [2018-10-26 21:55:30,322 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1229 transitions. Word has length 50 [2018-10-26 21:55:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:30,322 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1229 transitions. [2018-10-26 21:55:30,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:55:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1229 transitions. [2018-10-26 21:55:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 21:55:30,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:30,327 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-10-26 21:55:30,327 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:30,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash 417807011, now seen corresponding path program 1 times [2018-10-26 21:55:30,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:30,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:30,328 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:30,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:30,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:30,419 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:30,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:30,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:30,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:30,419 INFO L87 Difference]: Start difference. First operand 906 states and 1229 transitions. Second operand 3 states. [2018-10-26 21:55:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:31,049 INFO L93 Difference]: Finished difference Result 934 states and 1261 transitions. [2018-10-26 21:55:31,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:31,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-26 21:55:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:31,054 INFO L225 Difference]: With dead ends: 934 [2018-10-26 21:55:31,054 INFO L226 Difference]: Without dead ends: 929 [2018-10-26 21:55:31,055 INFO L605 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-10-26 21:55:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-10-26 21:55:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 923. [2018-10-26 21:55:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-26 21:55:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1250 transitions. [2018-10-26 21:55:31,119 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1250 transitions. Word has length 52 [2018-10-26 21:55:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:31,120 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1250 transitions. [2018-10-26 21:55:31,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1250 transitions. [2018-10-26 21:55:31,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-26 21:55:31,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:31,124 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-10-26 21:55:31,125 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:31,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1677129215, now seen corresponding path program 1 times [2018-10-26 21:55:31,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:31,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:31,126 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:31,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:31,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:31,202 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:31,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:31,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:31,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:31,203 INFO L87 Difference]: Start difference. First operand 923 states and 1250 transitions. Second operand 3 states. [2018-10-26 21:55:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:31,663 INFO L93 Difference]: Finished difference Result 1142 states and 1544 transitions. [2018-10-26 21:55:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:31,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-26 21:55:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:31,667 INFO L225 Difference]: With dead ends: 1142 [2018-10-26 21:55:31,667 INFO L226 Difference]: Without dead ends: 892 [2018-10-26 21:55:31,668 INFO L605 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-10-26 21:55:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2018-10-26 21:55:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2018-10-26 21:55:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-10-26 21:55:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1210 transitions. [2018-10-26 21:55:31,731 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1210 transitions. Word has length 54 [2018-10-26 21:55:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:31,731 INFO L481 AbstractCegarLoop]: Abstraction has 892 states and 1210 transitions. [2018-10-26 21:55:31,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1210 transitions. [2018-10-26 21:55:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 21:55:31,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:31,734 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-10-26 21:55:31,734 INFO L424 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:31,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:31,734 INFO L82 PathProgramCache]: Analyzing trace with hash 510703600, now seen corresponding path program 1 times [2018-10-26 21:55:31,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:31,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:31,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:31,736 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:31,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:31,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:31,999 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:31,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:32,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:32,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:32,000 INFO L87 Difference]: Start difference. First operand 892 states and 1210 transitions. Second operand 5 states. [2018-10-26 21:55:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:32,557 INFO L93 Difference]: Finished difference Result 904 states and 1220 transitions. [2018-10-26 21:55:32,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:55:32,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-10-26 21:55:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:32,561 INFO L225 Difference]: With dead ends: 904 [2018-10-26 21:55:32,561 INFO L226 Difference]: Without dead ends: 898 [2018-10-26 21:55:32,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:55:32,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-10-26 21:55:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 892. [2018-10-26 21:55:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-10-26 21:55:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1209 transitions. [2018-10-26 21:55:32,627 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1209 transitions. Word has length 53 [2018-10-26 21:55:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:32,628 INFO L481 AbstractCegarLoop]: Abstraction has 892 states and 1209 transitions. [2018-10-26 21:55:32,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1209 transitions. [2018-10-26 21:55:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 21:55:32,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:32,634 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-10-26 21:55:32,634 INFO L424 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:32,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1022255578, now seen corresponding path program 1 times [2018-10-26 21:55:32,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:32,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:32,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:32,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:32,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:32,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:32,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:32,781 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:32,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:32,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:32,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:32,781 INFO L87 Difference]: Start difference. First operand 892 states and 1209 transitions. Second operand 5 states. [2018-10-26 21:55:33,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:33,210 INFO L93 Difference]: Finished difference Result 907 states and 1224 transitions. [2018-10-26 21:55:33,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:55:33,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-10-26 21:55:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:33,215 INFO L225 Difference]: With dead ends: 907 [2018-10-26 21:55:33,215 INFO L226 Difference]: Without dead ends: 871 [2018-10-26 21:55:33,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:55:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-26 21:55:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 865. [2018-10-26 21:55:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-10-26 21:55:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1179 transitions. [2018-10-26 21:55:33,279 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1179 transitions. Word has length 52 [2018-10-26 21:55:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:33,279 INFO L481 AbstractCegarLoop]: Abstraction has 865 states and 1179 transitions. [2018-10-26 21:55:33,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1179 transitions. [2018-10-26 21:55:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-26 21:55:33,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:33,284 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-10-26 21:55:33,284 INFO L424 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:33,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:33,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1980078936, now seen corresponding path program 1 times [2018-10-26 21:55:33,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:33,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:33,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:33,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:33,286 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:33,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:33,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:33,476 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:33,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:33,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:33,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:33,477 INFO L87 Difference]: Start difference. First operand 865 states and 1179 transitions. Second operand 5 states. [2018-10-26 21:55:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:33,933 INFO L93 Difference]: Finished difference Result 875 states and 1187 transitions. [2018-10-26 21:55:33,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:55:33,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-10-26 21:55:33,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:33,936 INFO L225 Difference]: With dead ends: 875 [2018-10-26 21:55:33,936 INFO L226 Difference]: Without dead ends: 869 [2018-10-26 21:55:33,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:55:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-10-26 21:55:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 865. [2018-10-26 21:55:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-10-26 21:55:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1178 transitions. [2018-10-26 21:55:34,020 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1178 transitions. Word has length 54 [2018-10-26 21:55:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:34,021 INFO L481 AbstractCegarLoop]: Abstraction has 865 states and 1178 transitions. [2018-10-26 21:55:34,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1178 transitions. [2018-10-26 21:55:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-26 21:55:34,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:34,026 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-10-26 21:55:34,026 INFO L424 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:34,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash -940758887, now seen corresponding path program 1 times [2018-10-26 21:55:34,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:34,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:34,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:34,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:34,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:34,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:34,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-26 21:55:34,146 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:34,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:55:34,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:55:34,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:55:34,147 INFO L87 Difference]: Start difference. First operand 865 states and 1178 transitions. Second operand 9 states. [2018-10-26 21:55:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:34,274 INFO L93 Difference]: Finished difference Result 892 states and 1208 transitions. [2018-10-26 21:55:34,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:55:34,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-10-26 21:55:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:34,277 INFO L225 Difference]: With dead ends: 892 [2018-10-26 21:55:34,277 INFO L226 Difference]: Without dead ends: 856 [2018-10-26 21:55:34,278 INFO L605 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-10-26 21:55:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-26 21:55:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-10-26 21:55:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-26 21:55:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1154 transitions. [2018-10-26 21:55:34,338 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1154 transitions. Word has length 55 [2018-10-26 21:55:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:34,339 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1154 transitions. [2018-10-26 21:55:34,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:55:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1154 transitions. [2018-10-26 21:55:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-26 21:55:34,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:34,343 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-10-26 21:55:34,343 INFO L424 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:34,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:34,343 INFO L82 PathProgramCache]: Analyzing trace with hash -548453257, now seen corresponding path program 1 times [2018-10-26 21:55:34,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:34,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:34,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:34,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:34,344 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:34,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:34,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-26 21:55:34,549 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:34,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 21:55:34,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 21:55:34,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:55:34,549 INFO L87 Difference]: Start difference. First operand 856 states and 1154 transitions. Second operand 10 states. [2018-10-26 21:55:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:34,931 INFO L93 Difference]: Finished difference Result 872 states and 1171 transitions. [2018-10-26 21:55:34,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 21:55:34,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-10-26 21:55:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:34,934 INFO L225 Difference]: With dead ends: 872 [2018-10-26 21:55:34,935 INFO L226 Difference]: Without dead ends: 854 [2018-10-26 21:55:34,935 INFO L605 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-10-26 21:55:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-10-26 21:55:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2018-10-26 21:55:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-10-26 21:55:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1150 transitions. [2018-10-26 21:55:34,990 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1150 transitions. Word has length 55 [2018-10-26 21:55:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:34,990 INFO L481 AbstractCegarLoop]: Abstraction has 854 states and 1150 transitions. [2018-10-26 21:55:34,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 21:55:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1150 transitions. [2018-10-26 21:55:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 21:55:34,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:34,992 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-10-26 21:55:34,993 INFO L424 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:34,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:34,993 INFO L82 PathProgramCache]: Analyzing trace with hash -769794208, now seen corresponding path program 1 times [2018-10-26 21:55:34,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:34,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:34,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:34,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:34,994 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:35,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:35,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-26 21:55:35,544 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:35,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 21:55:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 21:55:35,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:55:35,544 INFO L87 Difference]: Start difference. First operand 854 states and 1150 transitions. Second operand 10 states. [2018-10-26 21:55:35,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:35,893 INFO L93 Difference]: Finished difference Result 867 states and 1164 transitions. [2018-10-26 21:55:35,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 21:55:35,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-10-26 21:55:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:35,897 INFO L225 Difference]: With dead ends: 867 [2018-10-26 21:55:35,897 INFO L226 Difference]: Without dead ends: 849 [2018-10-26 21:55:35,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:55:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-10-26 21:55:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2018-10-26 21:55:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-10-26 21:55:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1143 transitions. [2018-10-26 21:55:35,962 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1143 transitions. Word has length 56 [2018-10-26 21:55:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:35,962 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 1143 transitions. [2018-10-26 21:55:35,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 21:55:35,962 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1143 transitions. [2018-10-26 21:55:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-26 21:55:35,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:35,964 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-10-26 21:55:35,965 INFO L424 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:35,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1437911526, now seen corresponding path program 1 times [2018-10-26 21:55:35,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:35,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:35,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:35,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:35,966 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:36,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:36,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:36,105 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:36,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:36,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:36,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:36,105 INFO L87 Difference]: Start difference. First operand 849 states and 1143 transitions. Second operand 5 states. [2018-10-26 21:55:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:36,527 INFO L93 Difference]: Finished difference Result 1286 states and 1741 transitions. [2018-10-26 21:55:36,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:55:36,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-10-26 21:55:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:36,531 INFO L225 Difference]: With dead ends: 1286 [2018-10-26 21:55:36,531 INFO L226 Difference]: Without dead ends: 838 [2018-10-26 21:55:36,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-10-26 21:55:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-10-26 21:55:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-10-26 21:55:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-10-26 21:55:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1114 transitions. [2018-10-26 21:55:36,595 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1114 transitions. Word has length 73 [2018-10-26 21:55:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:36,595 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1114 transitions. [2018-10-26 21:55:36,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1114 transitions. [2018-10-26 21:55:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-26 21:55:36,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:36,600 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-10-26 21:55:36,600 INFO L424 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:36,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash 528467351, now seen corresponding path program 1 times [2018-10-26 21:55:36,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:36,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:36,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:36,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:36,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:36,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:36,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:36,740 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:36,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:36,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:36,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:36,740 INFO L87 Difference]: Start difference. First operand 838 states and 1114 transitions. Second operand 3 states. [2018-10-26 21:55:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:36,891 INFO L93 Difference]: Finished difference Result 970 states and 1274 transitions. [2018-10-26 21:55:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:36,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-10-26 21:55:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:36,895 INFO L225 Difference]: With dead ends: 970 [2018-10-26 21:55:36,895 INFO L226 Difference]: Without dead ends: 878 [2018-10-26 21:55:36,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-10-26 21:55:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 855. [2018-10-26 21:55:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2018-10-26 21:55:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1133 transitions. [2018-10-26 21:55:36,988 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1133 transitions. Word has length 74 [2018-10-26 21:55:36,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:36,989 INFO L481 AbstractCegarLoop]: Abstraction has 855 states and 1133 transitions. [2018-10-26 21:55:36,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1133 transitions. [2018-10-26 21:55:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-26 21:55:36,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:36,991 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-10-26 21:55:36,991 INFO L424 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:36,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:36,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1144916251, now seen corresponding path program 1 times [2018-10-26 21:55:36,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:36,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:36,995 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:37,509 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 4 [2018-10-26 21:55:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:37,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:37,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-26 21:55:37,543 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:37,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:55:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:55:37,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:55:37,543 INFO L87 Difference]: Start difference. First operand 855 states and 1133 transitions. Second operand 12 states. [2018-10-26 21:55:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:37,748 INFO L93 Difference]: Finished difference Result 881 states and 1161 transitions. [2018-10-26 21:55:37,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:55:37,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-10-26 21:55:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:37,752 INFO L225 Difference]: With dead ends: 881 [2018-10-26 21:55:37,752 INFO L226 Difference]: Without dead ends: 856 [2018-10-26 21:55:37,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-10-26 21:55:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-26 21:55:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 854. [2018-10-26 21:55:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-10-26 21:55:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1122 transitions. [2018-10-26 21:55:37,793 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1122 transitions. Word has length 59 [2018-10-26 21:55:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:37,793 INFO L481 AbstractCegarLoop]: Abstraction has 854 states and 1122 transitions. [2018-10-26 21:55:37,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:55:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1122 transitions. [2018-10-26 21:55:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-26 21:55:37,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:37,795 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-10-26 21:55:37,795 INFO L424 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:37,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:37,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1309677282, now seen corresponding path program 1 times [2018-10-26 21:55:37,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:37,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:37,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:38,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:38,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-26 21:55:38,082 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:38,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:55:38,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:55:38,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:55:38,082 INFO L87 Difference]: Start difference. First operand 854 states and 1122 transitions. Second operand 11 states. [2018-10-26 21:55:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:38,382 INFO L93 Difference]: Finished difference Result 871 states and 1140 transitions. [2018-10-26 21:55:38,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:55:38,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-10-26 21:55:38,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:38,386 INFO L225 Difference]: With dead ends: 871 [2018-10-26 21:55:38,386 INFO L226 Difference]: Without dead ends: 851 [2018-10-26 21:55:38,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:55:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-10-26 21:55:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2018-10-26 21:55:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-10-26 21:55:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1117 transitions. [2018-10-26 21:55:38,436 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1117 transitions. Word has length 58 [2018-10-26 21:55:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:38,437 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1117 transitions. [2018-10-26 21:55:38,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:55:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1117 transitions. [2018-10-26 21:55:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-26 21:55:38,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:38,438 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-10-26 21:55:38,438 INFO L424 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:38,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:38,439 INFO L82 PathProgramCache]: Analyzing trace with hash -719999499, now seen corresponding path program 1 times [2018-10-26 21:55:38,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:38,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:38,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:38,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:38,440 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:38,757 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-10-26 21:55:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:39,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:39,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-26 21:55:39,053 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:39,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 21:55:39,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 21:55:39,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:55:39,053 INFO L87 Difference]: Start difference. First operand 851 states and 1117 transitions. Second operand 10 states. [2018-10-26 21:55:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:39,269 INFO L93 Difference]: Finished difference Result 918 states and 1192 transitions. [2018-10-26 21:55:39,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:55:39,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-10-26 21:55:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:39,272 INFO L225 Difference]: With dead ends: 918 [2018-10-26 21:55:39,272 INFO L226 Difference]: Without dead ends: 809 [2018-10-26 21:55:39,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:55:39,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-10-26 21:55:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 806. [2018-10-26 21:55:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-26 21:55:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1036 transitions. [2018-10-26 21:55:39,323 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1036 transitions. Word has length 59 [2018-10-26 21:55:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:39,323 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1036 transitions. [2018-10-26 21:55:39,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 21:55:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1036 transitions. [2018-10-26 21:55:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 21:55:39,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:39,324 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-10-26 21:55:39,325 INFO L424 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:39,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:39,325 INFO L82 PathProgramCache]: Analyzing trace with hash -98888530, now seen corresponding path program 1 times [2018-10-26 21:55:39,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:39,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:39,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:39,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:39,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:39,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:39,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:55:39,482 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:39,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:55:39,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:55:39,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:55:39,483 INFO L87 Difference]: Start difference. First operand 806 states and 1036 transitions. Second operand 4 states. [2018-10-26 21:55:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:39,886 INFO L93 Difference]: Finished difference Result 946 states and 1224 transitions. [2018-10-26 21:55:39,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:55:39,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-10-26 21:55:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:39,889 INFO L225 Difference]: With dead ends: 946 [2018-10-26 21:55:39,889 INFO L226 Difference]: Without dead ends: 844 [2018-10-26 21:55:39,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-10-26 21:55:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 813. [2018-10-26 21:55:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-10-26 21:55:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1050 transitions. [2018-10-26 21:55:39,946 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1050 transitions. Word has length 60 [2018-10-26 21:55:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:39,947 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 1050 transitions. [2018-10-26 21:55:39,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:55:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1050 transitions. [2018-10-26 21:55:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 21:55:39,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:39,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] [2018-10-26 21:55:39,951 INFO L424 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:39,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:39,951 INFO L82 PathProgramCache]: Analyzing trace with hash 175871084, now seen corresponding path program 1 times [2018-10-26 21:55:39,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:39,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:39,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:39,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:39,952 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:40,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:40,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-26 21:55:40,313 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:40,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:55:40,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:55:40,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:55:40,314 INFO L87 Difference]: Start difference. First operand 813 states and 1050 transitions. Second operand 11 states. [2018-10-26 21:55:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:40,406 INFO L93 Difference]: Finished difference Result 880 states and 1139 transitions. [2018-10-26 21:55:40,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:55:40,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-10-26 21:55:40,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:40,410 INFO L225 Difference]: With dead ends: 880 [2018-10-26 21:55:40,410 INFO L226 Difference]: Without dead ends: 825 [2018-10-26 21:55:40,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:55:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2018-10-26 21:55:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 817. [2018-10-26 21:55:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-10-26 21:55:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1067 transitions. [2018-10-26 21:55:40,459 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1067 transitions. Word has length 60 [2018-10-26 21:55:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:40,459 INFO L481 AbstractCegarLoop]: Abstraction has 817 states and 1067 transitions. [2018-10-26 21:55:40,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:55:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1067 transitions. [2018-10-26 21:55:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 21:55:40,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:40,464 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-10-26 21:55:40,464 INFO L424 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:40,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2134007521, now seen corresponding path program 1 times [2018-10-26 21:55:40,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:40,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:40,467 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:40,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-10-26 21:55:40,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:40,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-26 21:55:40,633 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:40,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:55:40,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:55:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:55:40,634 INFO L87 Difference]: Start difference. First operand 817 states and 1067 transitions. Second operand 12 states. [2018-10-26 21:55:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:40,872 INFO L93 Difference]: Finished difference Result 841 states and 1092 transitions. [2018-10-26 21:55:40,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:55:40,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-10-26 21:55:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:40,875 INFO L225 Difference]: With dead ends: 841 [2018-10-26 21:55:40,875 INFO L226 Difference]: Without dead ends: 817 [2018-10-26 21:55:40,876 INFO L605 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-10-26 21:55:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-10-26 21:55:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 815. [2018-10-26 21:55:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-10-26 21:55:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1063 transitions. [2018-10-26 21:55:40,944 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1063 transitions. Word has length 66 [2018-10-26 21:55:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:40,945 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 1063 transitions. [2018-10-26 21:55:40,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:55:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1063 transitions. [2018-10-26 21:55:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 21:55:40,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:40,946 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-10-26 21:55:40,947 INFO L424 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:40,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:40,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1149940409, now seen corresponding path program 1 times [2018-10-26 21:55:40,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:40,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:40,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:40,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:40,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:41,431 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 4 [2018-10-26 21:55:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:41,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:41,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-26 21:55:41,469 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:41,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:55:41,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:55:41,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:55:41,469 INFO L87 Difference]: Start difference. First operand 815 states and 1063 transitions. Second operand 12 states. [2018-10-26 21:55:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:41,626 INFO L93 Difference]: Finished difference Result 837 states and 1086 transitions. [2018-10-26 21:55:41,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:55:41,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-10-26 21:55:41,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:41,628 INFO L225 Difference]: With dead ends: 837 [2018-10-26 21:55:41,629 INFO L226 Difference]: Without dead ends: 813 [2018-10-26 21:55:41,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-10-26 21:55:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-10-26 21:55:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2018-10-26 21:55:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-10-26 21:55:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1059 transitions. [2018-10-26 21:55:41,672 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1059 transitions. Word has length 63 [2018-10-26 21:55:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:41,673 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 1059 transitions. [2018-10-26 21:55:41,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:55:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1059 transitions. [2018-10-26 21:55:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 21:55:41,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:41,674 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-10-26 21:55:41,675 INFO L424 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:41,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:41,675 INFO L82 PathProgramCache]: Analyzing trace with hash -543334915, now seen corresponding path program 1 times [2018-10-26 21:55:41,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:41,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:41,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:41,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:41,676 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:42,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:42,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:42,088 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:42,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:42,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:42,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:42,089 INFO L87 Difference]: Start difference. First operand 813 states and 1059 transitions. Second operand 5 states. [2018-10-26 21:55:42,381 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 21:55:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:42,504 INFO L93 Difference]: Finished difference Result 847 states and 1098 transitions. [2018-10-26 21:55:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:55:42,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-10-26 21:55:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:42,507 INFO L225 Difference]: With dead ends: 847 [2018-10-26 21:55:42,507 INFO L226 Difference]: Without dead ends: 820 [2018-10-26 21:55:42,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:55:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2018-10-26 21:55:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 818. [2018-10-26 21:55:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-10-26 21:55:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1067 transitions. [2018-10-26 21:55:42,551 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1067 transitions. Word has length 67 [2018-10-26 21:55:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:42,551 INFO L481 AbstractCegarLoop]: Abstraction has 818 states and 1067 transitions. [2018-10-26 21:55:42,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1067 transitions. [2018-10-26 21:55:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-26 21:55:42,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:42,553 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-10-26 21:55:42,553 INFO L424 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:42,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:42,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1385952928, now seen corresponding path program 1 times [2018-10-26 21:55:42,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:42,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:42,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:42,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:43,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-10-26 21:55:43,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:43,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-26 21:55:43,251 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:43,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:55:43,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:55:43,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:55:43,251 INFO L87 Difference]: Start difference. First operand 818 states and 1067 transitions. Second operand 12 states. [2018-10-26 21:55:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:43,502 INFO L93 Difference]: Finished difference Result 842 states and 1092 transitions. [2018-10-26 21:55:43,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:55:43,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-10-26 21:55:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:43,505 INFO L225 Difference]: With dead ends: 842 [2018-10-26 21:55:43,505 INFO L226 Difference]: Without dead ends: 818 [2018-10-26 21:55:43,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-10-26 21:55:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-10-26 21:55:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 816. [2018-10-26 21:55:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2018-10-26 21:55:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1063 transitions. [2018-10-26 21:55:43,545 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1063 transitions. Word has length 62 [2018-10-26 21:55:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:43,545 INFO L481 AbstractCegarLoop]: Abstraction has 816 states and 1063 transitions. [2018-10-26 21:55:43,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:55:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1063 transitions. [2018-10-26 21:55:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-26 21:55:43,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:43,547 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-10-26 21:55:43,547 INFO L424 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:43,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:43,548 INFO L82 PathProgramCache]: Analyzing trace with hash 478731919, now seen corresponding path program 1 times [2018-10-26 21:55:43,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:43,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:43,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:43,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:43,549 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:43,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-10-26 21:55:43,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:43,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:43,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:43,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:43,639 INFO L87 Difference]: Start difference. First operand 816 states and 1063 transitions. Second operand 3 states. [2018-10-26 21:55:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:43,714 INFO L93 Difference]: Finished difference Result 1070 states and 1388 transitions. [2018-10-26 21:55:43,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:43,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-10-26 21:55:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:43,717 INFO L225 Difference]: With dead ends: 1070 [2018-10-26 21:55:43,717 INFO L226 Difference]: Without dead ends: 762 [2018-10-26 21:55:43,720 INFO L605 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-10-26 21:55:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-26 21:55:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 744. [2018-10-26 21:55:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-26 21:55:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 946 transitions. [2018-10-26 21:55:43,767 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 946 transitions. Word has length 62 [2018-10-26 21:55:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:43,769 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 946 transitions. [2018-10-26 21:55:43,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 946 transitions. [2018-10-26 21:55:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 21:55:43,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:43,770 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-10-26 21:55:43,771 INFO L424 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:43,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:43,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1067040035, now seen corresponding path program 1 times [2018-10-26 21:55:43,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:43,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:43,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:43,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:43,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:44,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:44,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-26 21:55:44,604 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:44,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:55:44,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:55:44,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:55:44,606 INFO L87 Difference]: Start difference. First operand 744 states and 946 transitions. Second operand 13 states. [2018-10-26 21:55:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:44,814 INFO L93 Difference]: Finished difference Result 761 states and 964 transitions. [2018-10-26 21:55:44,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 21:55:44,815 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-10-26 21:55:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:44,817 INFO L225 Difference]: With dead ends: 761 [2018-10-26 21:55:44,818 INFO L226 Difference]: Without dead ends: 733 [2018-10-26 21:55:44,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:55:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-10-26 21:55:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2018-10-26 21:55:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-10-26 21:55:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 931 transitions. [2018-10-26 21:55:44,872 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 931 transitions. Word has length 69 [2018-10-26 21:55:44,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:44,872 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 931 transitions. [2018-10-26 21:55:44,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 21:55:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 931 transitions. [2018-10-26 21:55:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 21:55:44,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:44,874 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-10-26 21:55:44,874 INFO L424 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:44,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash -48275879, now seen corresponding path program 1 times [2018-10-26 21:55:44,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:44,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:44,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:44,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:44,875 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:45,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-10-26 21:55:45,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:45,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-26 21:55:45,521 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:45,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:55:45,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:55:45,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:55:45,522 INFO L87 Difference]: Start difference. First operand 733 states and 931 transitions. Second operand 13 states. [2018-10-26 21:55:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:45,707 INFO L93 Difference]: Finished difference Result 750 states and 949 transitions. [2018-10-26 21:55:45,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 21:55:45,708 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-10-26 21:55:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:45,710 INFO L225 Difference]: With dead ends: 750 [2018-10-26 21:55:45,711 INFO L226 Difference]: Without dead ends: 728 [2018-10-26 21:55:45,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:55:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-10-26 21:55:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2018-10-26 21:55:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-10-26 21:55:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 924 transitions. [2018-10-26 21:55:45,749 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 924 transitions. Word has length 63 [2018-10-26 21:55:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:45,749 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 924 transitions. [2018-10-26 21:55:45,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 21:55:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 924 transitions. [2018-10-26 21:55:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-26 21:55:45,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:45,751 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-10-26 21:55:45,751 INFO L424 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:45,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:45,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1663625934, now seen corresponding path program 1 times [2018-10-26 21:55:45,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:45,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:45,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:45,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:45,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:45,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:45,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-26 21:55:45,975 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:45,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:55:45,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:55:45,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:55:45,976 INFO L87 Difference]: Start difference. First operand 728 states and 924 transitions. Second operand 13 states. [2018-10-26 21:55:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:46,208 INFO L93 Difference]: Finished difference Result 745 states and 942 transitions. [2018-10-26 21:55:46,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 21:55:46,209 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-10-26 21:55:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:46,211 INFO L225 Difference]: With dead ends: 745 [2018-10-26 21:55:46,211 INFO L226 Difference]: Without dead ends: 720 [2018-10-26 21:55:46,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:55:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-26 21:55:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-10-26 21:55:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-26 21:55:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 914 transitions. [2018-10-26 21:55:46,268 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 914 transitions. Word has length 62 [2018-10-26 21:55:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:46,270 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 914 transitions. [2018-10-26 21:55:46,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 21:55:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 914 transitions. [2018-10-26 21:55:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 21:55:46,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:46,272 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-10-26 21:55:46,272 INFO L424 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:46,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:46,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1192629544, now seen corresponding path program 1 times [2018-10-26 21:55:46,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:46,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:46,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:46,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:46,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:46,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:46,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:46,363 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:46,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:46,363 INFO L87 Difference]: Start difference. First operand 720 states and 914 transitions. Second operand 3 states. [2018-10-26 21:55:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:46,475 INFO L93 Difference]: Finished difference Result 842 states and 1072 transitions. [2018-10-26 21:55:46,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:46,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-10-26 21:55:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:46,479 INFO L225 Difference]: With dead ends: 842 [2018-10-26 21:55:46,479 INFO L226 Difference]: Without dead ends: 720 [2018-10-26 21:55:46,480 INFO L605 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-10-26 21:55:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-26 21:55:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-10-26 21:55:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-26 21:55:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 912 transitions. [2018-10-26 21:55:46,538 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 912 transitions. Word has length 66 [2018-10-26 21:55:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:46,539 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 912 transitions. [2018-10-26 21:55:46,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 912 transitions. [2018-10-26 21:55:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 21:55:46,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:55:46,544 INFO L424 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:46,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1875964411, now seen corresponding path program 1 times [2018-10-26 21:55:46,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:46,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:46,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:46,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:46,546 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:46,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:46,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:46,700 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:46,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:46,701 INFO L87 Difference]: Start difference. First operand 720 states and 912 transitions. Second operand 5 states. [2018-10-26 21:55:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:46,746 INFO L93 Difference]: Finished difference Result 766 states and 959 transitions. [2018-10-26 21:55:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:55:46,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-10-26 21:55:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:46,748 INFO L225 Difference]: With dead ends: 766 [2018-10-26 21:55:46,748 INFO L226 Difference]: Without dead ends: 714 [2018-10-26 21:55:46,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-10-26 21:55:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2018-10-26 21:55:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-10-26 21:55:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 902 transitions. [2018-10-26 21:55:46,802 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 902 transitions. Word has length 65 [2018-10-26 21:55:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:46,802 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 902 transitions. [2018-10-26 21:55:46,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 902 transitions. [2018-10-26 21:55:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-26 21:55:46,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:46,803 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-10-26 21:55:46,804 INFO L424 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:46,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:46,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1630066308, now seen corresponding path program 1 times [2018-10-26 21:55:46,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:46,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:47,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:47,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-26 21:55:47,297 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:47,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:55:47,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:55:47,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:55:47,298 INFO L87 Difference]: Start difference. First operand 714 states and 902 transitions. Second operand 12 states. [2018-10-26 21:55:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:47,634 INFO L93 Difference]: Finished difference Result 737 states and 926 transitions. [2018-10-26 21:55:47,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:55:47,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-10-26 21:55:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:47,637 INFO L225 Difference]: With dead ends: 737 [2018-10-26 21:55:47,637 INFO L226 Difference]: Without dead ends: 714 [2018-10-26 21:55:47,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:55:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-10-26 21:55:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2018-10-26 21:55:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-10-26 21:55:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 901 transitions. [2018-10-26 21:55:47,665 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 901 transitions. Word has length 70 [2018-10-26 21:55:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:47,665 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 901 transitions. [2018-10-26 21:55:47,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:55:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 901 transitions. [2018-10-26 21:55:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-26 21:55:47,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:47,666 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-10-26 21:55:47,666 INFO L424 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:47,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:47,667 INFO L82 PathProgramCache]: Analyzing trace with hash -928466434, now seen corresponding path program 1 times [2018-10-26 21:55:47,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:47,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:47,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:47,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:47,667 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:48,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:48,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 21:55:48,376 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:48,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 21:55:48,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 21:55:48,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:55:48,377 INFO L87 Difference]: Start difference. First operand 714 states and 901 transitions. Second operand 14 states. [2018-10-26 21:55:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:48,524 INFO L93 Difference]: Finished difference Result 740 states and 929 transitions. [2018-10-26 21:55:48,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 21:55:48,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-10-26 21:55:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:48,527 INFO L225 Difference]: With dead ends: 740 [2018-10-26 21:55:48,527 INFO L226 Difference]: Without dead ends: 712 [2018-10-26 21:55:48,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-10-26 21:55:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-10-26 21:55:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 710. [2018-10-26 21:55:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-10-26 21:55:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 895 transitions. [2018-10-26 21:55:48,559 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 895 transitions. Word has length 70 [2018-10-26 21:55:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:48,560 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 895 transitions. [2018-10-26 21:55:48,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 21:55:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 895 transitions. [2018-10-26 21:55:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 21:55:48,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:48,561 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-10-26 21:55:48,561 INFO L424 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:48,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash 158264959, now seen corresponding path program 1 times [2018-10-26 21:55:48,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:48,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:48,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:48,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:48,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:49,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:49,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-26 21:55:49,339 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:49,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 21:55:49,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 21:55:49,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:55:49,339 INFO L87 Difference]: Start difference. First operand 710 states and 895 transitions. Second operand 12 states. [2018-10-26 21:55:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:49,464 INFO L93 Difference]: Finished difference Result 732 states and 918 transitions. [2018-10-26 21:55:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 21:55:49,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-10-26 21:55:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:49,467 INFO L225 Difference]: With dead ends: 732 [2018-10-26 21:55:49,467 INFO L226 Difference]: Without dead ends: 708 [2018-10-26 21:55:49,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-10-26 21:55:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-10-26 21:55:49,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2018-10-26 21:55:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-10-26 21:55:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 891 transitions. [2018-10-26 21:55:49,517 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 891 transitions. Word has length 67 [2018-10-26 21:55:49,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:49,517 INFO L481 AbstractCegarLoop]: Abstraction has 708 states and 891 transitions. [2018-10-26 21:55:49,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 21:55:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 891 transitions. [2018-10-26 21:55:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 21:55:49,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:49,519 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-10-26 21:55:49,519 INFO L424 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:49,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:49,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1477541838, now seen corresponding path program 1 times [2018-10-26 21:55:49,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:49,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:49,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:49,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:49,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:49,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:49,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:49,767 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:49,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:49,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:49,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:49,768 INFO L87 Difference]: Start difference. First operand 708 states and 891 transitions. Second operand 5 states. [2018-10-26 21:55:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:50,039 INFO L93 Difference]: Finished difference Result 742 states and 926 transitions. [2018-10-26 21:55:50,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:55:50,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-10-26 21:55:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:50,041 INFO L225 Difference]: With dead ends: 742 [2018-10-26 21:55:50,042 INFO L226 Difference]: Without dead ends: 703 [2018-10-26 21:55:50,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-10-26 21:55:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2018-10-26 21:55:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-26 21:55:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 884 transitions. [2018-10-26 21:55:50,073 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 884 transitions. Word has length 67 [2018-10-26 21:55:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:50,074 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 884 transitions. [2018-10-26 21:55:50,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 884 transitions. [2018-10-26 21:55:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-26 21:55:50,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:50,075 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-10-26 21:55:50,075 INFO L424 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:50,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:50,075 INFO L82 PathProgramCache]: Analyzing trace with hash 800562057, now seen corresponding path program 1 times [2018-10-26 21:55:50,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:50,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:50,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:50,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:50,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:50,287 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:50,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:50,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:50,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:50,288 INFO L87 Difference]: Start difference. First operand 703 states and 884 transitions. Second operand 5 states. [2018-10-26 21:55:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:50,571 INFO L93 Difference]: Finished difference Result 787 states and 989 transitions. [2018-10-26 21:55:50,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:55:50,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-10-26 21:55:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:50,574 INFO L225 Difference]: With dead ends: 787 [2018-10-26 21:55:50,574 INFO L226 Difference]: Without dead ends: 778 [2018-10-26 21:55:50,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:55:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-10-26 21:55:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 703. [2018-10-26 21:55:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-26 21:55:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 882 transitions. [2018-10-26 21:55:50,643 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 882 transitions. Word has length 68 [2018-10-26 21:55:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:50,644 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 882 transitions. [2018-10-26 21:55:50,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 882 transitions. [2018-10-26 21:55:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 21:55:50,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:50,683 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-10-26 21:55:50,683 INFO L424 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:50,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:50,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1425039817, now seen corresponding path program 1 times [2018-10-26 21:55:50,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:50,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:50,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:50,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:50,684 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:50,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:50,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:50,802 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:50,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:50,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:50,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:50,803 INFO L87 Difference]: Start difference. First operand 703 states and 882 transitions. Second operand 5 states. [2018-10-26 21:55:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:50,839 INFO L93 Difference]: Finished difference Result 737 states and 917 transitions. [2018-10-26 21:55:50,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:55:50,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-10-26 21:55:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:50,842 INFO L225 Difference]: With dead ends: 737 [2018-10-26 21:55:50,842 INFO L226 Difference]: Without dead ends: 698 [2018-10-26 21:55:50,842 INFO L605 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-10-26 21:55:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-10-26 21:55:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2018-10-26 21:55:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-10-26 21:55:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 875 transitions. [2018-10-26 21:55:50,891 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 875 transitions. Word has length 69 [2018-10-26 21:55:50,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:50,891 INFO L481 AbstractCegarLoop]: Abstraction has 698 states and 875 transitions. [2018-10-26 21:55:50,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 875 transitions. [2018-10-26 21:55:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 21:55:50,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:50,896 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-10-26 21:55:50,896 INFO L424 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:50,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:50,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1329535212, now seen corresponding path program 1 times [2018-10-26 21:55:50,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:50,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:50,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:50,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:50,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:51,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:51,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-26 21:55:51,088 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:51,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:55:51,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:55:51,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:55:51,089 INFO L87 Difference]: Start difference. First operand 698 states and 875 transitions. Second operand 11 states. [2018-10-26 21:55:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:51,182 INFO L93 Difference]: Finished difference Result 725 states and 905 transitions. [2018-10-26 21:55:51,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:55:51,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-10-26 21:55:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:51,185 INFO L225 Difference]: With dead ends: 725 [2018-10-26 21:55:51,185 INFO L226 Difference]: Without dead ends: 695 [2018-10-26 21:55:51,186 INFO L605 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-10-26 21:55:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-10-26 21:55:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2018-10-26 21:55:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-10-26 21:55:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 870 transitions. [2018-10-26 21:55:51,231 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 870 transitions. Word has length 69 [2018-10-26 21:55:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:51,231 INFO L481 AbstractCegarLoop]: Abstraction has 695 states and 870 transitions. [2018-10-26 21:55:51,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:55:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 870 transitions. [2018-10-26 21:55:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 21:55:51,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:51,232 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-10-26 21:55:51,233 INFO L424 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:51,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1592706261, now seen corresponding path program 1 times [2018-10-26 21:55:51,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:51,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:51,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:51,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:51,234 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:51,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:51,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-26 21:55:51,363 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:51,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:55:51,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:55:51,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:55:51,364 INFO L87 Difference]: Start difference. First operand 695 states and 870 transitions. Second operand 11 states. [2018-10-26 21:55:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:51,504 INFO L93 Difference]: Finished difference Result 705 states and 879 transitions. [2018-10-26 21:55:51,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:55:51,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-10-26 21:55:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:51,506 INFO L225 Difference]: With dead ends: 705 [2018-10-26 21:55:51,506 INFO L226 Difference]: Without dead ends: 699 [2018-10-26 21:55:51,506 INFO L605 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-10-26 21:55:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-10-26 21:55:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 692. [2018-10-26 21:55:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-10-26 21:55:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 863 transitions. [2018-10-26 21:55:51,537 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 863 transitions. Word has length 69 [2018-10-26 21:55:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:51,537 INFO L481 AbstractCegarLoop]: Abstraction has 692 states and 863 transitions. [2018-10-26 21:55:51,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:55:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 863 transitions. [2018-10-26 21:55:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 21:55:51,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:51,538 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-10-26 21:55:51,539 INFO L424 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:51,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:51,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1592983091, now seen corresponding path program 1 times [2018-10-26 21:55:51,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:51,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:51,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:51,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:51,540 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:51,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:51,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:51,776 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:51,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:51,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:51,776 INFO L87 Difference]: Start difference. First operand 692 states and 863 transitions. Second operand 5 states. [2018-10-26 21:55:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:52,122 INFO L93 Difference]: Finished difference Result 770 states and 962 transitions. [2018-10-26 21:55:52,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:55:52,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-10-26 21:55:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:52,124 INFO L225 Difference]: With dead ends: 770 [2018-10-26 21:55:52,125 INFO L226 Difference]: Without dead ends: 735 [2018-10-26 21:55:52,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:55:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-10-26 21:55:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 663. [2018-10-26 21:55:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-10-26 21:55:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 827 transitions. [2018-10-26 21:55:52,174 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 827 transitions. Word has length 69 [2018-10-26 21:55:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:52,174 INFO L481 AbstractCegarLoop]: Abstraction has 663 states and 827 transitions. [2018-10-26 21:55:52,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 827 transitions. [2018-10-26 21:55:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 21:55:52,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:52,175 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-10-26 21:55:52,175 INFO L424 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:52,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:52,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1499782956, now seen corresponding path program 1 times [2018-10-26 21:55:52,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:52,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:52,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:52,183 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:52,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:52,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:55:52,268 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:52,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:55:52,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:55:52,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:55:52,268 INFO L87 Difference]: Start difference. First operand 663 states and 827 transitions. Second operand 3 states. [2018-10-26 21:55:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:52,393 INFO L93 Difference]: Finished difference Result 689 states and 857 transitions. [2018-10-26 21:55:52,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:55:52,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-10-26 21:55:52,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:52,396 INFO L225 Difference]: With dead ends: 689 [2018-10-26 21:55:52,397 INFO L226 Difference]: Without dead ends: 649 [2018-10-26 21:55:52,397 INFO L605 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-10-26 21:55:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-10-26 21:55:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 645. [2018-10-26 21:55:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-10-26 21:55:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 802 transitions. [2018-10-26 21:55:52,425 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 802 transitions. Word has length 69 [2018-10-26 21:55:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:52,425 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 802 transitions. [2018-10-26 21:55:52,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:55:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 802 transitions. [2018-10-26 21:55:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-26 21:55:52,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:52,426 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-10-26 21:55:52,427 INFO L424 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:52,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:52,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1534088944, now seen corresponding path program 1 times [2018-10-26 21:55:52,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:52,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:52,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:52,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:52,428 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:52,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:52,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 21:55:52,596 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:52,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:55:52,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:55:52,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:55:52,597 INFO L87 Difference]: Start difference. First operand 645 states and 802 transitions. Second operand 7 states. [2018-10-26 21:55:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:52,662 INFO L93 Difference]: Finished difference Result 691 states and 849 transitions. [2018-10-26 21:55:52,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:55:52,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-10-26 21:55:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:52,664 INFO L225 Difference]: With dead ends: 691 [2018-10-26 21:55:52,664 INFO L226 Difference]: Without dead ends: 646 [2018-10-26 21:55:52,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:55:52,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-10-26 21:55:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2018-10-26 21:55:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-10-26 21:55:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 798 transitions. [2018-10-26 21:55:52,696 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 798 transitions. Word has length 74 [2018-10-26 21:55:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:52,697 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 798 transitions. [2018-10-26 21:55:52,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:55:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 798 transitions. [2018-10-26 21:55:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-26 21:55:52,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:52,698 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-10-26 21:55:52,698 INFO L424 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:52,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash -832489070, now seen corresponding path program 1 times [2018-10-26 21:55:52,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:52,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:52,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:52,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:52,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 21:55:52,897 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:52,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 21:55:52,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 21:55:52,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:55:52,898 INFO L87 Difference]: Start difference. First operand 644 states and 798 transitions. Second operand 14 states. [2018-10-26 21:55:53,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:53,133 INFO L93 Difference]: Finished difference Result 666 states and 821 transitions. [2018-10-26 21:55:53,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 21:55:53,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-10-26 21:55:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:53,135 INFO L225 Difference]: With dead ends: 666 [2018-10-26 21:55:53,135 INFO L226 Difference]: Without dead ends: 634 [2018-10-26 21:55:53,136 INFO L605 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-10-26 21:55:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-10-26 21:55:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2018-10-26 21:55:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-26 21:55:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 783 transitions. [2018-10-26 21:55:53,162 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 783 transitions. Word has length 74 [2018-10-26 21:55:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:53,162 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 783 transitions. [2018-10-26 21:55:53,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 21:55:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 783 transitions. [2018-10-26 21:55:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-26 21:55:53,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:53,163 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-10-26 21:55:53,163 INFO L424 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:53,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:53,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1423434446, now seen corresponding path program 1 times [2018-10-26 21:55:53,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:53,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:53,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:53,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:55:53,272 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:53,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:55:53,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:55:53,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:55:53,273 INFO L87 Difference]: Start difference. First operand 634 states and 783 transitions. Second operand 5 states. [2018-10-26 21:55:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:53,309 INFO L93 Difference]: Finished difference Result 681 states and 832 transitions. [2018-10-26 21:55:53,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:55:53,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-10-26 21:55:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:53,312 INFO L225 Difference]: With dead ends: 681 [2018-10-26 21:55:53,312 INFO L226 Difference]: Without dead ends: 638 [2018-10-26 21:55:53,312 INFO L605 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-10-26 21:55:53,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-10-26 21:55:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 634. [2018-10-26 21:55:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-26 21:55:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 782 transitions. [2018-10-26 21:55:53,349 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 782 transitions. Word has length 71 [2018-10-26 21:55:53,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:53,349 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 782 transitions. [2018-10-26 21:55:53,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:55:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 782 transitions. [2018-10-26 21:55:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-26 21:55:53,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:53,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] [2018-10-26 21:55:53,351 INFO L424 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:53,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:53,351 INFO L82 PathProgramCache]: Analyzing trace with hash 627549552, now seen corresponding path program 1 times [2018-10-26 21:55:53,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:53,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:53,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:53,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:53,352 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:53,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:53,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 21:55:53,615 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:53,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 21:55:53,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 21:55:53,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:55:53,616 INFO L87 Difference]: Start difference. First operand 634 states and 782 transitions. Second operand 14 states. [2018-10-26 21:55:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:53,745 INFO L93 Difference]: Finished difference Result 658 states and 808 transitions. [2018-10-26 21:55:53,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 21:55:53,746 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-10-26 21:55:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:53,748 INFO L225 Difference]: With dead ends: 658 [2018-10-26 21:55:53,748 INFO L226 Difference]: Without dead ends: 627 [2018-10-26 21:55:53,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-10-26 21:55:53,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-10-26 21:55:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2018-10-26 21:55:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-10-26 21:55:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 772 transitions. [2018-10-26 21:55:53,782 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 772 transitions. Word has length 71 [2018-10-26 21:55:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:53,782 INFO L481 AbstractCegarLoop]: Abstraction has 627 states and 772 transitions. [2018-10-26 21:55:53,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 21:55:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 772 transitions. [2018-10-26 21:55:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-26 21:55:53,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:53,783 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-10-26 21:55:53,784 INFO L424 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:53,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1466862187, now seen corresponding path program 1 times [2018-10-26 21:55:53,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:53,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:53,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:53,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:53,785 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:53,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:53,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 21:55:53,919 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:53,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 21:55:53,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 21:55:53,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:55:53,920 INFO L87 Difference]: Start difference. First operand 627 states and 772 transitions. Second operand 14 states. [2018-10-26 21:55:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:54,075 INFO L93 Difference]: Finished difference Result 691 states and 840 transitions. [2018-10-26 21:55:54,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 21:55:54,076 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-10-26 21:55:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:54,077 INFO L225 Difference]: With dead ends: 691 [2018-10-26 21:55:54,077 INFO L226 Difference]: Without dead ends: 621 [2018-10-26 21:55:54,078 INFO L605 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-10-26 21:55:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-10-26 21:55:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2018-10-26 21:55:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-10-26 21:55:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 763 transitions. [2018-10-26 21:55:54,103 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 763 transitions. Word has length 71 [2018-10-26 21:55:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:54,103 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 763 transitions. [2018-10-26 21:55:54,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 21:55:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 763 transitions. [2018-10-26 21:55:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 21:55:54,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:54,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, 1, 1, 1, 1] [2018-10-26 21:55:54,105 INFO L424 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:54,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1892784974, now seen corresponding path program 1 times [2018-10-26 21:55:54,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:54,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:54,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:54,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:54,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:54,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 21:55:54,279 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:54,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:55:54,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:55:54,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:55:54,280 INFO L87 Difference]: Start difference. First operand 621 states and 763 transitions. Second operand 7 states. [2018-10-26 21:55:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:54,366 INFO L93 Difference]: Finished difference Result 675 states and 824 transitions. [2018-10-26 21:55:54,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:55:54,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-10-26 21:55:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:54,368 INFO L225 Difference]: With dead ends: 675 [2018-10-26 21:55:54,368 INFO L226 Difference]: Without dead ends: 619 [2018-10-26 21:55:54,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:55:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-10-26 21:55:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2018-10-26 21:55:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-10-26 21:55:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 753 transitions. [2018-10-26 21:55:54,398 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 753 transitions. Word has length 77 [2018-10-26 21:55:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:54,399 INFO L481 AbstractCegarLoop]: Abstraction has 615 states and 753 transitions. [2018-10-26 21:55:54,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:55:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 753 transitions. [2018-10-26 21:55:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 21:55:54,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:54,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:55:54,400 INFO L424 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:54,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1700582448, now seen corresponding path program 1 times [2018-10-26 21:55:54,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:54,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:54,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:54,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:54,401 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:54,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:54,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 21:55:54,596 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:54,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 21:55:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 21:55:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:55:54,597 INFO L87 Difference]: Start difference. First operand 615 states and 753 transitions. Second operand 14 states. [2018-10-26 21:55:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:54,718 INFO L93 Difference]: Finished difference Result 641 states and 781 transitions. [2018-10-26 21:55:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 21:55:54,719 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-10-26 21:55:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:54,720 INFO L225 Difference]: With dead ends: 641 [2018-10-26 21:55:54,720 INFO L226 Difference]: Without dead ends: 617 [2018-10-26 21:55:54,721 INFO L605 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-10-26 21:55:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-26 21:55:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2018-10-26 21:55:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-10-26 21:55:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 749 transitions. [2018-10-26 21:55:54,746 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 749 transitions. Word has length 77 [2018-10-26 21:55:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:54,746 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 749 transitions. [2018-10-26 21:55:54,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 21:55:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 749 transitions. [2018-10-26 21:55:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 21:55:54,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:54,747 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-10-26 21:55:54,747 INFO L424 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:54,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:54,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1328298255, now seen corresponding path program 1 times [2018-10-26 21:55:54,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:54,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:54,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:54,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:54,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:54,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:54,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 21:55:54,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:54,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 21:55:54,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 21:55:54,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:55:54,862 INFO L87 Difference]: Start difference. First operand 613 states and 749 transitions. Second operand 14 states. [2018-10-26 21:55:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:54,975 INFO L93 Difference]: Finished difference Result 672 states and 811 transitions. [2018-10-26 21:55:54,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 21:55:54,976 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-10-26 21:55:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:54,977 INFO L225 Difference]: With dead ends: 672 [2018-10-26 21:55:54,978 INFO L226 Difference]: Without dead ends: 601 [2018-10-26 21:55:54,978 INFO L605 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-10-26 21:55:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-10-26 21:55:55,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-10-26 21:55:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-10-26 21:55:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 730 transitions. [2018-10-26 21:55:55,003 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 730 transitions. Word has length 72 [2018-10-26 21:55:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:55,003 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 730 transitions. [2018-10-26 21:55:55,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 21:55:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 730 transitions. [2018-10-26 21:55:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-26 21:55:55,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:55,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, 1, 1] [2018-10-26 21:55:55,004 INFO L424 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:55,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:55,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1718873266, now seen corresponding path program 1 times [2018-10-26 21:55:55,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:55,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:55,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:55,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:55,006 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:55,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:55,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-26 21:55:55,220 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:55,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 21:55:55,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 21:55:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-26 21:55:55,220 INFO L87 Difference]: Start difference. First operand 601 states and 730 transitions. Second operand 11 states. [2018-10-26 21:55:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:55,306 INFO L93 Difference]: Finished difference Result 783 states and 941 transitions. [2018-10-26 21:55:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:55:55,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-10-26 21:55:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:55,309 INFO L225 Difference]: With dead ends: 783 [2018-10-26 21:55:55,309 INFO L226 Difference]: Without dead ends: 643 [2018-10-26 21:55:55,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:55:55,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-10-26 21:55:55,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 607. [2018-10-26 21:55:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-10-26 21:55:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 732 transitions. [2018-10-26 21:55:55,335 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 732 transitions. Word has length 71 [2018-10-26 21:55:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:55,335 INFO L481 AbstractCegarLoop]: Abstraction has 607 states and 732 transitions. [2018-10-26 21:55:55,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 21:55:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 732 transitions. [2018-10-26 21:55:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 21:55:55,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:55,336 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, 1, 1] [2018-10-26 21:55:55,337 INFO L424 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:55,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:55,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2090302376, now seen corresponding path program 1 times [2018-10-26 21:55:55,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:55,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:55,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:55,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:55,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:55,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-26 21:55:55,549 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:55,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:55:55,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:55:55,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:55:55,549 INFO L87 Difference]: Start difference. First operand 607 states and 732 transitions. Second operand 13 states. [2018-10-26 21:55:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:55,716 INFO L93 Difference]: Finished difference Result 627 states and 753 transitions. [2018-10-26 21:55:55,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 21:55:55,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-10-26 21:55:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:55,719 INFO L225 Difference]: With dead ends: 627 [2018-10-26 21:55:55,719 INFO L226 Difference]: Without dead ends: 602 [2018-10-26 21:55:55,720 INFO L605 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-10-26 21:55:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-10-26 21:55:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2018-10-26 21:55:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-26 21:55:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 724 transitions. [2018-10-26 21:55:55,745 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 724 transitions. Word has length 79 [2018-10-26 21:55:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:55,745 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 724 transitions. [2018-10-26 21:55:55,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 21:55:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 724 transitions. [2018-10-26 21:55:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 21:55:55,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:55,747 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-10-26 21:55:55,747 INFO L424 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:55,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:55,747 INFO L82 PathProgramCache]: Analyzing trace with hash -130625566, now seen corresponding path program 1 times [2018-10-26 21:55:55,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:55,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:55,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:55,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:55,748 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:55,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:55,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-26 21:55:55,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:55,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 21:55:55,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 21:55:55,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:55:55,875 INFO L87 Difference]: Start difference. First operand 602 states and 724 transitions. Second operand 13 states. [2018-10-26 21:55:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:56,044 INFO L93 Difference]: Finished difference Result 604 states and 725 transitions. [2018-10-26 21:55:56,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 21:55:56,045 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-10-26 21:55:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:56,046 INFO L225 Difference]: With dead ends: 604 [2018-10-26 21:55:56,047 INFO L226 Difference]: Without dead ends: 553 [2018-10-26 21:55:56,047 INFO L605 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-10-26 21:55:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-10-26 21:55:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2018-10-26 21:55:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-10-26 21:55:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 670 transitions. [2018-10-26 21:55:56,096 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 670 transitions. Word has length 72 [2018-10-26 21:55:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:56,096 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 670 transitions. [2018-10-26 21:55:56,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 21:55:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 670 transitions. [2018-10-26 21:55:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-26 21:55:56,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:56,097 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-10-26 21:55:56,097 INFO L424 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:56,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:56,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1138430218, now seen corresponding path program 1 times [2018-10-26 21:55:56,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:56,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:56,098 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:56,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:56,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-26 21:55:56,240 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:56,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 21:55:56,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 21:55:56,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:55:56,241 INFO L87 Difference]: Start difference. First operand 553 states and 670 transitions. Second operand 10 states. [2018-10-26 21:55:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:55:57,211 INFO L93 Difference]: Finished difference Result 1151 states and 1388 transitions. [2018-10-26 21:55:57,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 21:55:57,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-10-26 21:55:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:55:57,214 INFO L225 Difference]: With dead ends: 1151 [2018-10-26 21:55:57,215 INFO L226 Difference]: Without dead ends: 1004 [2018-10-26 21:55:57,215 INFO L605 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-10-26 21:55:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-10-26 21:55:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 869. [2018-10-26 21:55:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-10-26 21:55:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1069 transitions. [2018-10-26 21:55:57,255 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1069 transitions. Word has length 73 [2018-10-26 21:55:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:55:57,255 INFO L481 AbstractCegarLoop]: Abstraction has 869 states and 1069 transitions. [2018-10-26 21:55:57,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 21:55:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1069 transitions. [2018-10-26 21:55:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-26 21:55:57,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:55:57,257 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-10-26 21:55:57,257 INFO L424 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:55:57,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:55:57,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1817702472, now seen corresponding path program 1 times [2018-10-26 21:55:57,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:55:57,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:57,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:55:57,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:55:57,258 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:55:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:55:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:55:57,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:55:57,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:55:57,306 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:55:57,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:55:57,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:55:57,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:55:57,307 INFO L87 Difference]: Start difference. First operand 869 states and 1069 transitions. Second operand 6 states. [2018-10-26 21:56:00,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:56:00,072 INFO L93 Difference]: Finished difference Result 1149 states and 1380 transitions. [2018-10-26 21:56:00,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:56:00,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-10-26 21:56:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:56:00,075 INFO L225 Difference]: With dead ends: 1149 [2018-10-26 21:56:00,075 INFO L226 Difference]: Without dead ends: 1019 [2018-10-26 21:56:00,076 INFO L605 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-10-26 21:56:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-10-26 21:56:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 958. [2018-10-26 21:56:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-10-26 21:56:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1173 transitions. [2018-10-26 21:56:00,122 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1173 transitions. Word has length 73 [2018-10-26 21:56:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:56:00,122 INFO L481 AbstractCegarLoop]: Abstraction has 958 states and 1173 transitions. [2018-10-26 21:56:00,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:56:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1173 transitions. [2018-10-26 21:56:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-26 21:56:00,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:56:00,124 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-10-26 21:56:00,124 INFO L424 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:56:00,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:56:00,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1443465868, now seen corresponding path program 1 times [2018-10-26 21:56:00,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:56:00,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:56:00,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:56:00,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:56:00,125 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:56:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:56:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:56:00,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:56:00,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:56:00,195 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:56:00,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:56:00,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:56:00,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:56:00,196 INFO L87 Difference]: Start difference. First operand 958 states and 1173 transitions. Second operand 5 states. [2018-10-26 21:56:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:56:00,245 INFO L93 Difference]: Finished difference Result 1003 states and 1221 transitions. [2018-10-26 21:56:00,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:56:00,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-10-26 21:56:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:56:00,249 INFO L225 Difference]: With dead ends: 1003 [2018-10-26 21:56:00,249 INFO L226 Difference]: Without dead ends: 938 [2018-10-26 21:56:00,249 INFO L605 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-10-26 21:56:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-26 21:56:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2018-10-26 21:56:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-10-26 21:56:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1145 transitions. [2018-10-26 21:56:00,323 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1145 transitions. Word has length 73 [2018-10-26 21:56:00,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:56:00,323 INFO L481 AbstractCegarLoop]: Abstraction has 938 states and 1145 transitions. [2018-10-26 21:56:00,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:56:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1145 transitions. [2018-10-26 21:56:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-26 21:56:00,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:56:00,324 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-10-26 21:56:00,325 INFO L424 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:56:00,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:56:00,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2027501370, now seen corresponding path program 1 times [2018-10-26 21:56:00,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:56:00,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:56:00,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:56:00,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:56:00,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:56:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:56:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:56:00,391 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 21:56:00,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:56:00 BoogieIcfgContainer [2018-10-26 21:56:00,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:56:00,523 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:56:00,523 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:56:00,523 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:56:00,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:55:14" (3/4) ... [2018-10-26 21:56:00,534 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 21:56:00,629 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fdcfa24a-2694-46a7-a0e3-23b52101868e/bin-2019/utaipan/witness.graphml [2018-10-26 21:56:00,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:56:00,631 INFO L168 Benchmark]: Toolchain (without parser) took 49443.26 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 617.6 MB). Free memory was 951.8 MB in the beginning and 848.8 MB in the end (delta: 102.9 MB). Peak memory consumption was 720.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:56:00,631 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:56:00,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.27 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 913.9 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:56:00,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.11 ms. Allocated memory is still 1.0 GB. Free memory is still 913.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:56:00,632 INFO L168 Benchmark]: Boogie Preprocessor took 191.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 913.9 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-10-26 21:56:00,632 INFO L168 Benchmark]: RCFGBuilder took 2459.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.4 MB in the end (delta: 142.8 MB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:56:00,632 INFO L168 Benchmark]: TraceAbstraction took 46014.05 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 500.2 MB). Free memory was 958.9 MB in the beginning and 865.6 MB in the end (delta: 93.2 MB). Peak memory consumption was 593.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:56:00,633 INFO L168 Benchmark]: Witness Printer took 106.13 ms. Allocated memory is still 1.6 GB. Free memory was 865.6 MB in the beginning and 848.8 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:56:00,634 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 608.27 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 913.9 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.11 ms. Allocated memory is still 1.0 GB. Free memory is still 913.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 191.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 913.9 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2459.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.4 MB in the end (delta: 142.8 MB). Peak memory consumption was 142.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46014.05 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 500.2 MB). Free memory was 958.9 MB in the beginning and 865.6 MB in the end (delta: 93.2 MB). Peak memory consumption was 593.4 MB. Max. memory is 11.5 GB. * Witness Printer took 106.13 ms. Allocated memory is still 1.6 GB. Free memory was 865.6 MB in the beginning and 848.8 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 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, 45.9s OverallTime, 68 OverallIterations, 2 TraceHistogramMax, 25.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39232 SDtfs, 16697 SDslu, 168696 SDs, 0 SdLazy, 14008 SolverSat, 2807 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 151 SyntacticMatches, 6 SemanticMatches, 487 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=958occurred in iteration=66, 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: 3.2s AutomataMinimizationTime, 67 MinimizatonAttempts, 1857 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 4046 NumberOfCodeBlocks, 4046 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 3906 ConstructedInterpolants, 0 QuantifiedInterpolants, 507070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 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...