./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_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/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_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/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-11-10 09:54:38,218 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:54:38,219 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:54:38,226 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:54:38,226 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:54:38,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:54:38,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:54:38,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:54:38,230 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:54:38,230 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:54:38,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:54:38,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:54:38,232 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:54:38,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:54:38,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:54:38,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:54:38,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:54:38,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:54:38,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:54:38,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:54:38,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:54:38,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:54:38,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:54:38,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:54:38,242 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:54:38,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:54:38,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:54:38,243 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:54:38,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:54:38,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:54:38,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:54:38,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:54:38,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:54:38,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:54:38,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:54:38,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:54:38,247 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 09:54:38,256 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:54:38,256 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:54:38,257 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:54:38,257 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 09:54:38,257 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 09:54:38,257 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 09:54:38,257 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 09:54:38,257 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 09:54:38,258 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 09:54:38,258 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 09:54:38,258 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 09:54:38,258 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:54:38,258 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:54:38,259 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:54:38,259 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:54:38,259 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:54:38,259 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:54:38,259 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:54:38,259 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:54:38,259 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:54:38,260 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:54:38,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:54:38,260 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:54:38,260 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:54:38,260 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:54:38,260 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:54:38,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:54:38,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:54:38,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:54:38,261 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:54:38,261 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 09:54:38,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:54:38,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:54:38,261 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 09:54:38,261 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_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c60fa6dcffe947607e07f04cc37f17d0aae2288e [2018-11-10 09:54:38,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:54:38,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:54:38,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:54:38,295 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:54:38,295 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:54:38,296 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 09:54:38,330 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan/data/1ca1577b3/ecb2db7e427a41868fd39a27bb266f14/FLAG746fce845 [2018-11-10 09:54:38,799 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:54:38,799 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 09:54:38,809 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan/data/1ca1577b3/ecb2db7e427a41868fd39a27bb266f14/FLAG746fce845 [2018-11-10 09:54:38,817 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan/data/1ca1577b3/ecb2db7e427a41868fd39a27bb266f14 [2018-11-10 09:54:38,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:54:38,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:54:38,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:54:38,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:54:38,823 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:54:38,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:54:38" (1/1) ... [2018-11-10 09:54:38,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24840ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:38, skipping insertion in model container [2018-11-10 09:54:38,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:54:38" (1/1) ... [2018-11-10 09:54:38,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:54:38,869 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:54:39,101 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:54:39,105 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:54:39,173 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:54:39,191 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:54:39,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39 WrapperNode [2018-11-10 09:54:39,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:54:39,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:54:39,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:54:39,192 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:54:39,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39" (1/1) ... [2018-11-10 09:54:39,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39" (1/1) ... [2018-11-10 09:54:39,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:54:39,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:54:39,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:54:39,260 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:54:39,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39" (1/1) ... [2018-11-10 09:54:39,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39" (1/1) ... [2018-11-10 09:54:39,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39" (1/1) ... [2018-11-10 09:54:39,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39" (1/1) ... [2018-11-10 09:54:39,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39" (1/1) ... [2018-11-10 09:54:39,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39" (1/1) ... [2018-11-10 09:54:39,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39" (1/1) ... [2018-11-10 09:54:39,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:54:39,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:54:39,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:54:39,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:54:39,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:54:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-10 09:54:39,356 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-10 09:54:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-10 09:54:39,357 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-10 09:54:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-10 09:54:39,357 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-10 09:54:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-11-10 09:54:39,357 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-11-10 09:54:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:54:39,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:54:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-10 09:54:39,358 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-10 09:54:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-10 09:54:39,358 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-10 09:54:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-10 09:54:39,358 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-10 09:54:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-10 09:54:39,358 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-10 09:54:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-10 09:54:39,358 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-10 09:54:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-10 09:54:39,359 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-10 09:54:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-10 09:54:39,359 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-10 09:54:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-10 09:54:39,359 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-10 09:54:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-10 09:54:39,359 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-10 09:54:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-10 09:54:39,360 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-10 09:54:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-10 09:54:39,360 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-10 09:54:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-10 09:54:39,360 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-10 09:54:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-10 09:54:39,360 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-10 09:54:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-10 09:54:39,360 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-10 09:54:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-10 09:54:39,361 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-10 09:54:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-10 09:54:39,361 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-10 09:54:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-10 09:54:39,361 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-10 09:54:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:54:39,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:54:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-10 09:54:39,362 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-10 09:54:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-10 09:54:39,362 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-10 09:54:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:54:39,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:54:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-10 09:54:39,362 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-10 09:54:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-11-10 09:54:39,363 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-11-10 09:54:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-10 09:54:39,363 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-10 09:54:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-10 09:54:39,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-10 09:54:39,637 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:54:39,637 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:54:39,702 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:54:39,702 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:54:39,785 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:54:39,785 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:54:39,846 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:54:39,847 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:54:39,887 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:54:39,887 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:54:39,994 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:54:39,994 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:54:40,030 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:54:40,030 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:54:40,043 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:54:40,044 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:54:40,195 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 09:54:40,195 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 09:54:40,215 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:54:40,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:54:40 BoogieIcfgContainer [2018-11-10 09:54:40,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:54:40,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:54:40,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:54:40,219 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:54:40,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:54:38" (1/3) ... [2018-11-10 09:54:40,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@832281d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:54:40, skipping insertion in model container [2018-11-10 09:54:40,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:39" (2/3) ... [2018-11-10 09:54:40,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@832281d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:54:40, skipping insertion in model container [2018-11-10 09:54:40,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:54:40" (3/3) ... [2018-11-10 09:54:40,222 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 09:54:40,230 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:54:40,236 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 09:54:40,249 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 09:54:40,279 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:54:40,279 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:54:40,280 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:54:40,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:54:40,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:54:40,280 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:54:40,280 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:54:40,280 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:54:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states. [2018-11-10 09:54:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 09:54:40,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:40,307 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:40,309 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:40,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:40,313 INFO L82 PathProgramCache]: Analyzing trace with hash -448213016, now seen corresponding path program 1 times [2018-11-10 09:54:40,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:40,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:40,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:40,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:40,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:40,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:40,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:40,496 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:40,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:40,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:40,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:40,508 INFO L87 Difference]: Start difference. First operand 518 states. Second operand 3 states. [2018-11-10 09:54:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:40,655 INFO L93 Difference]: Finished difference Result 893 states and 1383 transitions. [2018-11-10 09:54:40,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:40,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 09:54:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:40,669 INFO L225 Difference]: With dead ends: 893 [2018-11-10 09:54:40,669 INFO L226 Difference]: Without dead ends: 510 [2018-11-10 09:54:40,674 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-11-10 09:54:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-11-10 09:54:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2018-11-10 09:54:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-11-10 09:54:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 741 transitions. [2018-11-10 09:54:40,737 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 741 transitions. Word has length 20 [2018-11-10 09:54:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:40,737 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 741 transitions. [2018-11-10 09:54:40,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 741 transitions. [2018-11-10 09:54:40,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 09:54:40,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:40,739 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:40,739 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:40,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:40,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1549764761, now seen corresponding path program 1 times [2018-11-10 09:54:40,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:40,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:40,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:40,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:40,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:40,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:40,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:40,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:40,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:40,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:40,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:40,853 INFO L87 Difference]: Start difference. First operand 510 states and 741 transitions. Second operand 3 states. [2018-11-10 09:54:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:41,078 INFO L93 Difference]: Finished difference Result 798 states and 1129 transitions. [2018-11-10 09:54:41,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:41,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 09:54:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:41,084 INFO L225 Difference]: With dead ends: 798 [2018-11-10 09:54:41,084 INFO L226 Difference]: Without dead ends: 676 [2018-11-10 09:54:41,086 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-11-10 09:54:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-11-10 09:54:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 656. [2018-11-10 09:54:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-10 09:54:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 936 transitions. [2018-11-10 09:54:41,117 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 936 transitions. Word has length 25 [2018-11-10 09:54:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:41,118 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 936 transitions. [2018-11-10 09:54:41,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 936 transitions. [2018-11-10 09:54:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 09:54:41,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:41,119 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:41,120 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:41,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:41,120 INFO L82 PathProgramCache]: Analyzing trace with hash 621330444, now seen corresponding path program 1 times [2018-11-10 09:54:41,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:41,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:41,121 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:41,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:41,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:41,174 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:41,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:41,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:41,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:41,175 INFO L87 Difference]: Start difference. First operand 656 states and 936 transitions. Second operand 3 states. [2018-11-10 09:54:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:41,220 INFO L93 Difference]: Finished difference Result 1005 states and 1391 transitions. [2018-11-10 09:54:41,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:41,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 09:54:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:41,224 INFO L225 Difference]: With dead ends: 1005 [2018-11-10 09:54:41,224 INFO L226 Difference]: Without dead ends: 827 [2018-11-10 09:54:41,225 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-11-10 09:54:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-11-10 09:54:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 773. [2018-11-10 09:54:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-11-10 09:54:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1098 transitions. [2018-11-10 09:54:41,258 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1098 transitions. Word has length 30 [2018-11-10 09:54:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:41,259 INFO L481 AbstractCegarLoop]: Abstraction has 773 states and 1098 transitions. [2018-11-10 09:54:41,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1098 transitions. [2018-11-10 09:54:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 09:54:41,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:41,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:41,261 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:41,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:41,261 INFO L82 PathProgramCache]: Analyzing trace with hash 472217655, now seen corresponding path program 1 times [2018-11-10 09:54:41,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:41,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:41,262 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:41,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-11-10 09:54:41,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:41,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:41,306 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:41,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:41,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:41,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:41,307 INFO L87 Difference]: Start difference. First operand 773 states and 1098 transitions. Second operand 3 states. [2018-11-10 09:54:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:41,440 INFO L93 Difference]: Finished difference Result 1442 states and 2113 transitions. [2018-11-10 09:54:41,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:41,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 09:54:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:41,444 INFO L225 Difference]: With dead ends: 1442 [2018-11-10 09:54:41,444 INFO L226 Difference]: Without dead ends: 1172 [2018-11-10 09:54:41,445 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-11-10 09:54:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-11-10 09:54:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 909. [2018-11-10 09:54:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2018-11-10 09:54:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1334 transitions. [2018-11-10 09:54:41,478 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1334 transitions. Word has length 31 [2018-11-10 09:54:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:41,478 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 1334 transitions. [2018-11-10 09:54:41,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1334 transitions. [2018-11-10 09:54:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 09:54:41,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:41,480 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:41,480 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:41,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1515451823, now seen corresponding path program 1 times [2018-11-10 09:54:41,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:41,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:41,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:41,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:41,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:41,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:41,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:41,546 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:41,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:41,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:41,547 INFO L87 Difference]: Start difference. First operand 909 states and 1334 transitions. Second operand 5 states. [2018-11-10 09:54:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:42,022 INFO L93 Difference]: Finished difference Result 1582 states and 2329 transitions. [2018-11-10 09:54:42,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 09:54:42,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-10 09:54:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:42,026 INFO L225 Difference]: With dead ends: 1582 [2018-11-10 09:54:42,026 INFO L226 Difference]: Without dead ends: 998 [2018-11-10 09:54:42,027 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-11-10 09:54:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-11-10 09:54:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 897. [2018-11-10 09:54:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-11-10 09:54:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1310 transitions. [2018-11-10 09:54:42,055 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1310 transitions. Word has length 32 [2018-11-10 09:54:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:42,056 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 1310 transitions. [2018-11-10 09:54:42,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1310 transitions. [2018-11-10 09:54:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 09:54:42,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:42,058 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:42,058 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:42,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:42,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2146588537, now seen corresponding path program 1 times [2018-11-10 09:54:42,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:42,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:42,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:42,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:42,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:42,104 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:42,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:42,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:42,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:42,104 INFO L87 Difference]: Start difference. First operand 897 states and 1310 transitions. Second operand 3 states. [2018-11-10 09:54:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:42,154 INFO L93 Difference]: Finished difference Result 900 states and 1312 transitions. [2018-11-10 09:54:42,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:42,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 09:54:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:42,157 INFO L225 Difference]: With dead ends: 900 [2018-11-10 09:54:42,157 INFO L226 Difference]: Without dead ends: 896 [2018-11-10 09:54:42,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-11-10 09:54:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2018-11-10 09:54:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-11-10 09:54:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1307 transitions. [2018-11-10 09:54:42,182 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1307 transitions. Word has length 36 [2018-11-10 09:54:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:42,182 INFO L481 AbstractCegarLoop]: Abstraction has 896 states and 1307 transitions. [2018-11-10 09:54:42,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1307 transitions. [2018-11-10 09:54:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 09:54:42,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:42,184 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:42,184 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:42,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1811578744, now seen corresponding path program 1 times [2018-11-10 09:54:42,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:42,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:42,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:42,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:42,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:42,214 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:42,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:42,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:42,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:42,215 INFO L87 Difference]: Start difference. First operand 896 states and 1307 transitions. Second operand 3 states. [2018-11-10 09:54:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:42,264 INFO L93 Difference]: Finished difference Result 1292 states and 1836 transitions. [2018-11-10 09:54:42,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:42,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-10 09:54:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:42,267 INFO L225 Difference]: With dead ends: 1292 [2018-11-10 09:54:42,267 INFO L226 Difference]: Without dead ends: 1027 [2018-11-10 09:54:42,268 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-11-10 09:54:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-11-10 09:54:42,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 882. [2018-11-10 09:54:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-11-10 09:54:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1249 transitions. [2018-11-10 09:54:42,294 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1249 transitions. Word has length 39 [2018-11-10 09:54:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:42,295 INFO L481 AbstractCegarLoop]: Abstraction has 882 states and 1249 transitions. [2018-11-10 09:54:42,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1249 transitions. [2018-11-10 09:54:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 09:54:42,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:42,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:42,296 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:42,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:42,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1349629560, now seen corresponding path program 1 times [2018-11-10 09:54:42,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:42,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:42,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,297 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:42,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:42,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:42,341 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:42,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:42,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:42,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:42,341 INFO L87 Difference]: Start difference. First operand 882 states and 1249 transitions. Second operand 3 states. [2018-11-10 09:54:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:42,387 INFO L93 Difference]: Finished difference Result 984 states and 1377 transitions. [2018-11-10 09:54:42,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:42,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-10 09:54:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:42,390 INFO L225 Difference]: With dead ends: 984 [2018-11-10 09:54:42,390 INFO L226 Difference]: Without dead ends: 964 [2018-11-10 09:54:42,391 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-11-10 09:54:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-11-10 09:54:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 908. [2018-11-10 09:54:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-11-10 09:54:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1284 transitions. [2018-11-10 09:54:42,424 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1284 transitions. Word has length 40 [2018-11-10 09:54:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:42,425 INFO L481 AbstractCegarLoop]: Abstraction has 908 states and 1284 transitions. [2018-11-10 09:54:42,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1284 transitions. [2018-11-10 09:54:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:54:42,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:42,428 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:42,428 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:42,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 291360619, now seen corresponding path program 1 times [2018-11-10 09:54:42,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:42,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:42,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:42,495 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:42,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:42,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:42,496 INFO L87 Difference]: Start difference. First operand 908 states and 1284 transitions. Second operand 3 states. [2018-11-10 09:54:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:42,556 INFO L93 Difference]: Finished difference Result 1187 states and 1663 transitions. [2018-11-10 09:54:42,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:42,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-10 09:54:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:42,560 INFO L225 Difference]: With dead ends: 1187 [2018-11-10 09:54:42,560 INFO L226 Difference]: Without dead ends: 941 [2018-11-10 09:54:42,561 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-11-10 09:54:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2018-11-10 09:54:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 908. [2018-11-10 09:54:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-11-10 09:54:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1283 transitions. [2018-11-10 09:54:42,605 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1283 transitions. Word has length 46 [2018-11-10 09:54:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:42,606 INFO L481 AbstractCegarLoop]: Abstraction has 908 states and 1283 transitions. [2018-11-10 09:54:42,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1283 transitions. [2018-11-10 09:54:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 09:54:42,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:42,608 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:42,608 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:42,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:42,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1783887188, now seen corresponding path program 1 times [2018-11-10 09:54:42,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:42,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:42,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,609 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:42,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:42,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:54:42,645 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:42,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:54:42,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:54:42,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:54:42,645 INFO L87 Difference]: Start difference. First operand 908 states and 1283 transitions. Second operand 4 states. [2018-11-10 09:54:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:42,915 INFO L93 Difference]: Finished difference Result 1030 states and 1429 transitions. [2018-11-10 09:54:42,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:54:42,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-10 09:54:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:42,920 INFO L225 Difference]: With dead ends: 1030 [2018-11-10 09:54:42,920 INFO L226 Difference]: Without dead ends: 797 [2018-11-10 09:54:42,921 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-11-10 09:54:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-11-10 09:54:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 763. [2018-11-10 09:54:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-10 09:54:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1072 transitions. [2018-11-10 09:54:42,954 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1072 transitions. Word has length 47 [2018-11-10 09:54:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:42,954 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 1072 transitions. [2018-11-10 09:54:42,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:54:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1072 transitions. [2018-11-10 09:54:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 09:54:42,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:42,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:42,956 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:42,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:42,956 INFO L82 PathProgramCache]: Analyzing trace with hash -992605317, now seen corresponding path program 1 times [2018-11-10 09:54:42,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:42,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:42,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:42,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:42,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:42,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:42,992 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:42,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:42,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:42,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:42,992 INFO L87 Difference]: Start difference. First operand 763 states and 1072 transitions. Second operand 3 states. [2018-11-10 09:54:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:43,037 INFO L93 Difference]: Finished difference Result 883 states and 1220 transitions. [2018-11-10 09:54:43,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:43,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-10 09:54:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:43,041 INFO L225 Difference]: With dead ends: 883 [2018-11-10 09:54:43,041 INFO L226 Difference]: Without dead ends: 787 [2018-11-10 09:54:43,042 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-11-10 09:54:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-10 09:54:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 762. [2018-11-10 09:54:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-11-10 09:54:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1067 transitions. [2018-11-10 09:54:43,077 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1067 transitions. Word has length 47 [2018-11-10 09:54:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:43,077 INFO L481 AbstractCegarLoop]: Abstraction has 762 states and 1067 transitions. [2018-11-10 09:54:43,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1067 transitions. [2018-11-10 09:54:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 09:54:43,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:43,079 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:43,079 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:43,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1733809897, now seen corresponding path program 1 times [2018-11-10 09:54:43,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:43,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:43,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:43,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:43,080 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:43,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:43,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:43,116 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:43,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:43,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:43,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:43,117 INFO L87 Difference]: Start difference. First operand 762 states and 1067 transitions. Second operand 3 states. [2018-11-10 09:54:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:43,210 INFO L93 Difference]: Finished difference Result 963 states and 1332 transitions. [2018-11-10 09:54:43,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:43,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 09:54:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:43,215 INFO L225 Difference]: With dead ends: 963 [2018-11-10 09:54:43,215 INFO L226 Difference]: Without dead ends: 949 [2018-11-10 09:54:43,215 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-11-10 09:54:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-11-10 09:54:43,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 841. [2018-11-10 09:54:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-11-10 09:54:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1159 transitions. [2018-11-10 09:54:43,258 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1159 transitions. Word has length 48 [2018-11-10 09:54:43,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:43,258 INFO L481 AbstractCegarLoop]: Abstraction has 841 states and 1159 transitions. [2018-11-10 09:54:43,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1159 transitions. [2018-11-10 09:54:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 09:54:43,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:43,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-11-10 09:54:43,260 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:43,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:43,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1764634278, now seen corresponding path program 1 times [2018-11-10 09:54:43,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:43,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:43,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:43,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:43,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:43,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:43,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 09:54:43,324 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:43,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 09:54:43,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 09:54:43,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:54:43,324 INFO L87 Difference]: Start difference. First operand 841 states and 1159 transitions. Second operand 8 states. [2018-11-10 09:54:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:43,466 INFO L93 Difference]: Finished difference Result 867 states and 1193 transitions. [2018-11-10 09:54:43,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 09:54:43,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-10 09:54:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:43,470 INFO L225 Difference]: With dead ends: 867 [2018-11-10 09:54:43,470 INFO L226 Difference]: Without dead ends: 863 [2018-11-10 09:54:43,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:54:43,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-11-10 09:54:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 860. [2018-11-10 09:54:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-11-10 09:54:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1186 transitions. [2018-11-10 09:54:43,516 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1186 transitions. Word has length 49 [2018-11-10 09:54:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:43,517 INFO L481 AbstractCegarLoop]: Abstraction has 860 states and 1186 transitions. [2018-11-10 09:54:43,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 09:54:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1186 transitions. [2018-11-10 09:54:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 09:54:43,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:43,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] [2018-11-10 09:54:43,520 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:43,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1764911108, now seen corresponding path program 1 times [2018-11-10 09:54:43,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:43,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:43,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:43,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:43,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 09:54:43,569 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:43,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 09:54:43,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 09:54:43,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:54:43,570 INFO L87 Difference]: Start difference. First operand 860 states and 1186 transitions. Second operand 8 states. [2018-11-10 09:54:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:43,666 INFO L93 Difference]: Finished difference Result 902 states and 1238 transitions. [2018-11-10 09:54:43,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 09:54:43,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-10 09:54:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:43,670 INFO L225 Difference]: With dead ends: 902 [2018-11-10 09:54:43,670 INFO L226 Difference]: Without dead ends: 881 [2018-11-10 09:54:43,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:54:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-11-10 09:54:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 880. [2018-11-10 09:54:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-10 09:54:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1210 transitions. [2018-11-10 09:54:43,723 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1210 transitions. Word has length 49 [2018-11-10 09:54:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:43,723 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 1210 transitions. [2018-11-10 09:54:43,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 09:54:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1210 transitions. [2018-11-10 09:54:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 09:54:43,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:43,726 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:43,726 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:43,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:43,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1085825170, now seen corresponding path program 1 times [2018-11-10 09:54:43,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:43,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:43,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:43,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:43,728 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:43,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:43,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:54:43,760 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:43,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:54:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:54:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:54:43,761 INFO L87 Difference]: Start difference. First operand 880 states and 1210 transitions. Second operand 4 states. [2018-11-10 09:54:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:43,823 INFO L93 Difference]: Finished difference Result 905 states and 1235 transitions. [2018-11-10 09:54:43,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:54:43,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-10 09:54:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:43,828 INFO L225 Difference]: With dead ends: 905 [2018-11-10 09:54:43,828 INFO L226 Difference]: Without dead ends: 883 [2018-11-10 09:54:43,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-11-10 09:54:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2018-11-10 09:54:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-10 09:54:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1209 transitions. [2018-11-10 09:54:43,881 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1209 transitions. Word has length 50 [2018-11-10 09:54:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:43,881 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 1209 transitions. [2018-11-10 09:54:43,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:54:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1209 transitions. [2018-11-10 09:54:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 09:54:43,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:43,884 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:43,884 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:43,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:43,884 INFO L82 PathProgramCache]: Analyzing trace with hash -908319536, now seen corresponding path program 1 times [2018-11-10 09:54:43,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:43,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:43,885 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:43,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:43,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 09:54:43,971 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:43,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 09:54:43,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:54:43,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:54:43,972 INFO L87 Difference]: Start difference. First operand 880 states and 1209 transitions. Second operand 7 states. [2018-11-10 09:54:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:44,787 INFO L93 Difference]: Finished difference Result 1092 states and 1543 transitions. [2018-11-10 09:54:44,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 09:54:44,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-10 09:54:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:44,792 INFO L225 Difference]: With dead ends: 1092 [2018-11-10 09:54:44,793 INFO L226 Difference]: Without dead ends: 1001 [2018-11-10 09:54:44,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-10 09:54:44,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2018-11-10 09:54:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 859. [2018-11-10 09:54:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2018-11-10 09:54:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1172 transitions. [2018-11-10 09:54:44,851 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1172 transitions. Word has length 50 [2018-11-10 09:54:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:44,851 INFO L481 AbstractCegarLoop]: Abstraction has 859 states and 1172 transitions. [2018-11-10 09:54:44,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 09:54:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1172 transitions. [2018-11-10 09:54:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 09:54:44,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:44,853 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:44,854 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:44,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash -761626734, now seen corresponding path program 1 times [2018-11-10 09:54:44,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:44,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:44,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:44,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:44,855 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:44,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:44,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:44,882 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:44,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:44,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:44,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:44,883 INFO L87 Difference]: Start difference. First operand 859 states and 1172 transitions. Second operand 3 states. [2018-11-10 09:54:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:44,980 INFO L93 Difference]: Finished difference Result 1043 states and 1413 transitions. [2018-11-10 09:54:44,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:44,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-10 09:54:44,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:44,985 INFO L225 Difference]: With dead ends: 1043 [2018-11-10 09:54:44,985 INFO L226 Difference]: Without dead ends: 1003 [2018-11-10 09:54:44,985 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-11-10 09:54:44,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-10 09:54:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 893. [2018-11-10 09:54:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-11-10 09:54:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1204 transitions. [2018-11-10 09:54:45,039 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1204 transitions. Word has length 50 [2018-11-10 09:54:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:45,039 INFO L481 AbstractCegarLoop]: Abstraction has 893 states and 1204 transitions. [2018-11-10 09:54:45,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1204 transitions. [2018-11-10 09:54:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 09:54:45,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:45,041 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:45,041 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:45,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:45,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1782043445, now seen corresponding path program 1 times [2018-11-10 09:54:45,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:45,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:45,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:45,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:45,043 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:45,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:45,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 09:54:45,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:45,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 09:54:45,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 09:54:45,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:54:45,114 INFO L87 Difference]: Start difference. First operand 893 states and 1204 transitions. Second operand 9 states. [2018-11-10 09:54:46,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:46,331 INFO L93 Difference]: Finished difference Result 1215 states and 1676 transitions. [2018-11-10 09:54:46,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 09:54:46,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-10 09:54:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:46,334 INFO L225 Difference]: With dead ends: 1215 [2018-11-10 09:54:46,334 INFO L226 Difference]: Without dead ends: 1146 [2018-11-10 09:54:46,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-10 09:54:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2018-11-10 09:54:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 906. [2018-11-10 09:54:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-11-10 09:54:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1229 transitions. [2018-11-10 09:54:46,370 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1229 transitions. Word has length 50 [2018-11-10 09:54:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:46,371 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1229 transitions. [2018-11-10 09:54:46,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 09:54:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1229 transitions. [2018-11-10 09:54:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 09:54:46,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:46,372 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:46,372 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:46,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:46,373 INFO L82 PathProgramCache]: Analyzing trace with hash 417807011, now seen corresponding path program 1 times [2018-11-10 09:54:46,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:46,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:46,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:46,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:46,374 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:46,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:46,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:46,399 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:46,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:46,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:46,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:46,399 INFO L87 Difference]: Start difference. First operand 906 states and 1229 transitions. Second operand 3 states. [2018-11-10 09:54:46,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:46,458 INFO L93 Difference]: Finished difference Result 934 states and 1261 transitions. [2018-11-10 09:54:46,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:46,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-10 09:54:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:46,461 INFO L225 Difference]: With dead ends: 934 [2018-11-10 09:54:46,461 INFO L226 Difference]: Without dead ends: 929 [2018-11-10 09:54:46,462 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-11-10 09:54:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-11-10 09:54:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 923. [2018-11-10 09:54:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-10 09:54:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1250 transitions. [2018-11-10 09:54:46,496 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1250 transitions. Word has length 52 [2018-11-10 09:54:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:46,496 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1250 transitions. [2018-11-10 09:54:46,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1250 transitions. [2018-11-10 09:54:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 09:54:46,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:46,498 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:46,498 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:46,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1677129215, now seen corresponding path program 1 times [2018-11-10 09:54:46,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:46,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:46,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:46,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:46,499 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:46,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:46,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:46,522 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:46,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:46,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:46,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:46,523 INFO L87 Difference]: Start difference. First operand 923 states and 1250 transitions. Second operand 3 states. [2018-11-10 09:54:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:46,582 INFO L93 Difference]: Finished difference Result 1142 states and 1544 transitions. [2018-11-10 09:54:46,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:46,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-10 09:54:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:46,585 INFO L225 Difference]: With dead ends: 1142 [2018-11-10 09:54:46,585 INFO L226 Difference]: Without dead ends: 892 [2018-11-10 09:54:46,586 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-11-10 09:54:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2018-11-10 09:54:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2018-11-10 09:54:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-10 09:54:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1210 transitions. [2018-11-10 09:54:46,618 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1210 transitions. Word has length 54 [2018-11-10 09:54:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:46,618 INFO L481 AbstractCegarLoop]: Abstraction has 892 states and 1210 transitions. [2018-11-10 09:54:46,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1210 transitions. [2018-11-10 09:54:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 09:54:46,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:46,620 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:46,620 INFO L424 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:46,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash 510703600, now seen corresponding path program 1 times [2018-11-10 09:54:46,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:46,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:46,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:46,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:46,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:46,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:46,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:46,656 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:46,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:46,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:46,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:46,656 INFO L87 Difference]: Start difference. First operand 892 states and 1210 transitions. Second operand 5 states. [2018-11-10 09:54:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:46,957 INFO L93 Difference]: Finished difference Result 904 states and 1220 transitions. [2018-11-10 09:54:46,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:54:46,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-10 09:54:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:46,960 INFO L225 Difference]: With dead ends: 904 [2018-11-10 09:54:46,960 INFO L226 Difference]: Without dead ends: 898 [2018-11-10 09:54:46,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:54:46,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-11-10 09:54:46,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 892. [2018-11-10 09:54:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-10 09:54:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1209 transitions. [2018-11-10 09:54:46,999 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1209 transitions. Word has length 53 [2018-11-10 09:54:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:47,000 INFO L481 AbstractCegarLoop]: Abstraction has 892 states and 1209 transitions. [2018-11-10 09:54:47,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1209 transitions. [2018-11-10 09:54:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 09:54:47,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:47,002 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:47,002 INFO L424 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:47,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:47,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1022255578, now seen corresponding path program 1 times [2018-11-10 09:54:47,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:47,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:47,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:47,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:47,003 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:47,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:47,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:47,049 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:47,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:47,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:47,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:47,049 INFO L87 Difference]: Start difference. First operand 892 states and 1209 transitions. Second operand 5 states. [2018-11-10 09:54:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:47,373 INFO L93 Difference]: Finished difference Result 907 states and 1224 transitions. [2018-11-10 09:54:47,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:54:47,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-10 09:54:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:47,376 INFO L225 Difference]: With dead ends: 907 [2018-11-10 09:54:47,377 INFO L226 Difference]: Without dead ends: 871 [2018-11-10 09:54:47,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:54:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-11-10 09:54:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 865. [2018-11-10 09:54:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-10 09:54:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1179 transitions. [2018-11-10 09:54:47,418 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1179 transitions. Word has length 52 [2018-11-10 09:54:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:47,419 INFO L481 AbstractCegarLoop]: Abstraction has 865 states and 1179 transitions. [2018-11-10 09:54:47,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:47,419 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1179 transitions. [2018-11-10 09:54:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 09:54:47,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:47,421 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:47,423 INFO L424 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:47,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:47,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1980078936, now seen corresponding path program 1 times [2018-11-10 09:54:47,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:47,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:47,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:47,425 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:47,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:47,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:47,455 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:47,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:47,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:47,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:47,456 INFO L87 Difference]: Start difference. First operand 865 states and 1179 transitions. Second operand 5 states. [2018-11-10 09:54:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:47,766 INFO L93 Difference]: Finished difference Result 875 states and 1187 transitions. [2018-11-10 09:54:47,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:54:47,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-10 09:54:47,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:47,769 INFO L225 Difference]: With dead ends: 875 [2018-11-10 09:54:47,769 INFO L226 Difference]: Without dead ends: 869 [2018-11-10 09:54:47,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:54:47,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-11-10 09:54:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 865. [2018-11-10 09:54:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-10 09:54:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1178 transitions. [2018-11-10 09:54:47,804 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1178 transitions. Word has length 54 [2018-11-10 09:54:47,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:47,804 INFO L481 AbstractCegarLoop]: Abstraction has 865 states and 1178 transitions. [2018-11-10 09:54:47,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1178 transitions. [2018-11-10 09:54:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 09:54:47,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:47,806 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:47,806 INFO L424 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:47,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:47,806 INFO L82 PathProgramCache]: Analyzing trace with hash -940758887, now seen corresponding path program 1 times [2018-11-10 09:54:47,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:47,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:47,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:47,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:47,807 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:47,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:47,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 09:54:47,860 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:47,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 09:54:47,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 09:54:47,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:54:47,861 INFO L87 Difference]: Start difference. First operand 865 states and 1178 transitions. Second operand 9 states. [2018-11-10 09:54:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:47,979 INFO L93 Difference]: Finished difference Result 892 states and 1208 transitions. [2018-11-10 09:54:47,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 09:54:47,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-10 09:54:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:47,982 INFO L225 Difference]: With dead ends: 892 [2018-11-10 09:54:47,982 INFO L226 Difference]: Without dead ends: 856 [2018-11-10 09:54:47,982 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-11-10 09:54:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-10 09:54:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-10 09:54:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-10 09:54:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1154 transitions. [2018-11-10 09:54:48,015 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1154 transitions. Word has length 55 [2018-11-10 09:54:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:48,015 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1154 transitions. [2018-11-10 09:54:48,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 09:54:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1154 transitions. [2018-11-10 09:54:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 09:54:48,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:48,017 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:48,018 INFO L424 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:48,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:48,018 INFO L82 PathProgramCache]: Analyzing trace with hash -548453257, now seen corresponding path program 1 times [2018-11-10 09:54:48,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:48,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:48,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:48,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:48,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:48,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:48,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 09:54:48,096 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:48,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 09:54:48,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:54:48,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:54:48,097 INFO L87 Difference]: Start difference. First operand 856 states and 1154 transitions. Second operand 10 states. [2018-11-10 09:54:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:48,232 INFO L93 Difference]: Finished difference Result 872 states and 1171 transitions. [2018-11-10 09:54:48,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 09:54:48,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-10 09:54:48,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:48,234 INFO L225 Difference]: With dead ends: 872 [2018-11-10 09:54:48,234 INFO L226 Difference]: Without dead ends: 854 [2018-11-10 09:54:48,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:54:48,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-10 09:54:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2018-11-10 09:54:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-11-10 09:54:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1150 transitions. [2018-11-10 09:54:48,268 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1150 transitions. Word has length 55 [2018-11-10 09:54:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:48,269 INFO L481 AbstractCegarLoop]: Abstraction has 854 states and 1150 transitions. [2018-11-10 09:54:48,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 09:54:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1150 transitions. [2018-11-10 09:54:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 09:54:48,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:48,270 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:48,271 INFO L424 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:48,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash -769794208, now seen corresponding path program 1 times [2018-11-10 09:54:48,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:48,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:48,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:48,272 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:48,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:48,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 09:54:48,354 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:48,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 09:54:48,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:54:48,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:54:48,355 INFO L87 Difference]: Start difference. First operand 854 states and 1150 transitions. Second operand 10 states. [2018-11-10 09:54:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:48,540 INFO L93 Difference]: Finished difference Result 867 states and 1164 transitions. [2018-11-10 09:54:48,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 09:54:48,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-10 09:54:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:48,544 INFO L225 Difference]: With dead ends: 867 [2018-11-10 09:54:48,544 INFO L226 Difference]: Without dead ends: 849 [2018-11-10 09:54:48,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:54:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-11-10 09:54:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2018-11-10 09:54:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-11-10 09:54:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1143 transitions. [2018-11-10 09:54:48,617 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1143 transitions. Word has length 56 [2018-11-10 09:54:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:48,617 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 1143 transitions. [2018-11-10 09:54:48,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 09:54:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1143 transitions. [2018-11-10 09:54:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 09:54:48,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:48,620 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:48,620 INFO L424 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:48,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:48,620 INFO L82 PathProgramCache]: Analyzing trace with hash 528467351, now seen corresponding path program 1 times [2018-11-10 09:54:48,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:48,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:48,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:48,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:48,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:48,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:48,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:48,681 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:48,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:48,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:48,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:48,682 INFO L87 Difference]: Start difference. First operand 849 states and 1143 transitions. Second operand 3 states. [2018-11-10 09:54:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:48,757 INFO L93 Difference]: Finished difference Result 1105 states and 1480 transitions. [2018-11-10 09:54:48,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:48,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-10 09:54:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:48,762 INFO L225 Difference]: With dead ends: 1105 [2018-11-10 09:54:48,762 INFO L226 Difference]: Without dead ends: 940 [2018-11-10 09:54:48,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-11-10 09:54:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 909. [2018-11-10 09:54:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2018-11-10 09:54:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1220 transitions. [2018-11-10 09:54:48,822 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1220 transitions. Word has length 74 [2018-11-10 09:54:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:48,822 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 1220 transitions. [2018-11-10 09:54:48,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1220 transitions. [2018-11-10 09:54:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 09:54:48,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:48,824 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:48,824 INFO L424 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:48,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:48,824 INFO L82 PathProgramCache]: Analyzing trace with hash 684353054, now seen corresponding path program 1 times [2018-11-10 09:54:48,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:48,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:48,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:48,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:48,825 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:48,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:48,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:48,879 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:48,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:48,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:48,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:48,880 INFO L87 Difference]: Start difference. First operand 909 states and 1220 transitions. Second operand 5 states. [2018-11-10 09:54:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:49,070 INFO L93 Difference]: Finished difference Result 944 states and 1262 transitions. [2018-11-10 09:54:49,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:54:49,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-10 09:54:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:49,074 INFO L225 Difference]: With dead ends: 944 [2018-11-10 09:54:49,074 INFO L226 Difference]: Without dead ends: 916 [2018-11-10 09:54:49,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:54:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-11-10 09:54:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 914. [2018-11-10 09:54:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-11-10 09:54:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1229 transitions. [2018-11-10 09:54:49,137 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1229 transitions. Word has length 62 [2018-11-10 09:54:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:49,137 INFO L481 AbstractCegarLoop]: Abstraction has 914 states and 1229 transitions. [2018-11-10 09:54:49,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1229 transitions. [2018-11-10 09:54:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 09:54:49,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:49,139 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:49,139 INFO L424 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:49,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:49,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1144916251, now seen corresponding path program 1 times [2018-11-10 09:54:49,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:49,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:49,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:49,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:49,141 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:49,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:49,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 09:54:49,264 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:49,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 09:54:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 09:54:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 09:54:49,265 INFO L87 Difference]: Start difference. First operand 914 states and 1229 transitions. Second operand 12 states. [2018-11-10 09:54:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:49,525 INFO L93 Difference]: Finished difference Result 940 states and 1258 transitions. [2018-11-10 09:54:49,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 09:54:49,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-10 09:54:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:49,528 INFO L225 Difference]: With dead ends: 940 [2018-11-10 09:54:49,528 INFO L226 Difference]: Without dead ends: 915 [2018-11-10 09:54:49,529 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-11-10 09:54:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-11-10 09:54:49,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2018-11-10 09:54:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2018-11-10 09:54:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1218 transitions. [2018-11-10 09:54:49,590 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1218 transitions. Word has length 59 [2018-11-10 09:54:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:49,590 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1218 transitions. [2018-11-10 09:54:49,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 09:54:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1218 transitions. [2018-11-10 09:54:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 09:54:49,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:49,592 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:49,592 INFO L424 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:49,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1309677282, now seen corresponding path program 1 times [2018-11-10 09:54:49,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:49,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:49,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:49,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:49,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:49,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 09:54:49,746 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:49,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 09:54:49,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:54:49,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:54:49,747 INFO L87 Difference]: Start difference. First operand 913 states and 1218 transitions. Second operand 11 states. [2018-11-10 09:54:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:50,029 INFO L93 Difference]: Finished difference Result 930 states and 1236 transitions. [2018-11-10 09:54:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 09:54:50,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-10 09:54:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:50,032 INFO L225 Difference]: With dead ends: 930 [2018-11-10 09:54:50,032 INFO L226 Difference]: Without dead ends: 910 [2018-11-10 09:54:50,033 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-11-10 09:54:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-11-10 09:54:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2018-11-10 09:54:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2018-11-10 09:54:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1213 transitions. [2018-11-10 09:54:50,092 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1213 transitions. Word has length 58 [2018-11-10 09:54:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:50,092 INFO L481 AbstractCegarLoop]: Abstraction has 910 states and 1213 transitions. [2018-11-10 09:54:50,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 09:54:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1213 transitions. [2018-11-10 09:54:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 09:54:50,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:50,095 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:50,095 INFO L424 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:50,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:50,095 INFO L82 PathProgramCache]: Analyzing trace with hash -719999499, now seen corresponding path program 1 times [2018-11-10 09:54:50,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:50,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:50,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:50,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:50,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:50,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:50,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 09:54:50,179 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:50,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 09:54:50,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:54:50,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:54:50,179 INFO L87 Difference]: Start difference. First operand 910 states and 1213 transitions. Second operand 10 states. [2018-11-10 09:54:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:50,437 INFO L93 Difference]: Finished difference Result 977 states and 1288 transitions. [2018-11-10 09:54:50,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 09:54:50,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-11-10 09:54:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:50,440 INFO L225 Difference]: With dead ends: 977 [2018-11-10 09:54:50,440 INFO L226 Difference]: Without dead ends: 868 [2018-11-10 09:54:50,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:54:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-11-10 09:54:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 865. [2018-11-10 09:54:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-10 09:54:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1132 transitions. [2018-11-10 09:54:50,499 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1132 transitions. Word has length 59 [2018-11-10 09:54:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:50,499 INFO L481 AbstractCegarLoop]: Abstraction has 865 states and 1132 transitions. [2018-11-10 09:54:50,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 09:54:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1132 transitions. [2018-11-10 09:54:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 09:54:50,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:50,501 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:50,501 INFO L424 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:50,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash -98888530, now seen corresponding path program 1 times [2018-11-10 09:54:50,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:50,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:50,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:50,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:50,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:50,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:50,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:54:50,550 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:50,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:54:50,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:54:50,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:54:50,550 INFO L87 Difference]: Start difference. First operand 865 states and 1132 transitions. Second operand 4 states. [2018-11-10 09:54:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:50,695 INFO L93 Difference]: Finished difference Result 1027 states and 1356 transitions. [2018-11-10 09:54:50,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:54:50,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-10 09:54:50,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:50,698 INFO L225 Difference]: With dead ends: 1027 [2018-11-10 09:54:50,698 INFO L226 Difference]: Without dead ends: 914 [2018-11-10 09:54:50,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-11-10 09:54:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 872. [2018-11-10 09:54:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-10 09:54:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1147 transitions. [2018-11-10 09:54:50,744 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1147 transitions. Word has length 60 [2018-11-10 09:54:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:50,744 INFO L481 AbstractCegarLoop]: Abstraction has 872 states and 1147 transitions. [2018-11-10 09:54:50,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:54:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1147 transitions. [2018-11-10 09:54:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 09:54:50,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:50,746 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:50,747 INFO L424 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:50,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:50,747 INFO L82 PathProgramCache]: Analyzing trace with hash 175871084, now seen corresponding path program 1 times [2018-11-10 09:54:50,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:50,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:50,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:50,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:50,748 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:50,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:50,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 09:54:50,819 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:50,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 09:54:50,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:54:50,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:54:50,820 INFO L87 Difference]: Start difference. First operand 872 states and 1147 transitions. Second operand 11 states. [2018-11-10 09:54:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:50,921 INFO L93 Difference]: Finished difference Result 941 states and 1238 transitions. [2018-11-10 09:54:50,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 09:54:50,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-10 09:54:50,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:50,924 INFO L225 Difference]: With dead ends: 941 [2018-11-10 09:54:50,924 INFO L226 Difference]: Without dead ends: 886 [2018-11-10 09:54:50,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:54:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-11-10 09:54:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 876. [2018-11-10 09:54:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-11-10 09:54:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1164 transitions. [2018-11-10 09:54:50,957 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1164 transitions. Word has length 60 [2018-11-10 09:54:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:50,958 INFO L481 AbstractCegarLoop]: Abstraction has 876 states and 1164 transitions. [2018-11-10 09:54:50,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 09:54:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1164 transitions. [2018-11-10 09:54:50,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:54:50,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:50,960 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:50,960 INFO L424 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:50,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:50,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1149940409, now seen corresponding path program 1 times [2018-11-10 09:54:50,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:50,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:50,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:50,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:50,961 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:51,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:51,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 09:54:51,041 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:51,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 09:54:51,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 09:54:51,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 09:54:51,041 INFO L87 Difference]: Start difference. First operand 876 states and 1164 transitions. Second operand 12 states. [2018-11-10 09:54:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:51,190 INFO L93 Difference]: Finished difference Result 898 states and 1187 transitions. [2018-11-10 09:54:51,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 09:54:51,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-10 09:54:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:51,192 INFO L225 Difference]: With dead ends: 898 [2018-11-10 09:54:51,192 INFO L226 Difference]: Without dead ends: 874 [2018-11-10 09:54:51,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-10 09:54:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-10 09:54:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2018-11-10 09:54:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-10 09:54:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1159 transitions. [2018-11-10 09:54:51,225 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1159 transitions. Word has length 63 [2018-11-10 09:54:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:51,225 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1159 transitions. [2018-11-10 09:54:51,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 09:54:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1159 transitions. [2018-11-10 09:54:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 09:54:51,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:51,227 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:51,228 INFO L424 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:51,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:51,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1459359901, now seen corresponding path program 1 times [2018-11-10 09:54:51,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:51,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:51,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:51,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:51,229 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:51,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:51,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 09:54:51,302 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:51,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 09:54:51,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 09:54:51,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 09:54:51,303 INFO L87 Difference]: Start difference. First operand 874 states and 1159 transitions. Second operand 12 states. [2018-11-10 09:54:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:51,447 INFO L93 Difference]: Finished difference Result 898 states and 1184 transitions. [2018-11-10 09:54:51,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 09:54:51,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-10 09:54:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:51,450 INFO L225 Difference]: With dead ends: 898 [2018-11-10 09:54:51,450 INFO L226 Difference]: Without dead ends: 874 [2018-11-10 09:54:51,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-10 09:54:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-10 09:54:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2018-11-10 09:54:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-10 09:54:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1155 transitions. [2018-11-10 09:54:51,484 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1155 transitions. Word has length 66 [2018-11-10 09:54:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:51,484 INFO L481 AbstractCegarLoop]: Abstraction has 872 states and 1155 transitions. [2018-11-10 09:54:51,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 09:54:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1155 transitions. [2018-11-10 09:54:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 09:54:51,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:51,486 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:51,486 INFO L424 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:51,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:51,486 INFO L82 PathProgramCache]: Analyzing trace with hash 158264959, now seen corresponding path program 1 times [2018-11-10 09:54:51,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:51,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:51,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:51,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:51,487 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:51,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-11-10 09:54:51,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:51,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 09:54:51,556 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:51,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 09:54:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 09:54:51,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 09:54:51,557 INFO L87 Difference]: Start difference. First operand 872 states and 1155 transitions. Second operand 12 states. [2018-11-10 09:54:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:51,686 INFO L93 Difference]: Finished difference Result 896 states and 1180 transitions. [2018-11-10 09:54:51,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 09:54:51,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-10 09:54:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:51,688 INFO L225 Difference]: With dead ends: 896 [2018-11-10 09:54:51,688 INFO L226 Difference]: Without dead ends: 872 [2018-11-10 09:54:51,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-10 09:54:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-11-10 09:54:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 870. [2018-11-10 09:54:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-10 09:54:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1151 transitions. [2018-11-10 09:54:51,720 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1151 transitions. Word has length 67 [2018-11-10 09:54:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:51,720 INFO L481 AbstractCegarLoop]: Abstraction has 870 states and 1151 transitions. [2018-11-10 09:54:51,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 09:54:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1151 transitions. [2018-11-10 09:54:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 09:54:51,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:51,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:51,722 INFO L424 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:51,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:51,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1385952928, now seen corresponding path program 1 times [2018-11-10 09:54:51,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:51,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:51,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:51,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:51,723 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:51,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:51,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 09:54:51,789 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:51,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 09:54:51,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 09:54:51,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 09:54:51,790 INFO L87 Difference]: Start difference. First operand 870 states and 1151 transitions. Second operand 12 states. [2018-11-10 09:54:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:51,914 INFO L93 Difference]: Finished difference Result 892 states and 1174 transitions. [2018-11-10 09:54:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 09:54:51,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-10 09:54:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:51,917 INFO L225 Difference]: With dead ends: 892 [2018-11-10 09:54:51,917 INFO L226 Difference]: Without dead ends: 868 [2018-11-10 09:54:51,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-10 09:54:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-11-10 09:54:51,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 863. [2018-11-10 09:54:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-11-10 09:54:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1139 transitions. [2018-11-10 09:54:51,949 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1139 transitions. Word has length 62 [2018-11-10 09:54:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:51,950 INFO L481 AbstractCegarLoop]: Abstraction has 863 states and 1139 transitions. [2018-11-10 09:54:51,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 09:54:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1139 transitions. [2018-11-10 09:54:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 09:54:51,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:51,951 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:51,951 INFO L424 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:51,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash 478731919, now seen corresponding path program 1 times [2018-11-10 09:54:51,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:51,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:51,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:51,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:51,952 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:51,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:51,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:51,971 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:51,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:51,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:51,971 INFO L87 Difference]: Start difference. First operand 863 states and 1139 transitions. Second operand 3 states. [2018-11-10 09:54:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:51,997 INFO L93 Difference]: Finished difference Result 1135 states and 1491 transitions. [2018-11-10 09:54:51,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:51,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-10 09:54:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:52,000 INFO L225 Difference]: With dead ends: 1135 [2018-11-10 09:54:52,000 INFO L226 Difference]: Without dead ends: 791 [2018-11-10 09:54:52,001 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-11-10 09:54:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-11-10 09:54:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 758. [2018-11-10 09:54:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-11-10 09:54:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 968 transitions. [2018-11-10 09:54:52,029 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 968 transitions. Word has length 62 [2018-11-10 09:54:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:52,029 INFO L481 AbstractCegarLoop]: Abstraction has 758 states and 968 transitions. [2018-11-10 09:54:52,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 968 transitions. [2018-11-10 09:54:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:54:52,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:52,030 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:52,030 INFO L424 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:52,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash -48275879, now seen corresponding path program 1 times [2018-11-10 09:54:52,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:52,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:52,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:52,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:52,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 09:54:52,127 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:52,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 09:54:52,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 09:54:52,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:54:52,128 INFO L87 Difference]: Start difference. First operand 758 states and 968 transitions. Second operand 13 states. [2018-11-10 09:54:52,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:52,312 INFO L93 Difference]: Finished difference Result 775 states and 986 transitions. [2018-11-10 09:54:52,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 09:54:52,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-10 09:54:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:52,314 INFO L225 Difference]: With dead ends: 775 [2018-11-10 09:54:52,314 INFO L226 Difference]: Without dead ends: 753 [2018-11-10 09:54:52,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:54:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-11-10 09:54:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2018-11-10 09:54:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-10 09:54:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 961 transitions. [2018-11-10 09:54:52,342 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 961 transitions. Word has length 63 [2018-11-10 09:54:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:52,342 INFO L481 AbstractCegarLoop]: Abstraction has 753 states and 961 transitions. [2018-11-10 09:54:52,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 09:54:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 961 transitions. [2018-11-10 09:54:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 09:54:52,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:52,344 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:52,344 INFO L424 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:52,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:52,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1663625934, now seen corresponding path program 1 times [2018-11-10 09:54:52,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:52,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:52,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,345 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:52,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:52,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 09:54:52,440 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:52,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 09:54:52,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 09:54:52,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:54:52,441 INFO L87 Difference]: Start difference. First operand 753 states and 961 transitions. Second operand 13 states. [2018-11-10 09:54:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:52,617 INFO L93 Difference]: Finished difference Result 770 states and 979 transitions. [2018-11-10 09:54:52,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 09:54:52,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-10 09:54:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:52,619 INFO L225 Difference]: With dead ends: 770 [2018-11-10 09:54:52,619 INFO L226 Difference]: Without dead ends: 745 [2018-11-10 09:54:52,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:54:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-10 09:54:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2018-11-10 09:54:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-11-10 09:54:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 951 transitions. [2018-11-10 09:54:52,648 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 951 transitions. Word has length 62 [2018-11-10 09:54:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:52,648 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 951 transitions. [2018-11-10 09:54:52,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 09:54:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 951 transitions. [2018-11-10 09:54:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 09:54:52,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:52,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:52,649 INFO L424 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:52,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:52,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1192629544, now seen corresponding path program 1 times [2018-11-10 09:54:52,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:52,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:52,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,650 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:52,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:52,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:52,691 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:52,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:52,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:52,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:52,691 INFO L87 Difference]: Start difference. First operand 745 states and 951 transitions. Second operand 3 states. [2018-11-10 09:54:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:52,718 INFO L93 Difference]: Finished difference Result 877 states and 1126 transitions. [2018-11-10 09:54:52,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:52,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-10 09:54:52,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:52,721 INFO L225 Difference]: With dead ends: 877 [2018-11-10 09:54:52,721 INFO L226 Difference]: Without dead ends: 745 [2018-11-10 09:54:52,722 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-11-10 09:54:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-10 09:54:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2018-11-10 09:54:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-11-10 09:54:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 949 transitions. [2018-11-10 09:54:52,749 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 949 transitions. Word has length 66 [2018-11-10 09:54:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:52,750 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 949 transitions. [2018-11-10 09:54:52,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 949 transitions. [2018-11-10 09:54:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 09:54:52,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:52,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, 1, 1, 1] [2018-11-10 09:54:52,751 INFO L424 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:52,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1875964411, now seen corresponding path program 1 times [2018-11-10 09:54:52,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:52,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:52,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:52,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:52,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:52,779 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:52,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:52,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:52,780 INFO L87 Difference]: Start difference. First operand 745 states and 949 transitions. Second operand 5 states. [2018-11-10 09:54:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:52,826 INFO L93 Difference]: Finished difference Result 791 states and 996 transitions. [2018-11-10 09:54:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:54:52,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-10 09:54:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:52,829 INFO L225 Difference]: With dead ends: 791 [2018-11-10 09:54:52,829 INFO L226 Difference]: Without dead ends: 739 [2018-11-10 09:54:52,829 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-11-10 09:54:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-11-10 09:54:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2018-11-10 09:54:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-11-10 09:54:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 939 transitions. [2018-11-10 09:54:52,857 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 939 transitions. Word has length 65 [2018-11-10 09:54:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:52,857 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 939 transitions. [2018-11-10 09:54:52,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 939 transitions. [2018-11-10 09:54:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 09:54:52,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:52,859 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:52,859 INFO L424 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:52,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:52,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1477541838, now seen corresponding path program 1 times [2018-11-10 09:54:52,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:52,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:52,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:52,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:52,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:52,899 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:52,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:52,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:52,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:52,899 INFO L87 Difference]: Start difference. First operand 739 states and 939 transitions. Second operand 5 states. [2018-11-10 09:54:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:52,936 INFO L93 Difference]: Finished difference Result 773 states and 974 transitions. [2018-11-10 09:54:52,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:54:52,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-10 09:54:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:52,939 INFO L225 Difference]: With dead ends: 773 [2018-11-10 09:54:52,939 INFO L226 Difference]: Without dead ends: 734 [2018-11-10 09:54:52,939 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-11-10 09:54:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-11-10 09:54:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-11-10 09:54:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 09:54:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 932 transitions. [2018-11-10 09:54:52,967 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 932 transitions. Word has length 67 [2018-11-10 09:54:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:52,967 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 932 transitions. [2018-11-10 09:54:52,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 932 transitions. [2018-11-10 09:54:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 09:54:52,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:52,969 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:52,969 INFO L424 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:52,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash 800562057, now seen corresponding path program 1 times [2018-11-10 09:54:52,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:52,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:52,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:52,970 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:52,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:52,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:52,996 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:52,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:52,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:52,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:52,997 INFO L87 Difference]: Start difference. First operand 734 states and 932 transitions. Second operand 5 states. [2018-11-10 09:54:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:53,243 INFO L93 Difference]: Finished difference Result 818 states and 1040 transitions. [2018-11-10 09:54:53,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:54:53,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-10 09:54:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:53,246 INFO L225 Difference]: With dead ends: 818 [2018-11-10 09:54:53,246 INFO L226 Difference]: Without dead ends: 809 [2018-11-10 09:54:53,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:54:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-11-10 09:54:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 734. [2018-11-10 09:54:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 09:54:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 930 transitions. [2018-11-10 09:54:53,276 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 930 transitions. Word has length 68 [2018-11-10 09:54:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:53,276 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 930 transitions. [2018-11-10 09:54:53,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 930 transitions. [2018-11-10 09:54:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:54:53,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:53,277 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:53,277 INFO L424 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:53,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:53,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1067040035, now seen corresponding path program 1 times [2018-11-10 09:54:53,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:53,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:53,278 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:53,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:53,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 09:54:53,389 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:53,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 09:54:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 09:54:53,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:54:53,390 INFO L87 Difference]: Start difference. First operand 734 states and 930 transitions. Second operand 13 states. [2018-11-10 09:54:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:53,559 INFO L93 Difference]: Finished difference Result 751 states and 948 transitions. [2018-11-10 09:54:53,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 09:54:53,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-10 09:54:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:53,561 INFO L225 Difference]: With dead ends: 751 [2018-11-10 09:54:53,561 INFO L226 Difference]: Without dead ends: 723 [2018-11-10 09:54:53,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:54:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-11-10 09:54:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2018-11-10 09:54:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-11-10 09:54:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 915 transitions. [2018-11-10 09:54:53,590 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 915 transitions. Word has length 69 [2018-11-10 09:54:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:53,590 INFO L481 AbstractCegarLoop]: Abstraction has 723 states and 915 transitions. [2018-11-10 09:54:53,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 09:54:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 915 transitions. [2018-11-10 09:54:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 09:54:53,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:53,592 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:53,592 INFO L424 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:53,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1534088944, now seen corresponding path program 1 times [2018-11-10 09:54:53,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:53,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:53,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:53,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:53,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:53,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:53,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 09:54:53,653 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:53,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 09:54:53,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:54:53,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:54:53,654 INFO L87 Difference]: Start difference. First operand 723 states and 915 transitions. Second operand 7 states. [2018-11-10 09:54:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:53,731 INFO L93 Difference]: Finished difference Result 769 states and 965 transitions. [2018-11-10 09:54:53,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:54:53,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-10 09:54:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:53,733 INFO L225 Difference]: With dead ends: 769 [2018-11-10 09:54:53,733 INFO L226 Difference]: Without dead ends: 729 [2018-11-10 09:54:53,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:54:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-11-10 09:54:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2018-11-10 09:54:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-10 09:54:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 919 transitions. [2018-11-10 09:54:53,788 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 919 transitions. Word has length 74 [2018-11-10 09:54:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:53,788 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 919 transitions. [2018-11-10 09:54:53,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 09:54:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 919 transitions. [2018-11-10 09:54:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:54:53,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:53,790 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:53,790 INFO L424 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:53,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:53,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1630066308, now seen corresponding path program 1 times [2018-11-10 09:54:53,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:53,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:53,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:53,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:53,791 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:53,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:53,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 09:54:53,882 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:53,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 09:54:53,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 09:54:53,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 09:54:53,883 INFO L87 Difference]: Start difference. First operand 727 states and 919 transitions. Second operand 12 states. [2018-11-10 09:54:54,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:54,000 INFO L93 Difference]: Finished difference Result 750 states and 943 transitions. [2018-11-10 09:54:54,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 09:54:54,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-10 09:54:54,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:54,003 INFO L225 Difference]: With dead ends: 750 [2018-11-10 09:54:54,003 INFO L226 Difference]: Without dead ends: 727 [2018-11-10 09:54:54,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:54:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-11-10 09:54:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2018-11-10 09:54:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-10 09:54:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 918 transitions. [2018-11-10 09:54:54,055 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 918 transitions. Word has length 70 [2018-11-10 09:54:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:54,056 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 918 transitions. [2018-11-10 09:54:54,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 09:54:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 918 transitions. [2018-11-10 09:54:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:54:54,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:54,057 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:54,057 INFO L424 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:54,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:54,058 INFO L82 PathProgramCache]: Analyzing trace with hash -928466434, now seen corresponding path program 1 times [2018-11-10 09:54:54,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:54,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:54,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:54,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:54,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:54,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:54,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 09:54:54,186 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:54,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 09:54:54,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 09:54:54,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:54:54,186 INFO L87 Difference]: Start difference. First operand 727 states and 918 transitions. Second operand 14 states. [2018-11-10 09:54:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:54,402 INFO L93 Difference]: Finished difference Result 751 states and 944 transitions. [2018-11-10 09:54:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 09:54:54,404 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-10 09:54:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:54,405 INFO L225 Difference]: With dead ends: 751 [2018-11-10 09:54:54,406 INFO L226 Difference]: Without dead ends: 723 [2018-11-10 09:54:54,406 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-11-10 09:54:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-11-10 09:54:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2018-11-10 09:54:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-11-10 09:54:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 912 transitions. [2018-11-10 09:54:54,454 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 912 transitions. Word has length 70 [2018-11-10 09:54:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:54,454 INFO L481 AbstractCegarLoop]: Abstraction has 723 states and 912 transitions. [2018-11-10 09:54:54,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 09:54:54,454 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 912 transitions. [2018-11-10 09:54:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:54:54,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:54,456 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:54,456 INFO L424 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:54,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:54,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1425039817, now seen corresponding path program 1 times [2018-11-10 09:54:54,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:54,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:54,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:54,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:54,457 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:54,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:54,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:54,496 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:54,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:54,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:54,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:54,497 INFO L87 Difference]: Start difference. First operand 723 states and 912 transitions. Second operand 5 states. [2018-11-10 09:54:54,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:54,553 INFO L93 Difference]: Finished difference Result 757 states and 947 transitions. [2018-11-10 09:54:54,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:54:54,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-10 09:54:54,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:54,555 INFO L225 Difference]: With dead ends: 757 [2018-11-10 09:54:54,555 INFO L226 Difference]: Without dead ends: 718 [2018-11-10 09:54:54,556 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-11-10 09:54:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-11-10 09:54:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2018-11-10 09:54:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-11-10 09:54:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 905 transitions. [2018-11-10 09:54:54,603 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 905 transitions. Word has length 69 [2018-11-10 09:54:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:54,603 INFO L481 AbstractCegarLoop]: Abstraction has 718 states and 905 transitions. [2018-11-10 09:54:54,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 905 transitions. [2018-11-10 09:54:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:54:54,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:54,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:54,605 INFO L424 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:54,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1329535212, now seen corresponding path program 1 times [2018-11-10 09:54:54,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:54,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:54,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:54,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:54,606 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:54,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:54,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 09:54:54,681 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:54,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 09:54:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:54:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:54:54,682 INFO L87 Difference]: Start difference. First operand 718 states and 905 transitions. Second operand 11 states. [2018-11-10 09:54:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:54,817 INFO L93 Difference]: Finished difference Result 745 states and 935 transitions. [2018-11-10 09:54:54,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 09:54:54,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-10 09:54:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:54,820 INFO L225 Difference]: With dead ends: 745 [2018-11-10 09:54:54,820 INFO L226 Difference]: Without dead ends: 715 [2018-11-10 09:54:54,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:54:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-11-10 09:54:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2018-11-10 09:54:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-11-10 09:54:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 900 transitions. [2018-11-10 09:54:54,872 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 900 transitions. Word has length 69 [2018-11-10 09:54:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:54,873 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 900 transitions. [2018-11-10 09:54:54,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 09:54:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 900 transitions. [2018-11-10 09:54:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:54:54,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:54,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, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:54,874 INFO L424 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:54,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1592706261, now seen corresponding path program 1 times [2018-11-10 09:54:54,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:54,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:54,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:54,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:54,875 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:54,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:54,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 09:54:54,970 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:54,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 09:54:54,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:54:54,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:54:54,971 INFO L87 Difference]: Start difference. First operand 715 states and 900 transitions. Second operand 11 states. [2018-11-10 09:54:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:55,191 INFO L93 Difference]: Finished difference Result 725 states and 909 transitions. [2018-11-10 09:54:55,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 09:54:55,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-10 09:54:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:55,194 INFO L225 Difference]: With dead ends: 725 [2018-11-10 09:54:55,194 INFO L226 Difference]: Without dead ends: 719 [2018-11-10 09:54:55,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:54:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-11-10 09:54:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 712. [2018-11-10 09:54:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-11-10 09:54:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 893 transitions. [2018-11-10 09:54:55,239 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 893 transitions. Word has length 69 [2018-11-10 09:54:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:55,239 INFO L481 AbstractCegarLoop]: Abstraction has 712 states and 893 transitions. [2018-11-10 09:54:55,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 09:54:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 893 transitions. [2018-11-10 09:54:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:54:55,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:55,241 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:55,241 INFO L424 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:55,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:55,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1592983091, now seen corresponding path program 1 times [2018-11-10 09:54:55,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:55,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:55,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:55,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:55,242 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:55,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-11-10 09:54:55,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:55,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:55,284 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:55,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:55,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:55,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:55,288 INFO L87 Difference]: Start difference. First operand 712 states and 893 transitions. Second operand 5 states. [2018-11-10 09:54:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:55,650 INFO L93 Difference]: Finished difference Result 790 states and 995 transitions. [2018-11-10 09:54:55,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:54:55,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-10 09:54:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:55,651 INFO L225 Difference]: With dead ends: 790 [2018-11-10 09:54:55,652 INFO L226 Difference]: Without dead ends: 755 [2018-11-10 09:54:55,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:54:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-10 09:54:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 683. [2018-11-10 09:54:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-11-10 09:54:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 857 transitions. [2018-11-10 09:54:55,680 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 857 transitions. Word has length 69 [2018-11-10 09:54:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:55,680 INFO L481 AbstractCegarLoop]: Abstraction has 683 states and 857 transitions. [2018-11-10 09:54:55,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 857 transitions. [2018-11-10 09:54:55,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 09:54:55,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:55,681 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:55,681 INFO L424 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:55,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:55,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1499782956, now seen corresponding path program 1 times [2018-11-10 09:54:55,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:55,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:55,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:55,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:55,682 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:55,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:55,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:54:55,707 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:55,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:54:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:54:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:54:55,707 INFO L87 Difference]: Start difference. First operand 683 states and 857 transitions. Second operand 3 states. [2018-11-10 09:54:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:55,747 INFO L93 Difference]: Finished difference Result 709 states and 887 transitions. [2018-11-10 09:54:55,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:54:55,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-10 09:54:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:55,750 INFO L225 Difference]: With dead ends: 709 [2018-11-10 09:54:55,750 INFO L226 Difference]: Without dead ends: 669 [2018-11-10 09:54:55,751 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-11-10 09:54:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-11-10 09:54:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 665. [2018-11-10 09:54:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-10 09:54:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 832 transitions. [2018-11-10 09:54:55,778 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 832 transitions. Word has length 69 [2018-11-10 09:54:55,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:55,778 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 832 transitions. [2018-11-10 09:54:55,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:54:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 832 transitions. [2018-11-10 09:54:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:54:55,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:55,779 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:55,780 INFO L424 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:55,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1423434446, now seen corresponding path program 1 times [2018-11-10 09:54:55,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:55,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:55,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:55,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:55,781 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:55,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:55,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:55,818 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:55,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:55,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:55,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:55,819 INFO L87 Difference]: Start difference. First operand 665 states and 832 transitions. Second operand 5 states. [2018-11-10 09:54:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:55,873 INFO L93 Difference]: Finished difference Result 712 states and 881 transitions. [2018-11-10 09:54:55,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:54:55,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-10 09:54:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:55,875 INFO L225 Difference]: With dead ends: 712 [2018-11-10 09:54:55,875 INFO L226 Difference]: Without dead ends: 669 [2018-11-10 09:54:55,876 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-11-10 09:54:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-11-10 09:54:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 665. [2018-11-10 09:54:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-10 09:54:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 831 transitions. [2018-11-10 09:54:55,902 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 831 transitions. Word has length 71 [2018-11-10 09:54:55,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:55,902 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 831 transitions. [2018-11-10 09:54:55,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 831 transitions. [2018-11-10 09:54:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:54:55,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:55,903 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:55,903 INFO L424 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:55,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:55,904 INFO L82 PathProgramCache]: Analyzing trace with hash 627549552, now seen corresponding path program 1 times [2018-11-10 09:54:55,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:55,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:55,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:55,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:55,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:55,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:55,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 09:54:55,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:55,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 09:54:55,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 09:54:55,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:54:55,994 INFO L87 Difference]: Start difference. First operand 665 states and 831 transitions. Second operand 14 states. [2018-11-10 09:54:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:56,115 INFO L93 Difference]: Finished difference Result 689 states and 857 transitions. [2018-11-10 09:54:56,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 09:54:56,115 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-10 09:54:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:56,117 INFO L225 Difference]: With dead ends: 689 [2018-11-10 09:54:56,117 INFO L226 Difference]: Without dead ends: 658 [2018-11-10 09:54:56,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 09:54:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-11-10 09:54:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2018-11-10 09:54:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-11-10 09:54:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 821 transitions. [2018-11-10 09:54:56,151 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 821 transitions. Word has length 71 [2018-11-10 09:54:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:56,152 INFO L481 AbstractCegarLoop]: Abstraction has 658 states and 821 transitions. [2018-11-10 09:54:56,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 09:54:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 821 transitions. [2018-11-10 09:54:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:54:56,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:56,153 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:56,153 INFO L424 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:56,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:56,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1466862187, now seen corresponding path program 1 times [2018-11-10 09:54:56,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:56,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:56,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:56,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:56,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 09:54:56,263 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:56,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 09:54:56,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 09:54:56,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:54:56,264 INFO L87 Difference]: Start difference. First operand 658 states and 821 transitions. Second operand 14 states. [2018-11-10 09:54:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:56,438 INFO L93 Difference]: Finished difference Result 722 states and 889 transitions. [2018-11-10 09:54:56,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 09:54:56,439 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-10 09:54:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:56,441 INFO L225 Difference]: With dead ends: 722 [2018-11-10 09:54:56,441 INFO L226 Difference]: Without dead ends: 652 [2018-11-10 09:54:56,441 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-11-10 09:54:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-11-10 09:54:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2018-11-10 09:54:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-11-10 09:54:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 812 transitions. [2018-11-10 09:54:56,468 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 812 transitions. Word has length 71 [2018-11-10 09:54:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:56,468 INFO L481 AbstractCegarLoop]: Abstraction has 652 states and 812 transitions. [2018-11-10 09:54:56,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 09:54:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 812 transitions. [2018-11-10 09:54:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 09:54:56,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:56,469 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:56,469 INFO L424 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:56,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:56,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1892784974, now seen corresponding path program 1 times [2018-11-10 09:54:56,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:56,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:56,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:56,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:56,470 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:56,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:56,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 09:54:56,511 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:56,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 09:54:56,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:54:56,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:54:56,512 INFO L87 Difference]: Start difference. First operand 652 states and 812 transitions. Second operand 7 states. [2018-11-10 09:54:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:56,580 INFO L93 Difference]: Finished difference Result 706 states and 873 transitions. [2018-11-10 09:54:56,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:54:56,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-10 09:54:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:56,583 INFO L225 Difference]: With dead ends: 706 [2018-11-10 09:54:56,583 INFO L226 Difference]: Without dead ends: 650 [2018-11-10 09:54:56,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:54:56,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-10 09:54:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 646. [2018-11-10 09:54:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-10 09:54:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 802 transitions. [2018-11-10 09:54:56,609 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 802 transitions. Word has length 77 [2018-11-10 09:54:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:56,610 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 802 transitions. [2018-11-10 09:54:56,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 09:54:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 802 transitions. [2018-11-10 09:54:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:54:56,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:56,611 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:56,611 INFO L424 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:56,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:56,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1328298255, now seen corresponding path program 1 times [2018-11-10 09:54:56,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:56,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:56,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:56,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:56,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:56,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:56,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 09:54:56,702 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:56,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 09:54:56,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 09:54:56,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:54:56,703 INFO L87 Difference]: Start difference. First operand 646 states and 802 transitions. Second operand 14 states. [2018-11-10 09:54:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:56,840 INFO L93 Difference]: Finished difference Result 705 states and 864 transitions. [2018-11-10 09:54:56,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 09:54:56,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-10 09:54:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:56,842 INFO L225 Difference]: With dead ends: 705 [2018-11-10 09:54:56,842 INFO L226 Difference]: Without dead ends: 634 [2018-11-10 09:54:56,843 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-11-10 09:54:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-10 09:54:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2018-11-10 09:54:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-11-10 09:54:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 783 transitions. [2018-11-10 09:54:56,870 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 783 transitions. Word has length 72 [2018-11-10 09:54:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:56,870 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 783 transitions. [2018-11-10 09:54:56,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 09:54:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 783 transitions. [2018-11-10 09:54:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 09:54:56,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:56,871 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:56,871 INFO L424 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:56,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1718873266, now seen corresponding path program 1 times [2018-11-10 09:54:56,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:56,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:56,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:56,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:56,872 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:56,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:56,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 09:54:56,939 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:56,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 09:54:56,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:54:56,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:54:56,940 INFO L87 Difference]: Start difference. First operand 634 states and 783 transitions. Second operand 11 states. [2018-11-10 09:54:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:57,022 INFO L93 Difference]: Finished difference Result 826 states and 1011 transitions. [2018-11-10 09:54:57,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 09:54:57,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-10 09:54:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:57,025 INFO L225 Difference]: With dead ends: 826 [2018-11-10 09:54:57,025 INFO L226 Difference]: Without dead ends: 676 [2018-11-10 09:54:57,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:54:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-11-10 09:54:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 640. [2018-11-10 09:54:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-10 09:54:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 785 transitions. [2018-11-10 09:54:57,053 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 785 transitions. Word has length 71 [2018-11-10 09:54:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:57,053 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 785 transitions. [2018-11-10 09:54:57,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 09:54:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 785 transitions. [2018-11-10 09:54:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 09:54:57,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:57,054 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:57,054 INFO L424 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:57,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash -832489070, now seen corresponding path program 1 times [2018-11-10 09:54:57,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:57,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:57,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:57,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:57,055 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:57,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:57,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 09:54:57,138 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:57,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 09:54:57,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 09:54:57,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:54:57,139 INFO L87 Difference]: Start difference. First operand 640 states and 785 transitions. Second operand 14 states. [2018-11-10 09:54:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:57,256 INFO L93 Difference]: Finished difference Result 662 states and 808 transitions. [2018-11-10 09:54:57,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 09:54:57,257 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-10 09:54:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:57,259 INFO L225 Difference]: With dead ends: 662 [2018-11-10 09:54:57,259 INFO L226 Difference]: Without dead ends: 630 [2018-11-10 09:54:57,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 09:54:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-11-10 09:54:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2018-11-10 09:54:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-11-10 09:54:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 770 transitions. [2018-11-10 09:54:57,285 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 770 transitions. Word has length 74 [2018-11-10 09:54:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:57,286 INFO L481 AbstractCegarLoop]: Abstraction has 630 states and 770 transitions. [2018-11-10 09:54:57,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 09:54:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 770 transitions. [2018-11-10 09:54:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 09:54:57,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:57,287 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-11-10 09:54:57,287 INFO L424 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:57,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:57,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2090302376, now seen corresponding path program 1 times [2018-11-10 09:54:57,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:57,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:57,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:57,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:57,288 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:57,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:57,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 09:54:57,385 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:57,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 09:54:57,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 09:54:57,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:54:57,386 INFO L87 Difference]: Start difference. First operand 630 states and 770 transitions. Second operand 13 states. [2018-11-10 09:54:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:57,550 INFO L93 Difference]: Finished difference Result 650 states and 791 transitions. [2018-11-10 09:54:57,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 09:54:57,551 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-11-10 09:54:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:57,553 INFO L225 Difference]: With dead ends: 650 [2018-11-10 09:54:57,553 INFO L226 Difference]: Without dead ends: 625 [2018-11-10 09:54:57,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:54:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-10 09:54:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2018-11-10 09:54:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-11-10 09:54:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 762 transitions. [2018-11-10 09:54:57,583 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 762 transitions. Word has length 79 [2018-11-10 09:54:57,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:57,584 INFO L481 AbstractCegarLoop]: Abstraction has 625 states and 762 transitions. [2018-11-10 09:54:57,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 09:54:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 762 transitions. [2018-11-10 09:54:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 09:54:57,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:57,585 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:57,586 INFO L424 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:57,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:57,586 INFO L82 PathProgramCache]: Analyzing trace with hash -130625566, now seen corresponding path program 1 times [2018-11-10 09:54:57,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:57,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:57,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:57,587 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:57,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:57,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 09:54:57,705 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:57,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 09:54:57,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 09:54:57,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:54:57,706 INFO L87 Difference]: Start difference. First operand 625 states and 762 transitions. Second operand 13 states. [2018-11-10 09:54:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:57,841 INFO L93 Difference]: Finished difference Result 627 states and 763 transitions. [2018-11-10 09:54:57,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 09:54:57,841 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-10 09:54:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:57,842 INFO L225 Difference]: With dead ends: 627 [2018-11-10 09:54:57,843 INFO L226 Difference]: Without dead ends: 576 [2018-11-10 09:54:57,843 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-11-10 09:54:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-11-10 09:54:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2018-11-10 09:54:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-11-10 09:54:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 708 transitions. [2018-11-10 09:54:57,867 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 708 transitions. Word has length 72 [2018-11-10 09:54:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:57,867 INFO L481 AbstractCegarLoop]: Abstraction has 576 states and 708 transitions. [2018-11-10 09:54:57,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 09:54:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 708 transitions. [2018-11-10 09:54:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 09:54:57,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:57,868 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:57,868 INFO L424 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:57,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:57,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1138430218, now seen corresponding path program 1 times [2018-11-10 09:54:57,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:57,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:57,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:57,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:57,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:57,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:57,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 09:54:57,929 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:57,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 09:54:57,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:54:57,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:54:57,929 INFO L87 Difference]: Start difference. First operand 576 states and 708 transitions. Second operand 10 states. [2018-11-10 09:54:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:58,709 INFO L93 Difference]: Finished difference Result 1196 states and 1463 transitions. [2018-11-10 09:54:58,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 09:54:58,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-10 09:54:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:58,711 INFO L225 Difference]: With dead ends: 1196 [2018-11-10 09:54:58,711 INFO L226 Difference]: Without dead ends: 1049 [2018-11-10 09:54:58,712 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-11-10 09:54:58,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-11-10 09:54:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 913. [2018-11-10 09:54:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2018-11-10 09:54:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1141 transitions. [2018-11-10 09:54:58,758 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1141 transitions. Word has length 73 [2018-11-10 09:54:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:58,758 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1141 transitions. [2018-11-10 09:54:58,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 09:54:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1141 transitions. [2018-11-10 09:54:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 09:54:58,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:58,759 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:58,760 INFO L424 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:58,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:58,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1817702472, now seen corresponding path program 1 times [2018-11-10 09:54:58,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:58,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:58,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:58,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:58,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:58,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:58,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 09:54:58,820 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:58,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:54:58,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:54:58,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:54:58,821 INFO L87 Difference]: Start difference. First operand 913 states and 1141 transitions. Second operand 6 states. [2018-11-10 09:54:59,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:59,186 INFO L93 Difference]: Finished difference Result 1195 states and 1456 transitions. [2018-11-10 09:54:59,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:54:59,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-10 09:54:59,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:59,188 INFO L225 Difference]: With dead ends: 1195 [2018-11-10 09:54:59,188 INFO L226 Difference]: Without dead ends: 1065 [2018-11-10 09:54:59,189 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-11-10 09:54:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-11-10 09:54:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1004. [2018-11-10 09:54:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2018-11-10 09:54:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1249 transitions. [2018-11-10 09:54:59,243 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1249 transitions. Word has length 73 [2018-11-10 09:54:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:59,243 INFO L481 AbstractCegarLoop]: Abstraction has 1004 states and 1249 transitions. [2018-11-10 09:54:59,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:54:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1249 transitions. [2018-11-10 09:54:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 09:54:59,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:59,245 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:59,245 INFO L424 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:59,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1443465868, now seen corresponding path program 1 times [2018-11-10 09:54:59,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:59,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:59,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:59,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:59,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:54:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:54:59,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:54:59,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 09:54:59,294 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:54:59,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:54:59,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:54:59,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:54:59,295 INFO L87 Difference]: Start difference. First operand 1004 states and 1249 transitions. Second operand 5 states. [2018-11-10 09:54:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:54:59,347 INFO L93 Difference]: Finished difference Result 1049 states and 1297 transitions. [2018-11-10 09:54:59,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:54:59,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-10 09:54:59,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:54:59,349 INFO L225 Difference]: With dead ends: 1049 [2018-11-10 09:54:59,349 INFO L226 Difference]: Without dead ends: 984 [2018-11-10 09:54:59,349 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-11-10 09:54:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-11-10 09:54:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2018-11-10 09:54:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-11-10 09:54:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1221 transitions. [2018-11-10 09:54:59,411 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1221 transitions. Word has length 73 [2018-11-10 09:54:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:54:59,411 INFO L481 AbstractCegarLoop]: Abstraction has 984 states and 1221 transitions. [2018-11-10 09:54:59,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:54:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1221 transitions. [2018-11-10 09:54:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 09:54:59,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:54:59,413 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:54:59,413 INFO L424 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:54:59,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:54:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2027501370, now seen corresponding path program 1 times [2018-11-10 09:54:59,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:54:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:59,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:54:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:54:59,413 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:54:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:54:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:54:59,466 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 09:54:59,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:54:59 BoogieIcfgContainer [2018-11-10 09:54:59,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:54:59,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:54:59,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:54:59,553 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:54:59,553 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:54:40" (3/4) ... [2018-11-10 09:54:59,555 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 09:54:59,647 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_67cc4934-e8ff-4a95-bb1e-c17e4fc95eb9/bin-2019/utaipan/witness.graphml [2018-11-10 09:54:59,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:54:59,648 INFO L168 Benchmark]: Toolchain (without parser) took 20828.63 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 714.1 MB). Free memory was 957.5 MB in the beginning and 871.5 MB in the end (delta: 86.0 MB). Peak memory consumption was 800.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:54:59,649 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:54:59,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.68 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 914.4 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:54:59,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 914.4 MB in the beginning and 1.2 GB in the end (delta: -269.8 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-10 09:54:59,649 INFO L168 Benchmark]: Boogie Preprocessor took 50.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:54:59,650 INFO L168 Benchmark]: RCFGBuilder took 904.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 149.1 MB). Peak memory consumption was 149.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:54:59,650 INFO L168 Benchmark]: TraceAbstraction took 19335.88 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 522.7 MB). Free memory was 1.0 GB in the beginning and 892.9 MB in the end (delta: 134.6 MB). Peak memory consumption was 657.3 MB. Max. memory is 11.5 GB. [2018-11-10 09:54:59,650 INFO L168 Benchmark]: Witness Printer took 94.49 ms. Allocated memory is still 1.7 GB. Free memory was 892.9 MB in the beginning and 871.5 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-10 09:54:59,651 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.68 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 914.4 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 914.4 MB in the beginning and 1.2 GB in the end (delta: -269.8 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 904.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 149.1 MB). Peak memory consumption was 149.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19335.88 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 522.7 MB). Free memory was 1.0 GB in the beginning and 892.9 MB in the end (delta: 134.6 MB). Peak memory consumption was 657.3 MB. Max. memory is 11.5 GB. * Witness Printer took 94.49 ms. Allocated memory is still 1.7 GB. Free memory was 892.9 MB in the beginning and 871.5 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 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, 19.2s OverallTime, 66 OverallIterations, 2 TraceHistogramMax, 12.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38548 SDtfs, 15770 SDslu, 164464 SDs, 0 SdLazy, 13631 SolverSat, 2487 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1004occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 65 MinimizatonAttempts, 1893 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 3891 NumberOfCodeBlocks, 3891 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 3753 ConstructedInterpolants, 0 QuantifiedInterpolants, 483643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 65 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...