./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/config/AutomizerReach.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_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c60fa6dcffe947607e07f04cc37f17d0aae2288e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:03:10,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:03:10,318 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:03:10,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:03:10,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:03:10,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:03:10,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:03:10,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:03:10,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:03:10,330 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:03:10,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:03:10,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:03:10,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:03:10,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:03:10,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:03:10,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:03:10,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:03:10,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:03:10,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:03:10,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:03:10,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:03:10,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:03:10,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:03:10,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:03:10,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:03:10,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:03:10,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:03:10,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:03:10,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:03:10,346 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:03:10,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:03:10,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:03:10,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:03:10,346 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:03:10,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:03:10,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:03:10,348 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 10:03:10,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:03:10,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:03:10,357 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:03:10,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 10:03:10,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:03:10,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:03:10,358 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:03:10,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:03:10,359 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:03:10,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:03:10,360 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:03:10,360 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:03:10,360 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:03:10,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:03:10,360 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:03:10,360 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:03:10,360 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:03:10,360 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:03:10,360 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:03:10,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:03:10,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:03:10,361 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:03:10,361 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:03:10,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:03:10,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:03:10,361 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:03:10,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:03:10,361 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:03:10,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:03:10,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:03:10,362 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c60fa6dcffe947607e07f04cc37f17d0aae2288e [2018-11-18 10:03:10,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:03:10,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:03:10,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:03:10,399 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:03:10,399 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:03:10,400 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 10:03:10,443 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/data/13d23f696/aecc2076855d4d52a5c58550e7b9f273/FLAGe24dd9d31 [2018-11-18 10:03:10,816 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:03:10,816 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 10:03:10,827 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/data/13d23f696/aecc2076855d4d52a5c58550e7b9f273/FLAGe24dd9d31 [2018-11-18 10:03:10,835 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/data/13d23f696/aecc2076855d4d52a5c58550e7b9f273 [2018-11-18 10:03:10,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:03:10,838 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 10:03:10,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:03:10,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:03:10,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:03:10,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:03:10" (1/1) ... [2018-11-18 10:03:10,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693f32b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:10, skipping insertion in model container [2018-11-18 10:03:10,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:03:10" (1/1) ... [2018-11-18 10:03:10,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:03:10,887 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:03:11,144 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:03:11,148 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:03:11,280 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:03:11,296 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:03:11,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:11 WrapperNode [2018-11-18 10:03:11,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:03:11,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:03:11,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:03:11,297 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:03:11,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:11" (1/1) ... [2018-11-18 10:03:11,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:11" (1/1) ... [2018-11-18 10:03:11,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:11" (1/1) ... [2018-11-18 10:03:11,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:11" (1/1) ... [2018-11-18 10:03:11,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:11" (1/1) ... [2018-11-18 10:03:11,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:11" (1/1) ... [2018-11-18 10:03:11,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:11" (1/1) ... [2018-11-18 10:03:11,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:03:11,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:03:11,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:03:11,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:03:11,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:03:11,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:03:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:03:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 10:03:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 10:03:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-18 10:03:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-18 10:03:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-18 10:03:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-18 10:03:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-18 10:03:11,414 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-18 10:03:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-18 10:03:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-18 10:03:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-11-18 10:03:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-18 10:03:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-18 10:03:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-18 10:03:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-18 10:03:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-18 10:03:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-18 10:03:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-11-18 10:03:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-18 10:03:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 10:03:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:03:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 10:03:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 10:03:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 10:03:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 10:03:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 10:03:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-18 10:03:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-18 10:03:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 10:03:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-18 10:03:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-11-18 10:03:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-18 10:03:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-18 10:03:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-18 10:03:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-18 10:03:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-18 10:03:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-18 10:03:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 10:03:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 10:03:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:03:11,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:03:11,725 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:03:11,725 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:03:11,786 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:03:11,787 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:03:11,878 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:03:11,878 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:03:11,946 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:03:11,946 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:03:11,998 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:03:11,998 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:03:12,102 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:03:12,102 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:03:12,137 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:03:12,137 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:03:12,149 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:03:12,149 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:03:12,279 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:03:12,279 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:03:12,295 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:03:12,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:03:12 BoogieIcfgContainer [2018-11-18 10:03:12,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:03:12,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:03:12,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:03:12,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:03:12,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:03:10" (1/3) ... [2018-11-18 10:03:12,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80db7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:03:12, skipping insertion in model container [2018-11-18 10:03:12,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:03:11" (2/3) ... [2018-11-18 10:03:12,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80db7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:03:12, skipping insertion in model container [2018-11-18 10:03:12,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:03:12" (3/3) ... [2018-11-18 10:03:12,301 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 10:03:12,307 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:03:12,316 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:03:12,326 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:03:12,349 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:03:12,350 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:03:12,350 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:03:12,350 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:03:12,350 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:03:12,350 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:03:12,350 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:03:12,351 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:03:12,351 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:03:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states. [2018-11-18 10:03:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 10:03:12,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:12,379 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:12,381 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:12,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:12,385 INFO L82 PathProgramCache]: Analyzing trace with hash -448213016, now seen corresponding path program 1 times [2018-11-18 10:03:12,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:12,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:12,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:12,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:12,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:12,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:12,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:12,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:12,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:12,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:12,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:12,565 INFO L87 Difference]: Start difference. First operand 518 states. Second operand 3 states. [2018-11-18 10:03:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:12,727 INFO L93 Difference]: Finished difference Result 893 states and 1383 transitions. [2018-11-18 10:03:12,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:12,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 10:03:12,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:12,740 INFO L225 Difference]: With dead ends: 893 [2018-11-18 10:03:12,740 INFO L226 Difference]: Without dead ends: 510 [2018-11-18 10:03:12,746 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-11-18 10:03:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2018-11-18 10:03:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-11-18 10:03:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 741 transitions. [2018-11-18 10:03:12,810 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 741 transitions. Word has length 20 [2018-11-18 10:03:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:12,810 INFO L480 AbstractCegarLoop]: Abstraction has 510 states and 741 transitions. [2018-11-18 10:03:12,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 741 transitions. [2018-11-18 10:03:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:03:12,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:12,812 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:12,812 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:12,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:12,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1549764761, now seen corresponding path program 1 times [2018-11-18 10:03:12,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:12,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:12,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:12,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:12,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:12,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:12,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:12,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:12,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:12,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:12,941 INFO L87 Difference]: Start difference. First operand 510 states and 741 transitions. Second operand 3 states. [2018-11-18 10:03:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:13,108 INFO L93 Difference]: Finished difference Result 798 states and 1129 transitions. [2018-11-18 10:03:13,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:13,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 10:03:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:13,114 INFO L225 Difference]: With dead ends: 798 [2018-11-18 10:03:13,114 INFO L226 Difference]: Without dead ends: 676 [2018-11-18 10:03:13,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-11-18 10:03:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 656. [2018-11-18 10:03:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-18 10:03:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 936 transitions. [2018-11-18 10:03:13,147 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 936 transitions. Word has length 25 [2018-11-18 10:03:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:13,148 INFO L480 AbstractCegarLoop]: Abstraction has 656 states and 936 transitions. [2018-11-18 10:03:13,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 936 transitions. [2018-11-18 10:03:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 10:03:13,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:13,149 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:13,150 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:13,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash 621330444, now seen corresponding path program 1 times [2018-11-18 10:03:13,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:13,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:13,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:13,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:13,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:13,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:13,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:13,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:13,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:13,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:13,212 INFO L87 Difference]: Start difference. First operand 656 states and 936 transitions. Second operand 3 states. [2018-11-18 10:03:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:13,259 INFO L93 Difference]: Finished difference Result 1005 states and 1391 transitions. [2018-11-18 10:03:13,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:13,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 10:03:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:13,264 INFO L225 Difference]: With dead ends: 1005 [2018-11-18 10:03:13,264 INFO L226 Difference]: Without dead ends: 827 [2018-11-18 10:03:13,265 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:13,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-11-18 10:03:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 773. [2018-11-18 10:03:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-11-18 10:03:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1098 transitions. [2018-11-18 10:03:13,300 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1098 transitions. Word has length 30 [2018-11-18 10:03:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:13,300 INFO L480 AbstractCegarLoop]: Abstraction has 773 states and 1098 transitions. [2018-11-18 10:03:13,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1098 transitions. [2018-11-18 10:03:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 10:03:13,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:13,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:13,303 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:13,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:13,303 INFO L82 PathProgramCache]: Analyzing trace with hash 472217655, now seen corresponding path program 1 times [2018-11-18 10:03:13,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:13,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:13,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:13,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:13,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:13,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:13,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:13,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:13,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:13,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:13,350 INFO L87 Difference]: Start difference. First operand 773 states and 1098 transitions. Second operand 3 states. [2018-11-18 10:03:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:13,525 INFO L93 Difference]: Finished difference Result 1442 states and 2113 transitions. [2018-11-18 10:03:13,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:13,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 10:03:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:13,530 INFO L225 Difference]: With dead ends: 1442 [2018-11-18 10:03:13,530 INFO L226 Difference]: Without dead ends: 1172 [2018-11-18 10:03:13,532 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:13,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-11-18 10:03:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 909. [2018-11-18 10:03:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2018-11-18 10:03:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1334 transitions. [2018-11-18 10:03:13,576 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1334 transitions. Word has length 31 [2018-11-18 10:03:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:13,576 INFO L480 AbstractCegarLoop]: Abstraction has 909 states and 1334 transitions. [2018-11-18 10:03:13,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1334 transitions. [2018-11-18 10:03:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 10:03:13,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:13,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:13,578 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:13,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:13,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1515451823, now seen corresponding path program 1 times [2018-11-18 10:03:13,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:13,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:13,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:13,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:13,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:13,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:13,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:13,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:13,640 INFO L87 Difference]: Start difference. First operand 909 states and 1334 transitions. Second operand 5 states. [2018-11-18 10:03:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:14,178 INFO L93 Difference]: Finished difference Result 1582 states and 2329 transitions. [2018-11-18 10:03:14,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 10:03:14,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-18 10:03:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:14,185 INFO L225 Difference]: With dead ends: 1582 [2018-11-18 10:03:14,185 INFO L226 Difference]: Without dead ends: 998 [2018-11-18 10:03:14,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:03:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-11-18 10:03:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 897. [2018-11-18 10:03:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-11-18 10:03:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1310 transitions. [2018-11-18 10:03:14,217 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1310 transitions. Word has length 32 [2018-11-18 10:03:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:14,218 INFO L480 AbstractCegarLoop]: Abstraction has 897 states and 1310 transitions. [2018-11-18 10:03:14,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1310 transitions. [2018-11-18 10:03:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 10:03:14,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:14,219 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:14,220 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:14,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:14,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2146588537, now seen corresponding path program 1 times [2018-11-18 10:03:14,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:14,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:14,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:14,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:14,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:14,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:14,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:14,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:14,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:14,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:14,273 INFO L87 Difference]: Start difference. First operand 897 states and 1310 transitions. Second operand 3 states. [2018-11-18 10:03:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:14,326 INFO L93 Difference]: Finished difference Result 900 states and 1312 transitions. [2018-11-18 10:03:14,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:14,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 10:03:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:14,329 INFO L225 Difference]: With dead ends: 900 [2018-11-18 10:03:14,329 INFO L226 Difference]: Without dead ends: 896 [2018-11-18 10:03:14,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-11-18 10:03:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2018-11-18 10:03:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-11-18 10:03:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1307 transitions. [2018-11-18 10:03:14,355 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1307 transitions. Word has length 36 [2018-11-18 10:03:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:14,356 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 1307 transitions. [2018-11-18 10:03:14,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1307 transitions. [2018-11-18 10:03:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 10:03:14,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:14,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:14,357 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:14,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:14,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1811578744, now seen corresponding path program 1 times [2018-11-18 10:03:14,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:14,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:14,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:14,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:14,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:14,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:14,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:14,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:14,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:14,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:14,401 INFO L87 Difference]: Start difference. First operand 896 states and 1307 transitions. Second operand 3 states. [2018-11-18 10:03:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:14,439 INFO L93 Difference]: Finished difference Result 1292 states and 1836 transitions. [2018-11-18 10:03:14,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:14,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 10:03:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:14,443 INFO L225 Difference]: With dead ends: 1292 [2018-11-18 10:03:14,443 INFO L226 Difference]: Without dead ends: 1027 [2018-11-18 10:03:14,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-11-18 10:03:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 882. [2018-11-18 10:03:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-11-18 10:03:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1249 transitions. [2018-11-18 10:03:14,473 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1249 transitions. Word has length 39 [2018-11-18 10:03:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:14,473 INFO L480 AbstractCegarLoop]: Abstraction has 882 states and 1249 transitions. [2018-11-18 10:03:14,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1249 transitions. [2018-11-18 10:03:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 10:03:14,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:14,474 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:14,475 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:14,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1349629560, now seen corresponding path program 1 times [2018-11-18 10:03:14,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:14,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:14,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:14,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:14,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:14,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:14,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:14,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:14,510 INFO L87 Difference]: Start difference. First operand 882 states and 1249 transitions. Second operand 3 states. [2018-11-18 10:03:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:14,556 INFO L93 Difference]: Finished difference Result 984 states and 1377 transitions. [2018-11-18 10:03:14,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:14,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 10:03:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:14,559 INFO L225 Difference]: With dead ends: 984 [2018-11-18 10:03:14,560 INFO L226 Difference]: Without dead ends: 964 [2018-11-18 10:03:14,560 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-11-18 10:03:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 908. [2018-11-18 10:03:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-11-18 10:03:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1284 transitions. [2018-11-18 10:03:14,591 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1284 transitions. Word has length 40 [2018-11-18 10:03:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:14,592 INFO L480 AbstractCegarLoop]: Abstraction has 908 states and 1284 transitions. [2018-11-18 10:03:14,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1284 transitions. [2018-11-18 10:03:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 10:03:14,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:14,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:14,595 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:14,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:14,595 INFO L82 PathProgramCache]: Analyzing trace with hash 291360619, now seen corresponding path program 1 times [2018-11-18 10:03:14,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:14,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:14,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:14,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:14,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:14,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:14,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:14,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:14,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:14,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:14,638 INFO L87 Difference]: Start difference. First operand 908 states and 1284 transitions. Second operand 3 states. [2018-11-18 10:03:14,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:14,699 INFO L93 Difference]: Finished difference Result 1187 states and 1663 transitions. [2018-11-18 10:03:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:14,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-18 10:03:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:14,703 INFO L225 Difference]: With dead ends: 1187 [2018-11-18 10:03:14,703 INFO L226 Difference]: Without dead ends: 941 [2018-11-18 10:03:14,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:14,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2018-11-18 10:03:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 908. [2018-11-18 10:03:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-11-18 10:03:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1283 transitions. [2018-11-18 10:03:14,742 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1283 transitions. Word has length 46 [2018-11-18 10:03:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:14,742 INFO L480 AbstractCegarLoop]: Abstraction has 908 states and 1283 transitions. [2018-11-18 10:03:14,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1283 transitions. [2018-11-18 10:03:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 10:03:14,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:14,744 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:14,745 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:14,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:14,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1783887188, now seen corresponding path program 1 times [2018-11-18 10:03:14,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:14,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:14,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:14,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:14,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:14,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-18 10:03:14,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:14,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:03:14,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:03:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:03:14,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:03:14,790 INFO L87 Difference]: Start difference. First operand 908 states and 1283 transitions. Second operand 4 states. [2018-11-18 10:03:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:15,105 INFO L93 Difference]: Finished difference Result 1030 states and 1429 transitions. [2018-11-18 10:03:15,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:03:15,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-18 10:03:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:15,110 INFO L225 Difference]: With dead ends: 1030 [2018-11-18 10:03:15,110 INFO L226 Difference]: Without dead ends: 797 [2018-11-18 10:03:15,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:03:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-11-18 10:03:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 763. [2018-11-18 10:03:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-18 10:03:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1072 transitions. [2018-11-18 10:03:15,153 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1072 transitions. Word has length 47 [2018-11-18 10:03:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:15,154 INFO L480 AbstractCegarLoop]: Abstraction has 763 states and 1072 transitions. [2018-11-18 10:03:15,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:03:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1072 transitions. [2018-11-18 10:03:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 10:03:15,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:15,155 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:15,155 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:15,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:15,156 INFO L82 PathProgramCache]: Analyzing trace with hash -992605317, now seen corresponding path program 1 times [2018-11-18 10:03:15,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:15,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:15,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:15,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:15,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:15,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:15,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:15,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:15,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:15,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:15,195 INFO L87 Difference]: Start difference. First operand 763 states and 1072 transitions. Second operand 3 states. [2018-11-18 10:03:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:15,237 INFO L93 Difference]: Finished difference Result 883 states and 1220 transitions. [2018-11-18 10:03:15,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:15,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-18 10:03:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:15,241 INFO L225 Difference]: With dead ends: 883 [2018-11-18 10:03:15,241 INFO L226 Difference]: Without dead ends: 787 [2018-11-18 10:03:15,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-18 10:03:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 762. [2018-11-18 10:03:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-11-18 10:03:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1067 transitions. [2018-11-18 10:03:15,285 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1067 transitions. Word has length 47 [2018-11-18 10:03:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:15,285 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 1067 transitions. [2018-11-18 10:03:15,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1067 transitions. [2018-11-18 10:03:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 10:03:15,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:15,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] [2018-11-18 10:03:15,287 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:15,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:15,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1733809897, now seen corresponding path program 1 times [2018-11-18 10:03:15,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:15,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:15,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:15,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:15,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:15,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:15,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:15,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:15,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:15,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:15,335 INFO L87 Difference]: Start difference. First operand 762 states and 1067 transitions. Second operand 3 states. [2018-11-18 10:03:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:15,439 INFO L93 Difference]: Finished difference Result 963 states and 1332 transitions. [2018-11-18 10:03:15,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:15,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 10:03:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:15,444 INFO L225 Difference]: With dead ends: 963 [2018-11-18 10:03:15,445 INFO L226 Difference]: Without dead ends: 949 [2018-11-18 10:03:15,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:15,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-11-18 10:03:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 841. [2018-11-18 10:03:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-11-18 10:03:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1159 transitions. [2018-11-18 10:03:15,496 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1159 transitions. Word has length 48 [2018-11-18 10:03:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:15,497 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 1159 transitions. [2018-11-18 10:03:15,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1159 transitions. [2018-11-18 10:03:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 10:03:15,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:15,499 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:15,499 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:15,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1764634278, now seen corresponding path program 1 times [2018-11-18 10:03:15,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:15,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:15,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:15,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:15,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:15,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:15,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 10:03:15,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:03:15,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:03:15,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:03:15,548 INFO L87 Difference]: Start difference. First operand 841 states and 1159 transitions. Second operand 8 states. [2018-11-18 10:03:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:15,691 INFO L93 Difference]: Finished difference Result 867 states and 1193 transitions. [2018-11-18 10:03:15,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:03:15,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-18 10:03:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:15,695 INFO L225 Difference]: With dead ends: 867 [2018-11-18 10:03:15,695 INFO L226 Difference]: Without dead ends: 863 [2018-11-18 10:03:15,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:03:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-11-18 10:03:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 860. [2018-11-18 10:03:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-11-18 10:03:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1186 transitions. [2018-11-18 10:03:15,745 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1186 transitions. Word has length 49 [2018-11-18 10:03:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:15,745 INFO L480 AbstractCegarLoop]: Abstraction has 860 states and 1186 transitions. [2018-11-18 10:03:15,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:03:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1186 transitions. [2018-11-18 10:03:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 10:03:15,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:15,747 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:15,748 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:15,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1764911108, now seen corresponding path program 1 times [2018-11-18 10:03:15,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:15,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:15,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:15,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:15,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 10:03:15,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:03:15,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:03:15,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:03:15,820 INFO L87 Difference]: Start difference. First operand 860 states and 1186 transitions. Second operand 8 states. [2018-11-18 10:03:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:15,922 INFO L93 Difference]: Finished difference Result 902 states and 1238 transitions. [2018-11-18 10:03:15,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:03:15,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-18 10:03:15,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:15,926 INFO L225 Difference]: With dead ends: 902 [2018-11-18 10:03:15,926 INFO L226 Difference]: Without dead ends: 881 [2018-11-18 10:03:15,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:03:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-11-18 10:03:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 880. [2018-11-18 10:03:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-18 10:03:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1210 transitions. [2018-11-18 10:03:15,978 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1210 transitions. Word has length 49 [2018-11-18 10:03:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:15,978 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 1210 transitions. [2018-11-18 10:03:15,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:03:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1210 transitions. [2018-11-18 10:03:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 10:03:15,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:15,982 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:15,982 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:15,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1085825170, now seen corresponding path program 1 times [2018-11-18 10:03:15,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:15,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:15,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:15,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:15,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:16,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:16,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:03:16,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:03:16,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:03:16,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:03:16,012 INFO L87 Difference]: Start difference. First operand 880 states and 1210 transitions. Second operand 4 states. [2018-11-18 10:03:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:16,066 INFO L93 Difference]: Finished difference Result 905 states and 1235 transitions. [2018-11-18 10:03:16,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:03:16,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-18 10:03:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:16,071 INFO L225 Difference]: With dead ends: 905 [2018-11-18 10:03:16,071 INFO L226 Difference]: Without dead ends: 883 [2018-11-18 10:03:16,072 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-11-18 10:03:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2018-11-18 10:03:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-18 10:03:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1209 transitions. [2018-11-18 10:03:16,124 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1209 transitions. Word has length 50 [2018-11-18 10:03:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:16,124 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 1209 transitions. [2018-11-18 10:03:16,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:03:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1209 transitions. [2018-11-18 10:03:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 10:03:16,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:16,126 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:16,127 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:16,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash -908319536, now seen corresponding path program 1 times [2018-11-18 10:03:16,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:16,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:16,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:16,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-18 10:03:16,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:16,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:03:16,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:03:16,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:03:16,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:03:16,175 INFO L87 Difference]: Start difference. First operand 880 states and 1209 transitions. Second operand 7 states. [2018-11-18 10:03:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:17,051 INFO L93 Difference]: Finished difference Result 1092 states and 1543 transitions. [2018-11-18 10:03:17,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:03:17,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-18 10:03:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:17,056 INFO L225 Difference]: With dead ends: 1092 [2018-11-18 10:03:17,056 INFO L226 Difference]: Without dead ends: 1001 [2018-11-18 10:03:17,057 INFO L604 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-18 10:03:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2018-11-18 10:03:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 859. [2018-11-18 10:03:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2018-11-18 10:03:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1172 transitions. [2018-11-18 10:03:17,110 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1172 transitions. Word has length 50 [2018-11-18 10:03:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:17,110 INFO L480 AbstractCegarLoop]: Abstraction has 859 states and 1172 transitions. [2018-11-18 10:03:17,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:03:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1172 transitions. [2018-11-18 10:03:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 10:03:17,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:17,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:17,112 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:17,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash -761626734, now seen corresponding path program 1 times [2018-11-18 10:03:17,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:17,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:17,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:17,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:17,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:17,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:17,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:17,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:17,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:17,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:17,150 INFO L87 Difference]: Start difference. First operand 859 states and 1172 transitions. Second operand 3 states. [2018-11-18 10:03:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:17,252 INFO L93 Difference]: Finished difference Result 1043 states and 1413 transitions. [2018-11-18 10:03:17,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:17,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-18 10:03:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:17,256 INFO L225 Difference]: With dead ends: 1043 [2018-11-18 10:03:17,257 INFO L226 Difference]: Without dead ends: 1003 [2018-11-18 10:03:17,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-18 10:03:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 893. [2018-11-18 10:03:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-11-18 10:03:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1204 transitions. [2018-11-18 10:03:17,313 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1204 transitions. Word has length 50 [2018-11-18 10:03:17,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:17,313 INFO L480 AbstractCegarLoop]: Abstraction has 893 states and 1204 transitions. [2018-11-18 10:03:17,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1204 transitions. [2018-11-18 10:03:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 10:03:17,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:17,315 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:17,317 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:17,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:17,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1782043445, now seen corresponding path program 1 times [2018-11-18 10:03:17,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:17,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:17,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:17,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:17,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:17,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:17,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:03:17,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:03:17,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:03:17,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:03:17,388 INFO L87 Difference]: Start difference. First operand 893 states and 1204 transitions. Second operand 9 states. [2018-11-18 10:03:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:18,996 INFO L93 Difference]: Finished difference Result 1215 states and 1676 transitions. [2018-11-18 10:03:18,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 10:03:18,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-18 10:03:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:19,002 INFO L225 Difference]: With dead ends: 1215 [2018-11-18 10:03:19,003 INFO L226 Difference]: Without dead ends: 1146 [2018-11-18 10:03:19,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-18 10:03:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2018-11-18 10:03:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 906. [2018-11-18 10:03:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-11-18 10:03:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1229 transitions. [2018-11-18 10:03:19,062 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1229 transitions. Word has length 50 [2018-11-18 10:03:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:19,062 INFO L480 AbstractCegarLoop]: Abstraction has 906 states and 1229 transitions. [2018-11-18 10:03:19,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:03:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1229 transitions. [2018-11-18 10:03:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 10:03:19,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:19,068 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:19,068 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:19,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:19,068 INFO L82 PathProgramCache]: Analyzing trace with hash 417807011, now seen corresponding path program 1 times [2018-11-18 10:03:19,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:19,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:19,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:19,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:19,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:19,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:19,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:19,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:19,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:19,126 INFO L87 Difference]: Start difference. First operand 906 states and 1229 transitions. Second operand 3 states. [2018-11-18 10:03:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:19,203 INFO L93 Difference]: Finished difference Result 934 states and 1261 transitions. [2018-11-18 10:03:19,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:19,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-18 10:03:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:19,208 INFO L225 Difference]: With dead ends: 934 [2018-11-18 10:03:19,208 INFO L226 Difference]: Without dead ends: 929 [2018-11-18 10:03:19,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-11-18 10:03:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 923. [2018-11-18 10:03:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-18 10:03:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1250 transitions. [2018-11-18 10:03:19,261 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1250 transitions. Word has length 52 [2018-11-18 10:03:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:19,261 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1250 transitions. [2018-11-18 10:03:19,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1250 transitions. [2018-11-18 10:03:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 10:03:19,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:19,263 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:19,263 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:19,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:19,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1677129215, now seen corresponding path program 1 times [2018-11-18 10:03:19,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:19,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:19,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:19,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:19,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:19,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:19,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:19,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:19,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:19,296 INFO L87 Difference]: Start difference. First operand 923 states and 1250 transitions. Second operand 3 states. [2018-11-18 10:03:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:19,376 INFO L93 Difference]: Finished difference Result 1142 states and 1544 transitions. [2018-11-18 10:03:19,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:19,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-18 10:03:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:19,380 INFO L225 Difference]: With dead ends: 1142 [2018-11-18 10:03:19,380 INFO L226 Difference]: Without dead ends: 892 [2018-11-18 10:03:19,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2018-11-18 10:03:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2018-11-18 10:03:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-18 10:03:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1210 transitions. [2018-11-18 10:03:19,437 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1210 transitions. Word has length 54 [2018-11-18 10:03:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:19,437 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1210 transitions. [2018-11-18 10:03:19,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1210 transitions. [2018-11-18 10:03:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 10:03:19,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:19,439 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:19,439 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:19,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:19,440 INFO L82 PathProgramCache]: Analyzing trace with hash 510703600, now seen corresponding path program 1 times [2018-11-18 10:03:19,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:19,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:19,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:19,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:19,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:19,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:19,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:19,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:19,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:19,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:19,481 INFO L87 Difference]: Start difference. First operand 892 states and 1210 transitions. Second operand 5 states. [2018-11-18 10:03:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:19,844 INFO L93 Difference]: Finished difference Result 904 states and 1220 transitions. [2018-11-18 10:03:19,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:19,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-18 10:03:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:19,847 INFO L225 Difference]: With dead ends: 904 [2018-11-18 10:03:19,848 INFO L226 Difference]: Without dead ends: 898 [2018-11-18 10:03:19,848 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:03:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-11-18 10:03:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 892. [2018-11-18 10:03:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-18 10:03:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1209 transitions. [2018-11-18 10:03:19,906 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1209 transitions. Word has length 53 [2018-11-18 10:03:19,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:19,906 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1209 transitions. [2018-11-18 10:03:19,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1209 transitions. [2018-11-18 10:03:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 10:03:19,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:19,909 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:19,909 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:19,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1022255578, now seen corresponding path program 1 times [2018-11-18 10:03:19,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:19,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:19,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:19,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:19,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:19,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:19,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:19,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:19,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:19,962 INFO L87 Difference]: Start difference. First operand 892 states and 1209 transitions. Second operand 5 states. [2018-11-18 10:03:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:20,365 INFO L93 Difference]: Finished difference Result 907 states and 1224 transitions. [2018-11-18 10:03:20,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:20,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-18 10:03:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:20,369 INFO L225 Difference]: With dead ends: 907 [2018-11-18 10:03:20,369 INFO L226 Difference]: Without dead ends: 871 [2018-11-18 10:03:20,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:03:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-11-18 10:03:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 865. [2018-11-18 10:03:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-18 10:03:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1179 transitions. [2018-11-18 10:03:20,407 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1179 transitions. Word has length 52 [2018-11-18 10:03:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:20,407 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1179 transitions. [2018-11-18 10:03:20,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1179 transitions. [2018-11-18 10:03:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 10:03:20,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:20,409 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:20,409 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:20,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1980078936, now seen corresponding path program 1 times [2018-11-18 10:03:20,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:20,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:20,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:20,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:20,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:20,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:20,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:20,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:20,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:20,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:20,443 INFO L87 Difference]: Start difference. First operand 865 states and 1179 transitions. Second operand 5 states. [2018-11-18 10:03:20,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:20,849 INFO L93 Difference]: Finished difference Result 875 states and 1187 transitions. [2018-11-18 10:03:20,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:20,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-18 10:03:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:20,852 INFO L225 Difference]: With dead ends: 875 [2018-11-18 10:03:20,852 INFO L226 Difference]: Without dead ends: 869 [2018-11-18 10:03:20,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:03:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-11-18 10:03:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 865. [2018-11-18 10:03:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-18 10:03:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1178 transitions. [2018-11-18 10:03:20,885 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1178 transitions. Word has length 54 [2018-11-18 10:03:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:20,886 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1178 transitions. [2018-11-18 10:03:20,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1178 transitions. [2018-11-18 10:03:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 10:03:20,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:20,888 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:20,888 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:20,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash -940758887, now seen corresponding path program 1 times [2018-11-18 10:03:20,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:20,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:20,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:20,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:20,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:20,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:20,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:03:20,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 10:03:20,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 10:03:20,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:03:20,938 INFO L87 Difference]: Start difference. First operand 865 states and 1178 transitions. Second operand 9 states. [2018-11-18 10:03:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:21,060 INFO L93 Difference]: Finished difference Result 892 states and 1208 transitions. [2018-11-18 10:03:21,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:03:21,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-18 10:03:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:21,063 INFO L225 Difference]: With dead ends: 892 [2018-11-18 10:03:21,063 INFO L226 Difference]: Without dead ends: 856 [2018-11-18 10:03:21,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:03:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-18 10:03:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-18 10:03:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-18 10:03:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1154 transitions. [2018-11-18 10:03:21,098 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1154 transitions. Word has length 55 [2018-11-18 10:03:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:21,098 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1154 transitions. [2018-11-18 10:03:21,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 10:03:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1154 transitions. [2018-11-18 10:03:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 10:03:21,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:21,100 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:21,100 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:21,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:21,101 INFO L82 PathProgramCache]: Analyzing trace with hash -548453257, now seen corresponding path program 1 times [2018-11-18 10:03:21,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:21,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:21,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:21,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:21,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:21,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 10:03:21,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:03:21,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:03:21,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:03:21,183 INFO L87 Difference]: Start difference. First operand 856 states and 1154 transitions. Second operand 10 states. [2018-11-18 10:03:21,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:21,317 INFO L93 Difference]: Finished difference Result 872 states and 1171 transitions. [2018-11-18 10:03:21,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 10:03:21,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-18 10:03:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:21,320 INFO L225 Difference]: With dead ends: 872 [2018-11-18 10:03:21,320 INFO L226 Difference]: Without dead ends: 854 [2018-11-18 10:03:21,321 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:03:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-18 10:03:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2018-11-18 10:03:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-11-18 10:03:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1150 transitions. [2018-11-18 10:03:21,353 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1150 transitions. Word has length 55 [2018-11-18 10:03:21,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:21,353 INFO L480 AbstractCegarLoop]: Abstraction has 854 states and 1150 transitions. [2018-11-18 10:03:21,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:03:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1150 transitions. [2018-11-18 10:03:21,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 10:03:21,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:21,355 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:21,355 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:21,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:21,355 INFO L82 PathProgramCache]: Analyzing trace with hash -769794208, now seen corresponding path program 1 times [2018-11-18 10:03:21,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:21,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:21,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:21,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:21,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:21,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:21,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 10:03:21,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:03:21,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:03:21,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:03:21,443 INFO L87 Difference]: Start difference. First operand 854 states and 1150 transitions. Second operand 10 states. [2018-11-18 10:03:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:21,580 INFO L93 Difference]: Finished difference Result 867 states and 1164 transitions. [2018-11-18 10:03:21,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 10:03:21,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-18 10:03:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:21,583 INFO L225 Difference]: With dead ends: 867 [2018-11-18 10:03:21,583 INFO L226 Difference]: Without dead ends: 849 [2018-11-18 10:03:21,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:03:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-11-18 10:03:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2018-11-18 10:03:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-11-18 10:03:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1143 transitions. [2018-11-18 10:03:21,616 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1143 transitions. Word has length 56 [2018-11-18 10:03:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:21,617 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 1143 transitions. [2018-11-18 10:03:21,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:03:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1143 transitions. [2018-11-18 10:03:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 10:03:21,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:21,618 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:21,618 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:21,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1437911526, now seen corresponding path program 1 times [2018-11-18 10:03:21,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:21,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:21,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:21,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:21,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:21,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:21,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:21,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:21,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:21,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:21,652 INFO L87 Difference]: Start difference. First operand 849 states and 1143 transitions. Second operand 5 states. [2018-11-18 10:03:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:21,989 INFO L93 Difference]: Finished difference Result 1286 states and 1741 transitions. [2018-11-18 10:03:21,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:21,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-18 10:03:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:21,993 INFO L225 Difference]: With dead ends: 1286 [2018-11-18 10:03:21,993 INFO L226 Difference]: Without dead ends: 838 [2018-11-18 10:03:21,994 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:03:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-18 10:03:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-11-18 10:03:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-18 10:03:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1114 transitions. [2018-11-18 10:03:22,052 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1114 transitions. Word has length 73 [2018-11-18 10:03:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:22,052 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1114 transitions. [2018-11-18 10:03:22,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1114 transitions. [2018-11-18 10:03:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 10:03:22,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:22,054 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:22,054 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:22,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash 528467351, now seen corresponding path program 1 times [2018-11-18 10:03:22,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:22,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:22,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:22,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:22,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:22,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:22,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:22,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:22,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:22,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:22,148 INFO L87 Difference]: Start difference. First operand 838 states and 1114 transitions. Second operand 3 states. [2018-11-18 10:03:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:22,213 INFO L93 Difference]: Finished difference Result 970 states and 1274 transitions. [2018-11-18 10:03:22,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:22,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-18 10:03:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:22,216 INFO L225 Difference]: With dead ends: 970 [2018-11-18 10:03:22,217 INFO L226 Difference]: Without dead ends: 878 [2018-11-18 10:03:22,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-11-18 10:03:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 855. [2018-11-18 10:03:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2018-11-18 10:03:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1133 transitions. [2018-11-18 10:03:22,273 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1133 transitions. Word has length 74 [2018-11-18 10:03:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:22,273 INFO L480 AbstractCegarLoop]: Abstraction has 855 states and 1133 transitions. [2018-11-18 10:03:22,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1133 transitions. [2018-11-18 10:03:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 10:03:22,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:22,276 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:22,276 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:22,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1144916251, now seen corresponding path program 1 times [2018-11-18 10:03:22,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:22,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:22,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:22,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:22,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:22,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:22,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 10:03:22,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 10:03:22,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:03:22,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:03:22,397 INFO L87 Difference]: Start difference. First operand 855 states and 1133 transitions. Second operand 12 states. [2018-11-18 10:03:22,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:22,556 INFO L93 Difference]: Finished difference Result 881 states and 1161 transitions. [2018-11-18 10:03:22,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:03:22,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-18 10:03:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:22,559 INFO L225 Difference]: With dead ends: 881 [2018-11-18 10:03:22,559 INFO L226 Difference]: Without dead ends: 856 [2018-11-18 10:03:22,560 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 10:03:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-18 10:03:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 854. [2018-11-18 10:03:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-11-18 10:03:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1122 transitions. [2018-11-18 10:03:22,596 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1122 transitions. Word has length 59 [2018-11-18 10:03:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:22,596 INFO L480 AbstractCegarLoop]: Abstraction has 854 states and 1122 transitions. [2018-11-18 10:03:22,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 10:03:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1122 transitions. [2018-11-18 10:03:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 10:03:22,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:22,598 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:22,598 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:22,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:22,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1309677282, now seen corresponding path program 1 times [2018-11-18 10:03:22,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:22,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:22,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:22,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:22,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:22,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-18 10:03:22,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:22,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 10:03:22,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:03:22,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:03:22,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:03:22,691 INFO L87 Difference]: Start difference. First operand 854 states and 1122 transitions. Second operand 11 states. [2018-11-18 10:03:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:22,853 INFO L93 Difference]: Finished difference Result 871 states and 1140 transitions. [2018-11-18 10:03:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:03:22,853 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-18 10:03:22,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:22,855 INFO L225 Difference]: With dead ends: 871 [2018-11-18 10:03:22,856 INFO L226 Difference]: Without dead ends: 851 [2018-11-18 10:03:22,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:03:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-18 10:03:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2018-11-18 10:03:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-11-18 10:03:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1117 transitions. [2018-11-18 10:03:22,891 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1117 transitions. Word has length 58 [2018-11-18 10:03:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:22,892 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1117 transitions. [2018-11-18 10:03:22,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:03:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1117 transitions. [2018-11-18 10:03:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 10:03:22,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:22,893 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:22,894 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:22,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash -719999499, now seen corresponding path program 1 times [2018-11-18 10:03:22,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:22,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:22,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:22,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:22,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 10:03:22,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:03:22,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:03:22,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:03:22,967 INFO L87 Difference]: Start difference. First operand 851 states and 1117 transitions. Second operand 10 states. [2018-11-18 10:03:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:23,134 INFO L93 Difference]: Finished difference Result 918 states and 1192 transitions. [2018-11-18 10:03:23,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:03:23,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-11-18 10:03:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:23,137 INFO L225 Difference]: With dead ends: 918 [2018-11-18 10:03:23,137 INFO L226 Difference]: Without dead ends: 809 [2018-11-18 10:03:23,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:03:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-11-18 10:03:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 806. [2018-11-18 10:03:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-11-18 10:03:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1036 transitions. [2018-11-18 10:03:23,172 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1036 transitions. Word has length 59 [2018-11-18 10:03:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:23,172 INFO L480 AbstractCegarLoop]: Abstraction has 806 states and 1036 transitions. [2018-11-18 10:03:23,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:03:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1036 transitions. [2018-11-18 10:03:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 10:03:23,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:23,174 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:23,174 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:23,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:23,174 INFO L82 PathProgramCache]: Analyzing trace with hash -98888530, now seen corresponding path program 1 times [2018-11-18 10:03:23,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:23,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:23,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:23,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:23,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:23,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:23,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:03:23,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:03:23,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:03:23,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:03:23,209 INFO L87 Difference]: Start difference. First operand 806 states and 1036 transitions. Second operand 4 states. [2018-11-18 10:03:23,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:23,299 INFO L93 Difference]: Finished difference Result 946 states and 1224 transitions. [2018-11-18 10:03:23,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:03:23,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-18 10:03:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:23,302 INFO L225 Difference]: With dead ends: 946 [2018-11-18 10:03:23,302 INFO L226 Difference]: Without dead ends: 844 [2018-11-18 10:03:23,302 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-11-18 10:03:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 813. [2018-11-18 10:03:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-11-18 10:03:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1050 transitions. [2018-11-18 10:03:23,336 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1050 transitions. Word has length 60 [2018-11-18 10:03:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:23,337 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 1050 transitions. [2018-11-18 10:03:23,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:03:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1050 transitions. [2018-11-18 10:03:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 10:03:23,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:23,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:23,339 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:23,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash 175871084, now seen corresponding path program 1 times [2018-11-18 10:03:23,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:23,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:23,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:23,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:23,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 10:03:23,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:03:23,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:03:23,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:03:23,408 INFO L87 Difference]: Start difference. First operand 813 states and 1050 transitions. Second operand 11 states. [2018-11-18 10:03:23,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:23,500 INFO L93 Difference]: Finished difference Result 880 states and 1139 transitions. [2018-11-18 10:03:23,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:03:23,501 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-18 10:03:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:23,503 INFO L225 Difference]: With dead ends: 880 [2018-11-18 10:03:23,503 INFO L226 Difference]: Without dead ends: 825 [2018-11-18 10:03:23,504 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:03:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2018-11-18 10:03:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 817. [2018-11-18 10:03:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-11-18 10:03:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1067 transitions. [2018-11-18 10:03:23,542 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1067 transitions. Word has length 60 [2018-11-18 10:03:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:23,542 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1067 transitions. [2018-11-18 10:03:23,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:03:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1067 transitions. [2018-11-18 10:03:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 10:03:23,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:23,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:23,545 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:23,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:23,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1149940409, now seen corresponding path program 1 times [2018-11-18 10:03:23,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:23,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:23,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:23,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:23,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:23,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:23,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 10:03:23,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 10:03:23,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:03:23,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:03:23,639 INFO L87 Difference]: Start difference. First operand 817 states and 1067 transitions. Second operand 12 states. [2018-11-18 10:03:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:23,810 INFO L93 Difference]: Finished difference Result 839 states and 1090 transitions. [2018-11-18 10:03:23,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:03:23,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-18 10:03:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:23,811 INFO L225 Difference]: With dead ends: 839 [2018-11-18 10:03:23,812 INFO L226 Difference]: Without dead ends: 815 [2018-11-18 10:03:23,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 10:03:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-11-18 10:03:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2018-11-18 10:03:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-11-18 10:03:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1063 transitions. [2018-11-18 10:03:23,860 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1063 transitions. Word has length 63 [2018-11-18 10:03:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:23,860 INFO L480 AbstractCegarLoop]: Abstraction has 815 states and 1063 transitions. [2018-11-18 10:03:23,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 10:03:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1063 transitions. [2018-11-18 10:03:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 10:03:23,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:23,862 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:23,863 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:23,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash -543334915, now seen corresponding path program 1 times [2018-11-18 10:03:23,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:23,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:23,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:23,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:23,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:23,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:23,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:23,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:23,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:23,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:23,920 INFO L87 Difference]: Start difference. First operand 815 states and 1063 transitions. Second operand 5 states. [2018-11-18 10:03:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:24,020 INFO L93 Difference]: Finished difference Result 850 states and 1104 transitions. [2018-11-18 10:03:24,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:24,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-18 10:03:24,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:24,023 INFO L225 Difference]: With dead ends: 850 [2018-11-18 10:03:24,023 INFO L226 Difference]: Without dead ends: 822 [2018-11-18 10:03:24,024 INFO L604 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-18 10:03:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2018-11-18 10:03:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 820. [2018-11-18 10:03:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-11-18 10:03:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1071 transitions. [2018-11-18 10:03:24,066 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1071 transitions. Word has length 67 [2018-11-18 10:03:24,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:24,066 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 1071 transitions. [2018-11-18 10:03:24,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:24,066 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1071 transitions. [2018-11-18 10:03:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 10:03:24,068 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:24,068 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:24,069 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:24,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1459359901, now seen corresponding path program 1 times [2018-11-18 10:03:24,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:24,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:24,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:24,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:24,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:24,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:24,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 10:03:24,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 10:03:24,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:03:24,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:03:24,151 INFO L87 Difference]: Start difference. First operand 820 states and 1071 transitions. Second operand 12 states. [2018-11-18 10:03:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:24,307 INFO L93 Difference]: Finished difference Result 844 states and 1096 transitions. [2018-11-18 10:03:24,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:03:24,308 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-18 10:03:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:24,310 INFO L225 Difference]: With dead ends: 844 [2018-11-18 10:03:24,310 INFO L226 Difference]: Without dead ends: 820 [2018-11-18 10:03:24,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 10:03:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2018-11-18 10:03:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 818. [2018-11-18 10:03:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-11-18 10:03:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1067 transitions. [2018-11-18 10:03:24,346 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1067 transitions. Word has length 66 [2018-11-18 10:03:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:24,347 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1067 transitions. [2018-11-18 10:03:24,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 10:03:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1067 transitions. [2018-11-18 10:03:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 10:03:24,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:24,349 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:24,349 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:24,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:24,349 INFO L82 PathProgramCache]: Analyzing trace with hash 158264959, now seen corresponding path program 1 times [2018-11-18 10:03:24,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:24,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:24,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:24,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:24,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 10:03:24,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 10:03:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:03:24,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:03:24,420 INFO L87 Difference]: Start difference. First operand 818 states and 1067 transitions. Second operand 12 states. [2018-11-18 10:03:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:24,565 INFO L93 Difference]: Finished difference Result 842 states and 1092 transitions. [2018-11-18 10:03:24,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:03:24,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-18 10:03:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:24,567 INFO L225 Difference]: With dead ends: 842 [2018-11-18 10:03:24,567 INFO L226 Difference]: Without dead ends: 818 [2018-11-18 10:03:24,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 10:03:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-11-18 10:03:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 816. [2018-11-18 10:03:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2018-11-18 10:03:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1063 transitions. [2018-11-18 10:03:24,601 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1063 transitions. Word has length 67 [2018-11-18 10:03:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:24,602 INFO L480 AbstractCegarLoop]: Abstraction has 816 states and 1063 transitions. [2018-11-18 10:03:24,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 10:03:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1063 transitions. [2018-11-18 10:03:24,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 10:03:24,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:24,604 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:24,604 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:24,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:24,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1385952928, now seen corresponding path program 1 times [2018-11-18 10:03:24,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:24,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:24,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:24,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:24,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:24,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-18 10:03:24,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:24,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 10:03:24,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 10:03:24,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:03:24,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:03:24,682 INFO L87 Difference]: Start difference. First operand 816 states and 1063 transitions. Second operand 12 states. [2018-11-18 10:03:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:24,818 INFO L93 Difference]: Finished difference Result 838 states and 1086 transitions. [2018-11-18 10:03:24,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:03:24,819 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-18 10:03:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:24,821 INFO L225 Difference]: With dead ends: 838 [2018-11-18 10:03:24,821 INFO L226 Difference]: Without dead ends: 814 [2018-11-18 10:03:24,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 10:03:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2018-11-18 10:03:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 809. [2018-11-18 10:03:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-18 10:03:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1051 transitions. [2018-11-18 10:03:24,856 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1051 transitions. Word has length 62 [2018-11-18 10:03:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:24,856 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1051 transitions. [2018-11-18 10:03:24,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 10:03:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1051 transitions. [2018-11-18 10:03:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 10:03:24,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:24,858 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:24,858 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:24,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash 478731919, now seen corresponding path program 1 times [2018-11-18 10:03:24,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:24,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:24,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:24,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:24,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:24,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-18 10:03:24,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:24,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:24,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:24,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:24,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:24,883 INFO L87 Difference]: Start difference. First operand 809 states and 1051 transitions. Second operand 3 states. [2018-11-18 10:03:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:24,912 INFO L93 Difference]: Finished difference Result 1058 states and 1368 transitions. [2018-11-18 10:03:24,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:24,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-18 10:03:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:24,914 INFO L225 Difference]: With dead ends: 1058 [2018-11-18 10:03:24,914 INFO L226 Difference]: Without dead ends: 755 [2018-11-18 10:03:24,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-18 10:03:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 737. [2018-11-18 10:03:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-11-18 10:03:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 934 transitions. [2018-11-18 10:03:24,944 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 934 transitions. Word has length 62 [2018-11-18 10:03:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:24,945 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 934 transitions. [2018-11-18 10:03:24,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 934 transitions. [2018-11-18 10:03:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 10:03:24,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:24,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:24,946 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:24,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:24,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1067040035, now seen corresponding path program 1 times [2018-11-18 10:03:24,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:24,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:24,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:24,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:24,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:25,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:25,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 10:03:25,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 10:03:25,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:03:25,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:03:25,069 INFO L87 Difference]: Start difference. First operand 737 states and 934 transitions. Second operand 13 states. [2018-11-18 10:03:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:25,248 INFO L93 Difference]: Finished difference Result 754 states and 952 transitions. [2018-11-18 10:03:25,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 10:03:25,249 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-18 10:03:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:25,251 INFO L225 Difference]: With dead ends: 754 [2018-11-18 10:03:25,251 INFO L226 Difference]: Without dead ends: 726 [2018-11-18 10:03:25,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:03:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-11-18 10:03:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2018-11-18 10:03:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-18 10:03:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 919 transitions. [2018-11-18 10:03:25,280 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 919 transitions. Word has length 69 [2018-11-18 10:03:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:25,280 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 919 transitions. [2018-11-18 10:03:25,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 10:03:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 919 transitions. [2018-11-18 10:03:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 10:03:25,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:25,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:25,282 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:25,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash -48275879, now seen corresponding path program 1 times [2018-11-18 10:03:25,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:25,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:25,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:25,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:25,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:25,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:25,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 10:03:25,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 10:03:25,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:03:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:03:25,415 INFO L87 Difference]: Start difference. First operand 726 states and 919 transitions. Second operand 13 states. [2018-11-18 10:03:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:25,578 INFO L93 Difference]: Finished difference Result 743 states and 937 transitions. [2018-11-18 10:03:25,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 10:03:25,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-18 10:03:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:25,581 INFO L225 Difference]: With dead ends: 743 [2018-11-18 10:03:25,581 INFO L226 Difference]: Without dead ends: 721 [2018-11-18 10:03:25,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:03:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-11-18 10:03:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-11-18 10:03:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-11-18 10:03:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 912 transitions. [2018-11-18 10:03:25,610 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 912 transitions. Word has length 63 [2018-11-18 10:03:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:25,610 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 912 transitions. [2018-11-18 10:03:25,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 10:03:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 912 transitions. [2018-11-18 10:03:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 10:03:25,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:25,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] [2018-11-18 10:03:25,612 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:25,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1663625934, now seen corresponding path program 1 times [2018-11-18 10:03:25,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:25,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:25,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:25,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:25,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:25,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:25,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 10:03:25,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 10:03:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:03:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:03:25,726 INFO L87 Difference]: Start difference. First operand 721 states and 912 transitions. Second operand 13 states. [2018-11-18 10:03:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:25,893 INFO L93 Difference]: Finished difference Result 738 states and 930 transitions. [2018-11-18 10:03:25,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 10:03:25,895 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-18 10:03:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:25,897 INFO L225 Difference]: With dead ends: 738 [2018-11-18 10:03:25,897 INFO L226 Difference]: Without dead ends: 713 [2018-11-18 10:03:25,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:03:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-11-18 10:03:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2018-11-18 10:03:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 10:03:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 902 transitions. [2018-11-18 10:03:25,925 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 902 transitions. Word has length 62 [2018-11-18 10:03:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:25,926 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 902 transitions. [2018-11-18 10:03:25,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 10:03:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 902 transitions. [2018-11-18 10:03:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 10:03:25,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:25,927 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:25,927 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:25,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:25,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1192629544, now seen corresponding path program 1 times [2018-11-18 10:03:25,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:25,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:25,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:25,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:25,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:25,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:25,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:25,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:25,957 INFO L87 Difference]: Start difference. First operand 713 states and 902 transitions. Second operand 3 states. [2018-11-18 10:03:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:25,988 INFO L93 Difference]: Finished difference Result 835 states and 1060 transitions. [2018-11-18 10:03:25,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:25,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 10:03:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:25,991 INFO L225 Difference]: With dead ends: 835 [2018-11-18 10:03:25,991 INFO L226 Difference]: Without dead ends: 713 [2018-11-18 10:03:25,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-11-18 10:03:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2018-11-18 10:03:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 10:03:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 900 transitions. [2018-11-18 10:03:26,020 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 900 transitions. Word has length 66 [2018-11-18 10:03:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:26,020 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 900 transitions. [2018-11-18 10:03:26,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 900 transitions. [2018-11-18 10:03:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 10:03:26,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:26,021 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:26,022 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:26,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1875964411, now seen corresponding path program 1 times [2018-11-18 10:03:26,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:26,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:26,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:26,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:26,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:26,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:26,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:26,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:26,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:26,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:26,061 INFO L87 Difference]: Start difference. First operand 713 states and 900 transitions. Second operand 5 states. [2018-11-18 10:03:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:26,108 INFO L93 Difference]: Finished difference Result 759 states and 947 transitions. [2018-11-18 10:03:26,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:26,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-18 10:03:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:26,111 INFO L225 Difference]: With dead ends: 759 [2018-11-18 10:03:26,111 INFO L226 Difference]: Without dead ends: 707 [2018-11-18 10:03:26,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-18 10:03:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2018-11-18 10:03:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-11-18 10:03:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 890 transitions. [2018-11-18 10:03:26,139 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 890 transitions. Word has length 65 [2018-11-18 10:03:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:26,139 INFO L480 AbstractCegarLoop]: Abstraction has 707 states and 890 transitions. [2018-11-18 10:03:26,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 890 transitions. [2018-11-18 10:03:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 10:03:26,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:26,140 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:26,141 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:26,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:26,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1477541838, now seen corresponding path program 1 times [2018-11-18 10:03:26,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:26,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:26,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:26,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:26,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:26,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-18 10:03:26,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:26,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:26,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:26,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:26,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:26,186 INFO L87 Difference]: Start difference. First operand 707 states and 890 transitions. Second operand 5 states. [2018-11-18 10:03:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:26,226 INFO L93 Difference]: Finished difference Result 741 states and 925 transitions. [2018-11-18 10:03:26,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:26,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-18 10:03:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:26,229 INFO L225 Difference]: With dead ends: 741 [2018-11-18 10:03:26,229 INFO L226 Difference]: Without dead ends: 702 [2018-11-18 10:03:26,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2018-11-18 10:03:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2018-11-18 10:03:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-11-18 10:03:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 883 transitions. [2018-11-18 10:03:26,256 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 883 transitions. Word has length 67 [2018-11-18 10:03:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:26,256 INFO L480 AbstractCegarLoop]: Abstraction has 702 states and 883 transitions. [2018-11-18 10:03:26,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 883 transitions. [2018-11-18 10:03:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 10:03:26,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:26,258 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:26,258 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:26,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash 800562057, now seen corresponding path program 1 times [2018-11-18 10:03:26,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:26,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:26,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:26,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:26,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:26,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:26,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:26,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:26,290 INFO L87 Difference]: Start difference. First operand 702 states and 883 transitions. Second operand 5 states. [2018-11-18 10:03:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:26,560 INFO L93 Difference]: Finished difference Result 786 states and 988 transitions. [2018-11-18 10:03:26,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:26,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-18 10:03:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:26,563 INFO L225 Difference]: With dead ends: 786 [2018-11-18 10:03:26,563 INFO L226 Difference]: Without dead ends: 777 [2018-11-18 10:03:26,564 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:03:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-11-18 10:03:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 702. [2018-11-18 10:03:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-11-18 10:03:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 881 transitions. [2018-11-18 10:03:26,594 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 881 transitions. Word has length 68 [2018-11-18 10:03:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:26,594 INFO L480 AbstractCegarLoop]: Abstraction has 702 states and 881 transitions. [2018-11-18 10:03:26,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 881 transitions. [2018-11-18 10:03:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 10:03:26,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:26,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:26,596 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:26,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:26,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1534088944, now seen corresponding path program 1 times [2018-11-18 10:03:26,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:26,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:26,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:26,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:26,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:26,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:26,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:03:26,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:03:26,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:03:26,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:03:26,665 INFO L87 Difference]: Start difference. First operand 702 states and 881 transitions. Second operand 7 states. [2018-11-18 10:03:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:26,746 INFO L93 Difference]: Finished difference Result 748 states and 931 transitions. [2018-11-18 10:03:26,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:03:26,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-18 10:03:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:26,748 INFO L225 Difference]: With dead ends: 748 [2018-11-18 10:03:26,748 INFO L226 Difference]: Without dead ends: 708 [2018-11-18 10:03:26,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:03:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-11-18 10:03:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 706. [2018-11-18 10:03:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2018-11-18 10:03:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 885 transitions. [2018-11-18 10:03:26,796 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 885 transitions. Word has length 74 [2018-11-18 10:03:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:26,796 INFO L480 AbstractCegarLoop]: Abstraction has 706 states and 885 transitions. [2018-11-18 10:03:26,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:03:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 885 transitions. [2018-11-18 10:03:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 10:03:26,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:26,798 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:26,798 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:26,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:26,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1630066308, now seen corresponding path program 1 times [2018-11-18 10:03:26,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:26,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:26,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:26,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:26,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:26,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:26,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 10:03:26,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 10:03:26,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:03:26,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:03:26,897 INFO L87 Difference]: Start difference. First operand 706 states and 885 transitions. Second operand 12 states. [2018-11-18 10:03:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:27,019 INFO L93 Difference]: Finished difference Result 729 states and 909 transitions. [2018-11-18 10:03:27,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 10:03:27,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-18 10:03:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:27,021 INFO L225 Difference]: With dead ends: 729 [2018-11-18 10:03:27,021 INFO L226 Difference]: Without dead ends: 706 [2018-11-18 10:03:27,021 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:03:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-11-18 10:03:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2018-11-18 10:03:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2018-11-18 10:03:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 884 transitions. [2018-11-18 10:03:27,084 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 884 transitions. Word has length 70 [2018-11-18 10:03:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:27,084 INFO L480 AbstractCegarLoop]: Abstraction has 706 states and 884 transitions. [2018-11-18 10:03:27,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 10:03:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 884 transitions. [2018-11-18 10:03:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 10:03:27,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:27,086 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:27,086 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:27,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:27,087 INFO L82 PathProgramCache]: Analyzing trace with hash -832489070, now seen corresponding path program 1 times [2018-11-18 10:03:27,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:27,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:27,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:27,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:27,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:27,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 10:03:27,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:03:27,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:03:27,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:03:27,241 INFO L87 Difference]: Start difference. First operand 706 states and 884 transitions. Second operand 14 states. [2018-11-18 10:03:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:27,393 INFO L93 Difference]: Finished difference Result 728 states and 907 transitions. [2018-11-18 10:03:27,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 10:03:27,393 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-18 10:03:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:27,395 INFO L225 Difference]: With dead ends: 728 [2018-11-18 10:03:27,395 INFO L226 Difference]: Without dead ends: 696 [2018-11-18 10:03:27,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 10:03:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-11-18 10:03:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2018-11-18 10:03:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-18 10:03:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 869 transitions. [2018-11-18 10:03:27,440 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 869 transitions. Word has length 74 [2018-11-18 10:03:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:27,440 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 869 transitions. [2018-11-18 10:03:27,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:03:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 869 transitions. [2018-11-18 10:03:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 10:03:27,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:27,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:27,442 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:27,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:27,442 INFO L82 PathProgramCache]: Analyzing trace with hash -928466434, now seen corresponding path program 1 times [2018-11-18 10:03:27,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:27,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:27,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:27,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:27,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:27,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:27,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 10:03:27,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:03:27,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:03:27,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:03:27,532 INFO L87 Difference]: Start difference. First operand 696 states and 869 transitions. Second operand 14 states. [2018-11-18 10:03:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:27,660 INFO L93 Difference]: Finished difference Result 720 states and 895 transitions. [2018-11-18 10:03:27,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 10:03:27,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-18 10:03:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:27,662 INFO L225 Difference]: With dead ends: 720 [2018-11-18 10:03:27,662 INFO L226 Difference]: Without dead ends: 692 [2018-11-18 10:03:27,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 10:03:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2018-11-18 10:03:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2018-11-18 10:03:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-11-18 10:03:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 863 transitions. [2018-11-18 10:03:27,693 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 863 transitions. Word has length 70 [2018-11-18 10:03:27,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:27,693 INFO L480 AbstractCegarLoop]: Abstraction has 692 states and 863 transitions. [2018-11-18 10:03:27,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:03:27,693 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 863 transitions. [2018-11-18 10:03:27,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 10:03:27,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:27,695 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:27,695 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:27,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:27,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1425039817, now seen corresponding path program 1 times [2018-11-18 10:03:27,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:27,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:27,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:27,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:27,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:27,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:27,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:27,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:27,726 INFO L87 Difference]: Start difference. First operand 692 states and 863 transitions. Second operand 5 states. [2018-11-18 10:03:27,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:27,768 INFO L93 Difference]: Finished difference Result 726 states and 898 transitions. [2018-11-18 10:03:27,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:27,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-18 10:03:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:27,771 INFO L225 Difference]: With dead ends: 726 [2018-11-18 10:03:27,771 INFO L226 Difference]: Without dead ends: 687 [2018-11-18 10:03:27,771 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-11-18 10:03:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2018-11-18 10:03:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-11-18 10:03:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 856 transitions. [2018-11-18 10:03:27,799 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 856 transitions. Word has length 69 [2018-11-18 10:03:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:27,800 INFO L480 AbstractCegarLoop]: Abstraction has 687 states and 856 transitions. [2018-11-18 10:03:27,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 856 transitions. [2018-11-18 10:03:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 10:03:27,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:27,801 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:27,801 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:27,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:27,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1329535212, now seen corresponding path program 1 times [2018-11-18 10:03:27,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:27,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:27,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:27,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:27,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:27,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:27,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 10:03:27,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:03:27,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:03:27,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:03:27,875 INFO L87 Difference]: Start difference. First operand 687 states and 856 transitions. Second operand 11 states. [2018-11-18 10:03:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:27,957 INFO L93 Difference]: Finished difference Result 714 states and 886 transitions. [2018-11-18 10:03:27,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:03:27,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-18 10:03:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:27,959 INFO L225 Difference]: With dead ends: 714 [2018-11-18 10:03:27,959 INFO L226 Difference]: Without dead ends: 684 [2018-11-18 10:03:27,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:03:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-11-18 10:03:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2018-11-18 10:03:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2018-11-18 10:03:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 851 transitions. [2018-11-18 10:03:28,004 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 851 transitions. Word has length 69 [2018-11-18 10:03:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:28,005 INFO L480 AbstractCegarLoop]: Abstraction has 684 states and 851 transitions. [2018-11-18 10:03:28,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:03:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 851 transitions. [2018-11-18 10:03:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 10:03:28,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:28,006 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:28,006 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:28,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1592706261, now seen corresponding path program 1 times [2018-11-18 10:03:28,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:28,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:28,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:28,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:28,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 10:03:28,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:03:28,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:03:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:03:28,126 INFO L87 Difference]: Start difference. First operand 684 states and 851 transitions. Second operand 11 states. [2018-11-18 10:03:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:28,272 INFO L93 Difference]: Finished difference Result 694 states and 860 transitions. [2018-11-18 10:03:28,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:03:28,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-18 10:03:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:28,274 INFO L225 Difference]: With dead ends: 694 [2018-11-18 10:03:28,275 INFO L226 Difference]: Without dead ends: 688 [2018-11-18 10:03:28,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:03:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-11-18 10:03:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 681. [2018-11-18 10:03:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-11-18 10:03:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 844 transitions. [2018-11-18 10:03:28,319 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 844 transitions. Word has length 69 [2018-11-18 10:03:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:28,319 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 844 transitions. [2018-11-18 10:03:28,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:03:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 844 transitions. [2018-11-18 10:03:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 10:03:28,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:28,321 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:28,321 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:28,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1592983091, now seen corresponding path program 1 times [2018-11-18 10:03:28,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:28,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:28,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:28,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:28,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:28,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:28,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:28,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:28,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:28,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:28,354 INFO L87 Difference]: Start difference. First operand 681 states and 844 transitions. Second operand 5 states. [2018-11-18 10:03:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:28,577 INFO L93 Difference]: Finished difference Result 759 states and 943 transitions. [2018-11-18 10:03:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:28,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-18 10:03:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:28,580 INFO L225 Difference]: With dead ends: 759 [2018-11-18 10:03:28,580 INFO L226 Difference]: Without dead ends: 724 [2018-11-18 10:03:28,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:03:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-11-18 10:03:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 652. [2018-11-18 10:03:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-11-18 10:03:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 808 transitions. [2018-11-18 10:03:28,609 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 808 transitions. Word has length 69 [2018-11-18 10:03:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:28,609 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 808 transitions. [2018-11-18 10:03:28,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 808 transitions. [2018-11-18 10:03:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 10:03:28,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:28,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] [2018-11-18 10:03:28,611 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:28,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:28,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1499782956, now seen corresponding path program 1 times [2018-11-18 10:03:28,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:28,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:28,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:28,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:28,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:28,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:28,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:03:28,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:03:28,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:03:28,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:28,637 INFO L87 Difference]: Start difference. First operand 652 states and 808 transitions. Second operand 3 states. [2018-11-18 10:03:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:28,676 INFO L93 Difference]: Finished difference Result 678 states and 838 transitions. [2018-11-18 10:03:28,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:03:28,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-18 10:03:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:28,678 INFO L225 Difference]: With dead ends: 678 [2018-11-18 10:03:28,678 INFO L226 Difference]: Without dead ends: 638 [2018-11-18 10:03:28,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:03:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-11-18 10:03:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 634. [2018-11-18 10:03:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-11-18 10:03:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 783 transitions. [2018-11-18 10:03:28,705 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 783 transitions. Word has length 69 [2018-11-18 10:03:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:28,706 INFO L480 AbstractCegarLoop]: Abstraction has 634 states and 783 transitions. [2018-11-18 10:03:28,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:03:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 783 transitions. [2018-11-18 10:03:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 10:03:28,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:28,707 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:28,707 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:28,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1423434446, now seen corresponding path program 1 times [2018-11-18 10:03:28,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:28,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:28,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:28,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:28,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:28,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:28,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:28,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:28,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:28,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:28,747 INFO L87 Difference]: Start difference. First operand 634 states and 783 transitions. Second operand 5 states. [2018-11-18 10:03:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:28,787 INFO L93 Difference]: Finished difference Result 681 states and 832 transitions. [2018-11-18 10:03:28,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:28,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-18 10:03:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:28,789 INFO L225 Difference]: With dead ends: 681 [2018-11-18 10:03:28,789 INFO L226 Difference]: Without dead ends: 638 [2018-11-18 10:03:28,790 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-11-18 10:03:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 634. [2018-11-18 10:03:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-11-18 10:03:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 782 transitions. [2018-11-18 10:03:28,816 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 782 transitions. Word has length 71 [2018-11-18 10:03:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:28,816 INFO L480 AbstractCegarLoop]: Abstraction has 634 states and 782 transitions. [2018-11-18 10:03:28,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 782 transitions. [2018-11-18 10:03:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 10:03:28,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:28,817 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:28,818 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:28,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:28,818 INFO L82 PathProgramCache]: Analyzing trace with hash 627549552, now seen corresponding path program 1 times [2018-11-18 10:03:28,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:28,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:28,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:28,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:28,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:28,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:28,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 10:03:28,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:03:28,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:03:28,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:03:28,932 INFO L87 Difference]: Start difference. First operand 634 states and 782 transitions. Second operand 14 states. [2018-11-18 10:03:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:29,068 INFO L93 Difference]: Finished difference Result 658 states and 808 transitions. [2018-11-18 10:03:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 10:03:29,070 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-18 10:03:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:29,071 INFO L225 Difference]: With dead ends: 658 [2018-11-18 10:03:29,071 INFO L226 Difference]: Without dead ends: 627 [2018-11-18 10:03:29,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 10:03:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-18 10:03:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2018-11-18 10:03:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-18 10:03:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 772 transitions. [2018-11-18 10:03:29,098 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 772 transitions. Word has length 71 [2018-11-18 10:03:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:29,098 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 772 transitions. [2018-11-18 10:03:29,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:03:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 772 transitions. [2018-11-18 10:03:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 10:03:29,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:29,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:29,099 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:29,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1466862187, now seen corresponding path program 1 times [2018-11-18 10:03:29,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:29,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:29,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:29,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:29,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:29,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-18 10:03:29,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:29,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 10:03:29,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:03:29,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:03:29,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:03:29,214 INFO L87 Difference]: Start difference. First operand 627 states and 772 transitions. Second operand 14 states. [2018-11-18 10:03:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:29,325 INFO L93 Difference]: Finished difference Result 691 states and 840 transitions. [2018-11-18 10:03:29,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 10:03:29,326 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-18 10:03:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:29,327 INFO L225 Difference]: With dead ends: 691 [2018-11-18 10:03:29,327 INFO L226 Difference]: Without dead ends: 621 [2018-11-18 10:03:29,328 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 10:03:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-11-18 10:03:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2018-11-18 10:03:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-18 10:03:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 763 transitions. [2018-11-18 10:03:29,360 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 763 transitions. Word has length 71 [2018-11-18 10:03:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:29,360 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 763 transitions. [2018-11-18 10:03:29,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:03:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 763 transitions. [2018-11-18 10:03:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 10:03:29,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:29,361 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:29,361 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:29,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:29,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1892784974, now seen corresponding path program 1 times [2018-11-18 10:03:29,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:29,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:29,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:29,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:29,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:29,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:29,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:03:29,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 10:03:29,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:03:29,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:03:29,430 INFO L87 Difference]: Start difference. First operand 621 states and 763 transitions. Second operand 7 states. [2018-11-18 10:03:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:29,532 INFO L93 Difference]: Finished difference Result 675 states and 824 transitions. [2018-11-18 10:03:29,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:03:29,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-18 10:03:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:29,534 INFO L225 Difference]: With dead ends: 675 [2018-11-18 10:03:29,534 INFO L226 Difference]: Without dead ends: 619 [2018-11-18 10:03:29,534 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:03:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-18 10:03:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2018-11-18 10:03:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-11-18 10:03:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 753 transitions. [2018-11-18 10:03:29,559 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 753 transitions. Word has length 77 [2018-11-18 10:03:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:29,559 INFO L480 AbstractCegarLoop]: Abstraction has 615 states and 753 transitions. [2018-11-18 10:03:29,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 10:03:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 753 transitions. [2018-11-18 10:03:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 10:03:29,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:29,560 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:29,560 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:29,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:29,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1700582448, now seen corresponding path program 1 times [2018-11-18 10:03:29,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:29,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:29,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:29,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:29,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:29,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:29,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 10:03:29,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:03:29,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:03:29,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:03:29,731 INFO L87 Difference]: Start difference. First operand 615 states and 753 transitions. Second operand 14 states. [2018-11-18 10:03:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:29,867 INFO L93 Difference]: Finished difference Result 641 states and 781 transitions. [2018-11-18 10:03:29,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 10:03:29,867 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-11-18 10:03:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:29,868 INFO L225 Difference]: With dead ends: 641 [2018-11-18 10:03:29,868 INFO L226 Difference]: Without dead ends: 617 [2018-11-18 10:03:29,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 10:03:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-18 10:03:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2018-11-18 10:03:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-11-18 10:03:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 749 transitions. [2018-11-18 10:03:29,893 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 749 transitions. Word has length 77 [2018-11-18 10:03:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:29,893 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 749 transitions. [2018-11-18 10:03:29,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:03:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 749 transitions. [2018-11-18 10:03:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 10:03:29,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:29,894 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:29,894 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:29,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1328298255, now seen corresponding path program 1 times [2018-11-18 10:03:29,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:29,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:29,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:29,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:29,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 10:03:29,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 10:03:29,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:03:29,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:03:29,981 INFO L87 Difference]: Start difference. First operand 613 states and 749 transitions. Second operand 14 states. [2018-11-18 10:03:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:30,080 INFO L93 Difference]: Finished difference Result 672 states and 811 transitions. [2018-11-18 10:03:30,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 10:03:30,080 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-18 10:03:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:30,082 INFO L225 Difference]: With dead ends: 672 [2018-11-18 10:03:30,082 INFO L226 Difference]: Without dead ends: 601 [2018-11-18 10:03:30,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 10:03:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-11-18 10:03:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-11-18 10:03:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-18 10:03:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 730 transitions. [2018-11-18 10:03:30,107 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 730 transitions. Word has length 72 [2018-11-18 10:03:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:30,107 INFO L480 AbstractCegarLoop]: Abstraction has 601 states and 730 transitions. [2018-11-18 10:03:30,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 10:03:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 730 transitions. [2018-11-18 10:03:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 10:03:30,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:30,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:30,109 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:30,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1718873266, now seen corresponding path program 1 times [2018-11-18 10:03:30,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:30,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:30,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:30,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:30,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:30,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 10:03:30,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 10:03:30,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 10:03:30,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 10:03:30,193 INFO L87 Difference]: Start difference. First operand 601 states and 730 transitions. Second operand 11 states. [2018-11-18 10:03:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:30,277 INFO L93 Difference]: Finished difference Result 783 states and 941 transitions. [2018-11-18 10:03:30,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:03:30,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-18 10:03:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:30,279 INFO L225 Difference]: With dead ends: 783 [2018-11-18 10:03:30,279 INFO L226 Difference]: Without dead ends: 643 [2018-11-18 10:03:30,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:03:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-11-18 10:03:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 607. [2018-11-18 10:03:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-11-18 10:03:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 732 transitions. [2018-11-18 10:03:30,306 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 732 transitions. Word has length 71 [2018-11-18 10:03:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:30,306 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 732 transitions. [2018-11-18 10:03:30,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 10:03:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 732 transitions. [2018-11-18 10:03:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 10:03:30,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:30,308 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:30,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:30,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2090302376, now seen corresponding path program 1 times [2018-11-18 10:03:30,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:30,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:30,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:30,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:30,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:30,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:30,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 10:03:30,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 10:03:30,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:03:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:03:30,423 INFO L87 Difference]: Start difference. First operand 607 states and 732 transitions. Second operand 13 states. [2018-11-18 10:03:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:30,570 INFO L93 Difference]: Finished difference Result 627 states and 753 transitions. [2018-11-18 10:03:30,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 10:03:30,570 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-11-18 10:03:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:30,571 INFO L225 Difference]: With dead ends: 627 [2018-11-18 10:03:30,571 INFO L226 Difference]: Without dead ends: 602 [2018-11-18 10:03:30,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:03:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-18 10:03:30,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2018-11-18 10:03:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-11-18 10:03:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 724 transitions. [2018-11-18 10:03:30,596 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 724 transitions. Word has length 79 [2018-11-18 10:03:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:30,596 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 724 transitions. [2018-11-18 10:03:30,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 10:03:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 724 transitions. [2018-11-18 10:03:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 10:03:30,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:30,597 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:30,597 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:30,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:30,597 INFO L82 PathProgramCache]: Analyzing trace with hash -130625566, now seen corresponding path program 1 times [2018-11-18 10:03:30,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:30,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:30,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:30,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:30,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:30,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-18 10:03:30,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:30,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 10:03:30,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 10:03:30,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:03:30,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:03:30,703 INFO L87 Difference]: Start difference. First operand 602 states and 724 transitions. Second operand 13 states. [2018-11-18 10:03:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:30,850 INFO L93 Difference]: Finished difference Result 604 states and 725 transitions. [2018-11-18 10:03:30,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 10:03:30,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-18 10:03:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:30,851 INFO L225 Difference]: With dead ends: 604 [2018-11-18 10:03:30,851 INFO L226 Difference]: Without dead ends: 553 [2018-11-18 10:03:30,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-18 10:03:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-11-18 10:03:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2018-11-18 10:03:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-11-18 10:03:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 670 transitions. [2018-11-18 10:03:30,884 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 670 transitions. Word has length 72 [2018-11-18 10:03:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:30,885 INFO L480 AbstractCegarLoop]: Abstraction has 553 states and 670 transitions. [2018-11-18 10:03:30,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 10:03:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 670 transitions. [2018-11-18 10:03:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 10:03:30,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:30,886 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:30,886 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:30,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1138430218, now seen corresponding path program 1 times [2018-11-18 10:03:30,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:30,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:30,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:30,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:30,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:30,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:30,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 10:03:30,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 10:03:30,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:03:30,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:03:30,957 INFO L87 Difference]: Start difference. First operand 553 states and 670 transitions. Second operand 10 states. [2018-11-18 10:03:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:31,776 INFO L93 Difference]: Finished difference Result 1151 states and 1388 transitions. [2018-11-18 10:03:31,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 10:03:31,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-18 10:03:31,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:31,778 INFO L225 Difference]: With dead ends: 1151 [2018-11-18 10:03:31,778 INFO L226 Difference]: Without dead ends: 1004 [2018-11-18 10:03:31,779 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-18 10:03:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-11-18 10:03:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 869. [2018-11-18 10:03:31,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-11-18 10:03:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1069 transitions. [2018-11-18 10:03:31,816 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1069 transitions. Word has length 73 [2018-11-18 10:03:31,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:31,816 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1069 transitions. [2018-11-18 10:03:31,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 10:03:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1069 transitions. [2018-11-18 10:03:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 10:03:31,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:31,817 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:31,817 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:31,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1817702472, now seen corresponding path program 1 times [2018-11-18 10:03:31,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:31,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:31,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:31,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:31,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:03:31,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:31,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 10:03:31,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 10:03:31,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 10:03:31,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:03:31,873 INFO L87 Difference]: Start difference. First operand 869 states and 1069 transitions. Second operand 6 states. [2018-11-18 10:03:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:32,224 INFO L93 Difference]: Finished difference Result 1149 states and 1380 transitions. [2018-11-18 10:03:32,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 10:03:32,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-18 10:03:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:32,226 INFO L225 Difference]: With dead ends: 1149 [2018-11-18 10:03:32,226 INFO L226 Difference]: Without dead ends: 1019 [2018-11-18 10:03:32,226 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:03:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-11-18 10:03:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 958. [2018-11-18 10:03:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-11-18 10:03:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1173 transitions. [2018-11-18 10:03:32,269 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1173 transitions. Word has length 73 [2018-11-18 10:03:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:32,269 INFO L480 AbstractCegarLoop]: Abstraction has 958 states and 1173 transitions. [2018-11-18 10:03:32,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 10:03:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1173 transitions. [2018-11-18 10:03:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 10:03:32,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:32,270 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:32,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:32,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1443465868, now seen corresponding path program 1 times [2018-11-18 10:03:32,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:32,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:32,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:32,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:32,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:03:32,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-18 10:03:32,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:03:32,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 10:03:32,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 10:03:32,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 10:03:32,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:32,303 INFO L87 Difference]: Start difference. First operand 958 states and 1173 transitions. Second operand 5 states. [2018-11-18 10:03:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:03:32,350 INFO L93 Difference]: Finished difference Result 1003 states and 1221 transitions. [2018-11-18 10:03:32,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:03:32,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-18 10:03:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:03:32,352 INFO L225 Difference]: With dead ends: 1003 [2018-11-18 10:03:32,352 INFO L226 Difference]: Without dead ends: 938 [2018-11-18 10:03:32,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:03:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-11-18 10:03:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2018-11-18 10:03:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-11-18 10:03:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1145 transitions. [2018-11-18 10:03:32,394 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1145 transitions. Word has length 73 [2018-11-18 10:03:32,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:03:32,395 INFO L480 AbstractCegarLoop]: Abstraction has 938 states and 1145 transitions. [2018-11-18 10:03:32,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 10:03:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1145 transitions. [2018-11-18 10:03:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 10:03:32,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:03:32,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:03:32,396 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:03:32,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:03:32,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2027501370, now seen corresponding path program 1 times [2018-11-18 10:03:32,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:03:32,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:03:32,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:32,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:03:32,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:03:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:03:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:03:32,441 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 10:03:32,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:03:32 BoogieIcfgContainer [2018-11-18 10:03:32,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:03:32,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:03:32,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:03:32,504 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:03:32,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:03:12" (3/4) ... [2018-11-18 10:03:32,506 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 10:03:32,570 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b8d88ae1-e6b9-42d7-bb7d-6e111c9b91b3/bin-2019/uautomizer/witness.graphml [2018-11-18 10:03:32,571 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:03:32,571 INFO L168 Benchmark]: Toolchain (without parser) took 21734.04 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 736.1 MB). Free memory was 957.5 MB in the beginning and 1.0 GB in the end (delta: -75.2 MB). Peak memory consumption was 660.9 MB. Max. memory is 11.5 GB. [2018-11-18 10:03:32,572 INFO L168 Benchmark]: CDTParser took 0.18 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-18 10:03:32,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:03:32,573 INFO L168 Benchmark]: Boogie Preprocessor took 70.59 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:03:32,573 INFO L168 Benchmark]: RCFGBuilder took 927.47 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: 153.4 MB). Peak memory consumption was 153.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:03:32,573 INFO L168 Benchmark]: TraceAbstraction took 20207.57 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 564.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -48.7 MB). Peak memory consumption was 515.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:03:32,573 INFO L168 Benchmark]: Witness Printer took 67.11 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:03:32,574 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.18 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 458.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.59 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 927.47 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: 153.4 MB). Peak memory consumption was 153.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20207.57 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 564.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -48.7 MB). Peak memory consumption was 515.4 MB. Max. memory is 11.5 GB. * Witness Printer took 67.11 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 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, 20.1s OverallTime, 68 OverallIterations, 2 TraceHistogramMax, 12.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39205 SDtfs, 16907 SDslu, 168583 SDs, 0 SdLazy, 13978 SolverSat, 2869 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 151 SyntacticMatches, 6 SemanticMatches, 487 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=958occurred in iteration=66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 67 MinimizatonAttempts, 1860 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 4046 NumberOfCodeBlocks, 4046 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 3906 ConstructedInterpolants, 0 QuantifiedInterpolants, 511614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...