java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:18:49,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:18:49,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:18:49,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:18:49,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:18:49,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:18:49,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:18:49,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:18:49,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:18:49,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:18:49,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:18:49,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:18:49,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:18:49,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:18:49,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:18:49,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:18:49,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:18:49,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:18:49,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:18:49,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:18:49,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:18:49,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:18:49,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:18:49,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:18:49,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:18:49,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:18:49,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:18:49,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:18:49,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:18:49,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:18:49,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:18:49,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:18:49,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:18:49,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:18:49,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:18:49,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:18:49,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:18:49,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:18:49,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:18:49,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:18:49,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:18:49,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:18:49,412 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:18:49,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:18:49,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:18:49,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:18:49,415 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:18:49,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:18:49,415 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:18:49,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:18:49,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:18:49,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:18:49,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:18:49,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:18:49,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:18:49,420 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:18:49,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:18:49,420 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:18:49,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:18:49,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:18:49,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:18:49,421 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:18:49,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:18:49,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:18:49,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:18:49,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:18:49,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:18:49,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:18:49,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:18:49,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:18:49,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:18:49,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:18:49,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:18:49,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:18:49,713 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:18:49,713 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:18:49,714 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-10-13 19:18:49,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1a15841/04ab37e5cd6c4bb2926adc3460bb6d0d/FLAG276157a11 [2019-10-13 19:18:50,272 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:18:50,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-10-13 19:18:50,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1a15841/04ab37e5cd6c4bb2926adc3460bb6d0d/FLAG276157a11 [2019-10-13 19:18:50,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1a15841/04ab37e5cd6c4bb2926adc3460bb6d0d [2019-10-13 19:18:50,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:18:50,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:18:50,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:18:50,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:18:50,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:18:50,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:18:50" (1/1) ... [2019-10-13 19:18:50,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392df8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:18:50, skipping insertion in model container [2019-10-13 19:18:50,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:18:50" (1/1) ... [2019-10-13 19:18:50,632 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:18:50,696 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:18:51,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:18:51,046 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:18:51,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:18:51,308 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:18:51,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:18:51 WrapperNode [2019-10-13 19:18:51,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:18:51,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:18:51,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:18:51,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:18:51,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:18:51" (1/1) ... [2019-10-13 19:18:51,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:18:51" (1/1) ... [2019-10-13 19:18:51,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:18:51" (1/1) ... [2019-10-13 19:18:51,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:18:51" (1/1) ... [2019-10-13 19:18:51,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:18:51" (1/1) ... [2019-10-13 19:18:51,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:18:51" (1/1) ... [2019-10-13 19:18:51,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:18:51" (1/1) ... [2019-10-13 19:18:51,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:18:51,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:18:51,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:18:51,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:18:51,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:18:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-13 19:18:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:18:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:18:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-13 19:18:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-13 19:18:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-10-13 19:18:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-10-13 19:18:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-10-13 19:18:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-10-13 19:18:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-10-13 19:18:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-10-13 19:18:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-10-13 19:18:51,448 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-10-13 19:18:51,449 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-10-13 19:18:51,449 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-10-13 19:18:51,449 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-10-13 19:18:51,449 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-10-13 19:18:51,449 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-10-13 19:18:51,450 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-10-13 19:18:51,450 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-13 19:18:51,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:18:51,450 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-13 19:18:51,450 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-13 19:18:51,450 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-13 19:18:51,451 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-13 19:18:51,451 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-13 19:18:51,451 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-13 19:18:51,451 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-13 19:18:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:18:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:18:51,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:18:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 19:18:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 19:18:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-10-13 19:18:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-10-13 19:18:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-10-13 19:18:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-10-13 19:18:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-10-13 19:18:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-10-13 19:18:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-10-13 19:18:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-10-13 19:18:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-10-13 19:18:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-10-13 19:18:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-10-13 19:18:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-10-13 19:18:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-13 19:18:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-13 19:18:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-13 19:18:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-13 19:18:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-13 19:18:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-13 19:18:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-13 19:18:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-13 19:18:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-10-13 19:18:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-10-13 19:18:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-13 19:18:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:18:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-13 19:18:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:18:51,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:18:51,822 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:18:52,004 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-13 19:18:52,005 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-13 19:18:52,015 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:18:52,061 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-13 19:18:52,061 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-13 19:18:52,079 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:18:52,104 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-13 19:18:52,104 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-13 19:18:52,113 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:18:52,137 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 19:18:52,137 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 19:18:52,367 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:18:52,404 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-13 19:18:52,405 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-13 19:18:52,441 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:18:52,476 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-13 19:18:52,477 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-13 19:18:52,520 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:18:52,520 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:18:52,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:18:52 BoogieIcfgContainer [2019-10-13 19:18:52,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:18:52,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:18:52,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:18:52,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:18:52,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:18:50" (1/3) ... [2019-10-13 19:18:52,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffb803b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:18:52, skipping insertion in model container [2019-10-13 19:18:52,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:18:51" (2/3) ... [2019-10-13 19:18:52,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffb803b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:18:52, skipping insertion in model container [2019-10-13 19:18:52,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:18:52" (3/3) ... [2019-10-13 19:18:52,540 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-10-13 19:18:52,552 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:18:52,561 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:18:52,571 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:18:52,601 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:18:52,602 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:18:52,602 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:18:52,602 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:18:52,602 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:18:52,602 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:18:52,603 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:18:52,603 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:18:52,626 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2019-10-13 19:18:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:18:52,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:18:52,633 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:18:52,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:18:52,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:18:52,639 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2019-10-13 19:18:52,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:18:52,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550389191] [2019-10-13 19:18:52,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:18:52,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:18:52,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:18:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:18:53,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550389191] [2019-10-13 19:18:53,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:18:53,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:18:53,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627410687] [2019-10-13 19:18:53,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:18:53,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:18:53,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:18:53,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:18:53,061 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 5 states. [2019-10-13 19:18:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:18:54,565 INFO L93 Difference]: Finished difference Result 576 states and 845 transitions. [2019-10-13 19:18:54,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:18:54,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-13 19:18:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:18:54,589 INFO L225 Difference]: With dead ends: 576 [2019-10-13 19:18:54,589 INFO L226 Difference]: Without dead ends: 326 [2019-10-13 19:18:54,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:18:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-13 19:18:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2019-10-13 19:18:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-13 19:18:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2019-10-13 19:18:54,687 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2019-10-13 19:18:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:18:54,688 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2019-10-13 19:18:54,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:18:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2019-10-13 19:18:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:18:54,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:18:54,690 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:18:54,690 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:18:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:18:54,691 INFO L82 PathProgramCache]: Analyzing trace with hash -240124352, now seen corresponding path program 1 times [2019-10-13 19:18:54,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:18:54,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974658569] [2019-10-13 19:18:54,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:18:54,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:18:54,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:18:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:18:55,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974658569] [2019-10-13 19:18:55,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:18:55,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:18:55,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703307003] [2019-10-13 19:18:55,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:18:55,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:18:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:18:55,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:18:55,016 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 6 states. [2019-10-13 19:18:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:18:57,133 INFO L93 Difference]: Finished difference Result 690 states and 962 transitions. [2019-10-13 19:18:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:18:57,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-13 19:18:57,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:18:57,141 INFO L225 Difference]: With dead ends: 690 [2019-10-13 19:18:57,142 INFO L226 Difference]: Without dead ends: 507 [2019-10-13 19:18:57,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:18:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-10-13 19:18:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2019-10-13 19:18:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-13 19:18:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2019-10-13 19:18:57,210 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 25 [2019-10-13 19:18:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:18:57,210 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2019-10-13 19:18:57,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:18:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2019-10-13 19:18:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:18:57,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:18:57,213 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:18:57,213 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:18:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:18:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2018358777, now seen corresponding path program 1 times [2019-10-13 19:18:57,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:18:57,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536627184] [2019-10-13 19:18:57,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:18:57,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:18:57,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:18:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:18:57,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536627184] [2019-10-13 19:18:57,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:18:57,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:18:57,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169990986] [2019-10-13 19:18:57,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:18:57,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:18:57,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:18:57,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:18:57,452 INFO L87 Difference]: Start difference. First operand 440 states and 608 transitions. Second operand 6 states. [2019-10-13 19:18:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:18:59,142 INFO L93 Difference]: Finished difference Result 1013 states and 1458 transitions. [2019-10-13 19:18:59,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:18:59,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-10-13 19:18:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:18:59,149 INFO L225 Difference]: With dead ends: 1013 [2019-10-13 19:18:59,149 INFO L226 Difference]: Without dead ends: 690 [2019-10-13 19:18:59,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:18:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-13 19:18:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 618. [2019-10-13 19:18:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-13 19:18:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 888 transitions. [2019-10-13 19:18:59,227 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 888 transitions. Word has length 31 [2019-10-13 19:18:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:18:59,227 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 888 transitions. [2019-10-13 19:18:59,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:18:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 888 transitions. [2019-10-13 19:18:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 19:18:59,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:18:59,236 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:18:59,236 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:18:59,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:18:59,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2019-10-13 19:18:59,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:18:59,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888747737] [2019-10-13 19:18:59,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:18:59,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:18:59,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:18:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:18:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:18:59,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888747737] [2019-10-13 19:18:59,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:18:59,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:18:59,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774826793] [2019-10-13 19:18:59,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:18:59,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:18:59,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:18:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:18:59,439 INFO L87 Difference]: Start difference. First operand 618 states and 888 transitions. Second operand 6 states. [2019-10-13 19:19:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:00,488 INFO L93 Difference]: Finished difference Result 665 states and 952 transitions. [2019-10-13 19:19:00,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:19:00,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-13 19:19:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:00,494 INFO L225 Difference]: With dead ends: 665 [2019-10-13 19:19:00,494 INFO L226 Difference]: Without dead ends: 661 [2019-10-13 19:19:00,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:19:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-10-13 19:19:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2019-10-13 19:19:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-13 19:19:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 901 transitions. [2019-10-13 19:19:00,553 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 901 transitions. Word has length 36 [2019-10-13 19:19:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:00,553 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 901 transitions. [2019-10-13 19:19:00,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:19:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 901 transitions. [2019-10-13 19:19:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 19:19:00,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:00,555 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:00,556 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:00,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:00,556 INFO L82 PathProgramCache]: Analyzing trace with hash -113678377, now seen corresponding path program 1 times [2019-10-13 19:19:00,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:00,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016793957] [2019-10-13 19:19:00,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:00,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:00,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:00,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016793957] [2019-10-13 19:19:00,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:00,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:19:00,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233859513] [2019-10-13 19:19:00,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:19:00,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:00,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:19:00,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:19:00,767 INFO L87 Difference]: Start difference. First operand 628 states and 901 transitions. Second operand 8 states. [2019-10-13 19:19:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:01,762 INFO L93 Difference]: Finished difference Result 1186 states and 1751 transitions. [2019-10-13 19:19:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:19:01,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-13 19:19:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:01,776 INFO L225 Difference]: With dead ends: 1186 [2019-10-13 19:19:01,776 INFO L226 Difference]: Without dead ends: 1167 [2019-10-13 19:19:01,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:19:01,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2019-10-13 19:19:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1065. [2019-10-13 19:19:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-10-13 19:19:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1584 transitions. [2019-10-13 19:19:01,911 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1584 transitions. Word has length 39 [2019-10-13 19:19:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:01,912 INFO L462 AbstractCegarLoop]: Abstraction has 1065 states and 1584 transitions. [2019-10-13 19:19:01,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:19:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1584 transitions. [2019-10-13 19:19:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 19:19:01,913 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:01,914 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:01,914 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:01,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:01,914 INFO L82 PathProgramCache]: Analyzing trace with hash -128023286, now seen corresponding path program 1 times [2019-10-13 19:19:01,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:01,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838263539] [2019-10-13 19:19:01,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:01,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:01,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:02,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838263539] [2019-10-13 19:19:02,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:02,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:19:02,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690957626] [2019-10-13 19:19:02,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:19:02,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:02,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:19:02,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:19:02,158 INFO L87 Difference]: Start difference. First operand 1065 states and 1584 transitions. Second operand 8 states. [2019-10-13 19:19:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:02,943 INFO L93 Difference]: Finished difference Result 1162 states and 1720 transitions. [2019-10-13 19:19:02,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:19:02,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-13 19:19:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:02,952 INFO L225 Difference]: With dead ends: 1162 [2019-10-13 19:19:02,952 INFO L226 Difference]: Without dead ends: 1157 [2019-10-13 19:19:02,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:19:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-10-13 19:19:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1085. [2019-10-13 19:19:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1085 states. [2019-10-13 19:19:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1606 transitions. [2019-10-13 19:19:03,023 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1606 transitions. Word has length 39 [2019-10-13 19:19:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:03,024 INFO L462 AbstractCegarLoop]: Abstraction has 1085 states and 1606 transitions. [2019-10-13 19:19:03,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:19:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1606 transitions. [2019-10-13 19:19:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 19:19:03,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:03,026 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:03,026 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:03,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:03,027 INFO L82 PathProgramCache]: Analyzing trace with hash 778971858, now seen corresponding path program 1 times [2019-10-13 19:19:03,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:03,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847157887] [2019-10-13 19:19:03,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:03,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:03,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:03,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847157887] [2019-10-13 19:19:03,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:03,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:19:03,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965001676] [2019-10-13 19:19:03,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:19:03,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:03,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:19:03,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:19:03,288 INFO L87 Difference]: Start difference. First operand 1085 states and 1606 transitions. Second operand 10 states. [2019-10-13 19:19:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:04,431 INFO L93 Difference]: Finished difference Result 1170 states and 1730 transitions. [2019-10-13 19:19:04,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:19:04,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-10-13 19:19:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:04,445 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 19:19:04,445 INFO L226 Difference]: Without dead ends: 1148 [2019-10-13 19:19:04,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:19:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-10-13 19:19:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1078. [2019-10-13 19:19:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-10-13 19:19:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1597 transitions. [2019-10-13 19:19:04,558 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1597 transitions. Word has length 40 [2019-10-13 19:19:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:04,559 INFO L462 AbstractCegarLoop]: Abstraction has 1078 states and 1597 transitions. [2019-10-13 19:19:04,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:19:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1597 transitions. [2019-10-13 19:19:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 19:19:04,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:04,560 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:04,561 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1897332428, now seen corresponding path program 1 times [2019-10-13 19:19:04,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:04,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145480769] [2019-10-13 19:19:04,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:04,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:04,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:04,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145480769] [2019-10-13 19:19:04,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:04,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:19:04,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197669058] [2019-10-13 19:19:04,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:19:04,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:04,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:19:04,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:19:04,854 INFO L87 Difference]: Start difference. First operand 1078 states and 1597 transitions. Second operand 6 states. [2019-10-13 19:19:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:06,149 INFO L93 Difference]: Finished difference Result 1507 states and 2281 transitions. [2019-10-13 19:19:06,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:19:06,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-10-13 19:19:06,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:06,154 INFO L225 Difference]: With dead ends: 1507 [2019-10-13 19:19:06,155 INFO L226 Difference]: Without dead ends: 599 [2019-10-13 19:19:06,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:19:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-13 19:19:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2019-10-13 19:19:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 19:19:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 852 transitions. [2019-10-13 19:19:06,203 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 852 transitions. Word has length 45 [2019-10-13 19:19:06,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:06,205 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 852 transitions. [2019-10-13 19:19:06,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:19:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 852 transitions. [2019-10-13 19:19:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 19:19:06,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:06,206 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:06,206 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:06,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:06,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2019-10-13 19:19:06,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:06,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438899459] [2019-10-13 19:19:06,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:06,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:06,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:06,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438899459] [2019-10-13 19:19:06,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:06,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-13 19:19:06,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018248194] [2019-10-13 19:19:06,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 19:19:06,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:06,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 19:19:06,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:19:06,515 INFO L87 Difference]: Start difference. First operand 598 states and 852 transitions. Second operand 15 states. [2019-10-13 19:19:09,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:09,457 INFO L93 Difference]: Finished difference Result 639 states and 902 transitions. [2019-10-13 19:19:09,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 19:19:09,458 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2019-10-13 19:19:09,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:09,463 INFO L225 Difference]: With dead ends: 639 [2019-10-13 19:19:09,464 INFO L226 Difference]: Without dead ends: 633 [2019-10-13 19:19:09,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2019-10-13 19:19:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-13 19:19:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 598. [2019-10-13 19:19:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 19:19:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 851 transitions. [2019-10-13 19:19:09,508 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 851 transitions. Word has length 44 [2019-10-13 19:19:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:09,508 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 851 transitions. [2019-10-13 19:19:09,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 19:19:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 851 transitions. [2019-10-13 19:19:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 19:19:09,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:09,510 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:09,511 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:09,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:09,511 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2019-10-13 19:19:09,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:09,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231043736] [2019-10-13 19:19:09,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:09,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:09,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:09,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231043736] [2019-10-13 19:19:09,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:09,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-13 19:19:09,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962377360] [2019-10-13 19:19:09,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 19:19:09,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:09,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 19:19:09,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:19:09,792 INFO L87 Difference]: Start difference. First operand 598 states and 851 transitions. Second operand 15 states. [2019-10-13 19:19:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:12,577 INFO L93 Difference]: Finished difference Result 639 states and 900 transitions. [2019-10-13 19:19:12,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 19:19:12,583 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-10-13 19:19:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:12,588 INFO L225 Difference]: With dead ends: 639 [2019-10-13 19:19:12,588 INFO L226 Difference]: Without dead ends: 633 [2019-10-13 19:19:12,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2019-10-13 19:19:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-13 19:19:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 598. [2019-10-13 19:19:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 19:19:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 850 transitions. [2019-10-13 19:19:12,639 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 850 transitions. Word has length 45 [2019-10-13 19:19:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:12,640 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 850 transitions. [2019-10-13 19:19:12,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 19:19:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 850 transitions. [2019-10-13 19:19:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 19:19:12,641 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:12,641 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:12,641 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:12,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2019-10-13 19:19:12,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:12,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757395121] [2019-10-13 19:19:12,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:12,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:12,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:12,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757395121] [2019-10-13 19:19:12,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:12,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 19:19:12,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920251655] [2019-10-13 19:19:12,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 19:19:12,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:12,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 19:19:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:19:12,871 INFO L87 Difference]: Start difference. First operand 598 states and 850 transitions. Second operand 11 states. [2019-10-13 19:19:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:13,889 INFO L93 Difference]: Finished difference Result 633 states and 893 transitions. [2019-10-13 19:19:13,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:19:13,890 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-10-13 19:19:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:13,895 INFO L225 Difference]: With dead ends: 633 [2019-10-13 19:19:13,895 INFO L226 Difference]: Without dead ends: 608 [2019-10-13 19:19:13,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:19:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-13 19:19:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2019-10-13 19:19:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 19:19:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2019-10-13 19:19:13,943 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 46 [2019-10-13 19:19:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:13,944 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2019-10-13 19:19:13,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 19:19:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2019-10-13 19:19:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 19:19:13,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:13,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:13,946 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:13,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1289582749, now seen corresponding path program 1 times [2019-10-13 19:19:13,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:13,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476947952] [2019-10-13 19:19:13,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:13,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:13,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:14,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476947952] [2019-10-13 19:19:14,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:14,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:19:14,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853250067] [2019-10-13 19:19:14,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:19:14,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:14,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:19:14,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:19:14,179 INFO L87 Difference]: Start difference. First operand 596 states and 845 transitions. Second operand 8 states. [2019-10-13 19:19:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:15,101 INFO L93 Difference]: Finished difference Result 834 states and 1234 transitions. [2019-10-13 19:19:15,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:19:15,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-13 19:19:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:15,107 INFO L225 Difference]: With dead ends: 834 [2019-10-13 19:19:15,108 INFO L226 Difference]: Without dead ends: 826 [2019-10-13 19:19:15,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:19:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-10-13 19:19:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2019-10-13 19:19:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-10-13 19:19:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 948 transitions. [2019-10-13 19:19:15,163 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 948 transitions. Word has length 46 [2019-10-13 19:19:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:15,164 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 948 transitions. [2019-10-13 19:19:15,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:19:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 948 transitions. [2019-10-13 19:19:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 19:19:15,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:15,165 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:15,165 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1713004902, now seen corresponding path program 1 times [2019-10-13 19:19:15,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:15,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454504577] [2019-10-13 19:19:15,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:15,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:15,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:15,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454504577] [2019-10-13 19:19:15,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:15,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:19:15,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212009448] [2019-10-13 19:19:15,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:19:15,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:15,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:19:15,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:19:15,362 INFO L87 Difference]: Start difference. First operand 665 states and 948 transitions. Second operand 8 states. [2019-10-13 19:19:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:16,846 INFO L93 Difference]: Finished difference Result 739 states and 1021 transitions. [2019-10-13 19:19:16,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:19:16,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-13 19:19:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:16,851 INFO L225 Difference]: With dead ends: 739 [2019-10-13 19:19:16,851 INFO L226 Difference]: Without dead ends: 462 [2019-10-13 19:19:16,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:19:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-10-13 19:19:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 441. [2019-10-13 19:19:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-13 19:19:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 578 transitions. [2019-10-13 19:19:16,885 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 578 transitions. Word has length 49 [2019-10-13 19:19:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:16,886 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 578 transitions. [2019-10-13 19:19:16,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:19:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 578 transitions. [2019-10-13 19:19:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 19:19:16,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:16,887 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:16,887 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:16,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash -869356297, now seen corresponding path program 1 times [2019-10-13 19:19:16,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:16,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007766322] [2019-10-13 19:19:16,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:16,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:16,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:17,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007766322] [2019-10-13 19:19:17,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:17,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 19:19:17,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020373478] [2019-10-13 19:19:17,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 19:19:17,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:17,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 19:19:17,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:19:17,114 INFO L87 Difference]: Start difference. First operand 441 states and 578 transitions. Second operand 13 states. [2019-10-13 19:19:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:18,164 INFO L93 Difference]: Finished difference Result 457 states and 597 transitions. [2019-10-13 19:19:18,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:19:18,165 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-10-13 19:19:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:18,167 INFO L225 Difference]: With dead ends: 457 [2019-10-13 19:19:18,168 INFO L226 Difference]: Without dead ends: 453 [2019-10-13 19:19:18,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:19:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-13 19:19:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2019-10-13 19:19:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-13 19:19:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-10-13 19:19:18,199 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2019-10-13 19:19:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:18,199 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-10-13 19:19:18,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 19:19:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-10-13 19:19:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 19:19:18,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:18,200 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:18,201 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash -869633127, now seen corresponding path program 1 times [2019-10-13 19:19:18,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:18,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487799235] [2019-10-13 19:19:18,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:18,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:18,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:18,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487799235] [2019-10-13 19:19:18,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:18,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 19:19:18,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140906596] [2019-10-13 19:19:18,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 19:19:18,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:18,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 19:19:18,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:19:18,463 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 13 states. [2019-10-13 19:19:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:19,363 INFO L93 Difference]: Finished difference Result 780 states and 1069 transitions. [2019-10-13 19:19:19,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:19:19,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-10-13 19:19:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:19,374 INFO L225 Difference]: With dead ends: 780 [2019-10-13 19:19:19,374 INFO L226 Difference]: Without dead ends: 472 [2019-10-13 19:19:19,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:19:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-10-13 19:19:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 459. [2019-10-13 19:19:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-10-13 19:19:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2019-10-13 19:19:19,409 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 47 [2019-10-13 19:19:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:19,409 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2019-10-13 19:19:19,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 19:19:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2019-10-13 19:19:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 19:19:19,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:19,411 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:19,412 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1156321742, now seen corresponding path program 1 times [2019-10-13 19:19:19,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:19,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443618306] [2019-10-13 19:19:19,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:19,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:19,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:19,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443618306] [2019-10-13 19:19:19,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:19,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-13 19:19:19,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631808636] [2019-10-13 19:19:19,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 19:19:19,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:19,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 19:19:19,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:19:19,888 INFO L87 Difference]: Start difference. First operand 459 states and 604 transitions. Second operand 15 states. [2019-10-13 19:19:22,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:19:22,471 INFO L93 Difference]: Finished difference Result 793 states and 1089 transitions. [2019-10-13 19:19:22,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:19:22,472 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-10-13 19:19:22,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:19:22,476 INFO L225 Difference]: With dead ends: 793 [2019-10-13 19:19:22,477 INFO L226 Difference]: Without dead ends: 482 [2019-10-13 19:19:22,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2019-10-13 19:19:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-13 19:19:22,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 459. [2019-10-13 19:19:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-10-13 19:19:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2019-10-13 19:19:22,534 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 48 [2019-10-13 19:19:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:19:22,535 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2019-10-13 19:19:22,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 19:19:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2019-10-13 19:19:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 19:19:22,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:19:22,537 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:19:22,537 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:19:22,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:19:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1551268366, now seen corresponding path program 1 times [2019-10-13 19:19:22,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:19:22,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131388060] [2019-10-13 19:19:22,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:22,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:19:22,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:19:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:19:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:19:22,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131388060] [2019-10-13 19:19:22,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:19:22,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:19:22,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731797425] [2019-10-13 19:19:22,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:19:22,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:19:22,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:19:22,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:19:22,878 INFO L87 Difference]: Start difference. First operand 459 states and 604 transitions. Second operand 10 states.