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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:46:15,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:46:15,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:46:15,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:46:15,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:46:15,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:46:15,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:46:15,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:46:15,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:46:15,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:46:15,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:46:15,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:46:15,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:46:15,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:46:15,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:46:15,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:46:15,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:46:15,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:46:15,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:46:15,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:46:15,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:46:15,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:46:15,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:46:15,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:46:15,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:46:15,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:46:15,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:46:15,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:46:15,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:46:15,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:46:15,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:46:15,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:46:15,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:46:15,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:46:15,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:46:15,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:46:15,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:46:15,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:46:15,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:46:15,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:46:15,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:46:15,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:46:15,120 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:46:15,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:46:15,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:46:15,121 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:46:15,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:46:15,122 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:46:15,122 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:46:15,123 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:46:15,123 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:46:15,123 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:46:15,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:46:15,124 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:46:15,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:46:15,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:46:15,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:46:15,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:46:15,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:46:15,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:46:15,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:46:15,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:46:15,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:46:15,127 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:46:15,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:46:15,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:46:15,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:46:15,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:46:15,128 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:46:15,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:46:15,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:46:15,129 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:46:15,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:46:15,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:46:15,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:46:15,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:46:15,178 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:46:15,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-09-09 05:46:15,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35b434ebd/179dff5bc091421a89760e6984542caf/FLAG215a06465 [2019-09-09 05:46:15,762 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:46:15,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-09-09 05:46:15,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35b434ebd/179dff5bc091421a89760e6984542caf/FLAG215a06465 [2019-09-09 05:46:16,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35b434ebd/179dff5bc091421a89760e6984542caf [2019-09-09 05:46:16,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:46:16,068 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:46:16,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:46:16,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:46:16,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:46:16,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:46:16" (1/1) ... [2019-09-09 05:46:16,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22799b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:16, skipping insertion in model container [2019-09-09 05:46:16,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:46:16" (1/1) ... [2019-09-09 05:46:16,084 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:46:16,149 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:46:16,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:46:16,617 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:46:16,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:46:16,773 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:46:16,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:16 WrapperNode [2019-09-09 05:46:16,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:46:16,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:46:16,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:46:16,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:46:16,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:16" (1/1) ... [2019-09-09 05:46:16,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:16" (1/1) ... [2019-09-09 05:46:16,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:16" (1/1) ... [2019-09-09 05:46:16,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:16" (1/1) ... [2019-09-09 05:46:16,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:16" (1/1) ... [2019-09-09 05:46:16,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:16" (1/1) ... [2019-09-09 05:46:16,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:16" (1/1) ... [2019-09-09 05:46:16,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:46:16,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:46:16,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:46:16,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:46:16,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:16" (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-09-09 05:46:16,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:46:16,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:46:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-09 05:46:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-09 05:46:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-09-09 05:46:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-09-09 05:46:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-09-09 05:46:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-09-09 05:46:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-09-09 05:46:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-09-09 05:46:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-09-09 05:46:16,961 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-09 05:46:16,961 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:46:16,962 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-09 05:46:16,962 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-09-09 05:46:16,963 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-09-09 05:46:16,963 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-09-09 05:46:16,963 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-09-09 05:46:16,964 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-09 05:46:16,964 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-09 05:46:16,964 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-09 05:46:16,964 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-09 05:46:16,964 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-09 05:46:16,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-09-09 05:46:16,965 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-09-09 05:46:16,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-09 05:46:16,965 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-09-09 05:46:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:46:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:46:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:46:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:46:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:46:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-09-09 05:46:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-09-09 05:46:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-09-09 05:46:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-09-09 05:46:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-09-09 05:46:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-09-09 05:46:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-09 05:46:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-09-09 05:46:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-09-09 05:46:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-09-09 05:46:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-09-09 05:46:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-09 05:46:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-09 05:46:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-09 05:46:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-09-09 05:46:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-09-09 05:46:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-09 05:46:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-09 05:46:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-09 05:46:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-09 05:46:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-09-09 05:46:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-09 05:46:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:46:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-09 05:46:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-09-09 05:46:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:46:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:46:17,306 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:17,373 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:17,373 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:17,388 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:17,400 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:17,400 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:17,411 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:17,734 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-09-09 05:46:17,736 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-09-09 05:46:17,738 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:17,846 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-09-09 05:46:17,847 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-09-09 05:46:17,878 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:17,920 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-09 05:46:17,921 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-09 05:46:18,025 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:18,038 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:18,038 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:18,038 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:18,051 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:18,051 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:18,052 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:18,063 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:18,064 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:18,100 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:18,139 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-09 05:46:18,139 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-09 05:46:18,166 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:18,172 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:18,173 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:18,173 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:18,189 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:18,190 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:18,190 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:18,226 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:18,226 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:18,236 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:46:18,237 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:46:18,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:46:18 BoogieIcfgContainer [2019-09-09 05:46:18,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:46:18,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:46:18,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:46:18,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:46:18,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:46:16" (1/3) ... [2019-09-09 05:46:18,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca75001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:46:18, skipping insertion in model container [2019-09-09 05:46:18,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:16" (2/3) ... [2019-09-09 05:46:18,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca75001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:46:18, skipping insertion in model container [2019-09-09 05:46:18,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:46:18" (3/3) ... [2019-09-09 05:46:18,246 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2019-09-09 05:46:18,255 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:46:18,265 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:46:18,282 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:46:18,308 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:46:18,308 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:46:18,309 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:46:18,309 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:46:18,309 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:46:18,309 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:46:18,309 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:46:18,309 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:46:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-09-09 05:46:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:46:18,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:18,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:18,346 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:18,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash -194924121, now seen corresponding path program 1 times [2019-09-09 05:46:18,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:18,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:18,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:18,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:18,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:18,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:18,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:18,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:18,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:18,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:18,630 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-09-09 05:46:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:18,744 INFO L93 Difference]: Finished difference Result 300 states and 401 transitions. [2019-09-09 05:46:18,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:18,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:46:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:18,775 INFO L225 Difference]: With dead ends: 300 [2019-09-09 05:46:18,775 INFO L226 Difference]: Without dead ends: 292 [2019-09-09 05:46:18,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-09 05:46:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-09-09 05:46:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-09 05:46:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2019-09-09 05:46:18,856 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2019-09-09 05:46:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:18,857 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2019-09-09 05:46:18,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2019-09-09 05:46:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:46:18,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:18,859 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 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-09-09 05:46:18,859 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:18,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:18,860 INFO L82 PathProgramCache]: Analyzing trace with hash -632063438, now seen corresponding path program 1 times [2019-09-09 05:46:18,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:18,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:18,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:18,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:18,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:19,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:19,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:19,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:19,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:19,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:19,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:19,122 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand 4 states. [2019-09-09 05:46:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:19,484 INFO L93 Difference]: Finished difference Result 495 states and 639 transitions. [2019-09-09 05:46:19,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:46:19,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-09-09 05:46:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:19,492 INFO L225 Difference]: With dead ends: 495 [2019-09-09 05:46:19,492 INFO L226 Difference]: Without dead ends: 495 [2019-09-09 05:46:19,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-09 05:46:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 381. [2019-09-09 05:46:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-09-09 05:46:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 497 transitions. [2019-09-09 05:46:19,535 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 497 transitions. Word has length 28 [2019-09-09 05:46:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:19,536 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 497 transitions. [2019-09-09 05:46:19,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 497 transitions. [2019-09-09 05:46:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:46:19,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:19,537 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 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-09-09 05:46:19,537 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:19,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:19,538 INFO L82 PathProgramCache]: Analyzing trace with hash 177283188, now seen corresponding path program 1 times [2019-09-09 05:46:19,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:19,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:19,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:19,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:19,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:19,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:19,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:19,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:19,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:19,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:19,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:19,660 INFO L87 Difference]: Start difference. First operand 381 states and 497 transitions. Second operand 3 states. [2019-09-09 05:46:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:19,790 INFO L93 Difference]: Finished difference Result 536 states and 698 transitions. [2019-09-09 05:46:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:19,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:46:19,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:19,795 INFO L225 Difference]: With dead ends: 536 [2019-09-09 05:46:19,796 INFO L226 Difference]: Without dead ends: 535 [2019-09-09 05:46:19,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-09 05:46:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 518. [2019-09-09 05:46:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-09-09 05:46:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 676 transitions. [2019-09-09 05:46:19,849 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 676 transitions. Word has length 28 [2019-09-09 05:46:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:19,850 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 676 transitions. [2019-09-09 05:46:19,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 676 transitions. [2019-09-09 05:46:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:46:19,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:19,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-09-09 05:46:19,852 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash 182749823, now seen corresponding path program 1 times [2019-09-09 05:46:19,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:19,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:19,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:19,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:19,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:19,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:19,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:19,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:19,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:19,954 INFO L87 Difference]: Start difference. First operand 518 states and 676 transitions. Second operand 3 states. [2019-09-09 05:46:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:19,992 INFO L93 Difference]: Finished difference Result 731 states and 962 transitions. [2019-09-09 05:46:19,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:19,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:46:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:19,998 INFO L225 Difference]: With dead ends: 731 [2019-09-09 05:46:19,999 INFO L226 Difference]: Without dead ends: 731 [2019-09-09 05:46:19,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-09 05:46:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 700. [2019-09-09 05:46:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-09 05:46:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 926 transitions. [2019-09-09 05:46:20,031 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 926 transitions. Word has length 30 [2019-09-09 05:46:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:20,032 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 926 transitions. [2019-09-09 05:46:20,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 926 transitions. [2019-09-09 05:46:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-09 05:46:20,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:20,034 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:20,034 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:20,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:20,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1294168590, now seen corresponding path program 1 times [2019-09-09 05:46:20,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:20,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:20,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:20,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:20,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:20,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:20,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:20,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:20,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:20,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:20,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:20,092 INFO L87 Difference]: Start difference. First operand 700 states and 926 transitions. Second operand 3 states. [2019-09-09 05:46:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:20,143 INFO L93 Difference]: Finished difference Result 828 states and 1083 transitions. [2019-09-09 05:46:20,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:20,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-09 05:46:20,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:20,150 INFO L225 Difference]: With dead ends: 828 [2019-09-09 05:46:20,150 INFO L226 Difference]: Without dead ends: 828 [2019-09-09 05:46:20,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-09-09 05:46:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 783. [2019-09-09 05:46:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-09 05:46:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1032 transitions. [2019-09-09 05:46:20,197 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1032 transitions. Word has length 34 [2019-09-09 05:46:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:20,200 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1032 transitions. [2019-09-09 05:46:20,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1032 transitions. [2019-09-09 05:46:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-09 05:46:20,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:20,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:20,212 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:20,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:20,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2013424057, now seen corresponding path program 1 times [2019-09-09 05:46:20,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:20,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:20,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:20,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:20,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:20,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:20,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:20,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:20,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:20,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:20,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:20,273 INFO L87 Difference]: Start difference. First operand 783 states and 1032 transitions. Second operand 3 states. [2019-09-09 05:46:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:20,380 INFO L93 Difference]: Finished difference Result 1175 states and 1570 transitions. [2019-09-09 05:46:20,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:20,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-09-09 05:46:20,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:20,388 INFO L225 Difference]: With dead ends: 1175 [2019-09-09 05:46:20,388 INFO L226 Difference]: Without dead ends: 1175 [2019-09-09 05:46:20,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-09 05:46:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 910. [2019-09-09 05:46:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-09 05:46:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1207 transitions. [2019-09-09 05:46:20,427 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1207 transitions. Word has length 41 [2019-09-09 05:46:20,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:20,428 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1207 transitions. [2019-09-09 05:46:20,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1207 transitions. [2019-09-09 05:46:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-09 05:46:20,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:20,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:20,430 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:20,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:20,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2127814436, now seen corresponding path program 1 times [2019-09-09 05:46:20,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:20,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:20,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:20,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:20,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:20,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:20,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:20,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:20,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:20,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:20,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:20,481 INFO L87 Difference]: Start difference. First operand 910 states and 1207 transitions. Second operand 3 states. [2019-09-09 05:46:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:20,586 INFO L93 Difference]: Finished difference Result 922 states and 1221 transitions. [2019-09-09 05:46:20,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:20,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-09 05:46:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:20,593 INFO L225 Difference]: With dead ends: 922 [2019-09-09 05:46:20,593 INFO L226 Difference]: Without dead ends: 922 [2019-09-09 05:46:20,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-09-09 05:46:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 921. [2019-09-09 05:46:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-09-09 05:46:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1219 transitions. [2019-09-09 05:46:20,622 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1219 transitions. Word has length 40 [2019-09-09 05:46:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:20,622 INFO L475 AbstractCegarLoop]: Abstraction has 921 states and 1219 transitions. [2019-09-09 05:46:20,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1219 transitions. [2019-09-09 05:46:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-09 05:46:20,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:20,624 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:20,625 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:20,625 INFO L82 PathProgramCache]: Analyzing trace with hash -277982875, now seen corresponding path program 1 times [2019-09-09 05:46:20,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:20,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:20,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:20,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:20,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:20,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:20,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:20,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:20,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:20,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:20,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:20,677 INFO L87 Difference]: Start difference. First operand 921 states and 1219 transitions. Second operand 3 states. [2019-09-09 05:46:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:20,765 INFO L93 Difference]: Finished difference Result 952 states and 1255 transitions. [2019-09-09 05:46:20,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:20,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-09-09 05:46:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:20,773 INFO L225 Difference]: With dead ends: 952 [2019-09-09 05:46:20,773 INFO L226 Difference]: Without dead ends: 952 [2019-09-09 05:46:20,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-09-09 05:46:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2019-09-09 05:46:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-09-09 05:46:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1254 transitions. [2019-09-09 05:46:20,845 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1254 transitions. Word has length 41 [2019-09-09 05:46:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:20,845 INFO L475 AbstractCegarLoop]: Abstraction has 950 states and 1254 transitions. [2019-09-09 05:46:20,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1254 transitions. [2019-09-09 05:46:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-09 05:46:20,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:20,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:20,850 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:20,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:20,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2048774711, now seen corresponding path program 1 times [2019-09-09 05:46:20,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:20,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:20,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:20,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:20,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:20,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:20,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:20,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:20,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:20,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:20,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:20,954 INFO L87 Difference]: Start difference. First operand 950 states and 1254 transitions. Second operand 5 states. [2019-09-09 05:46:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:21,588 INFO L93 Difference]: Finished difference Result 1118 states and 1465 transitions. [2019-09-09 05:46:21,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:21,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-09 05:46:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:21,599 INFO L225 Difference]: With dead ends: 1118 [2019-09-09 05:46:21,599 INFO L226 Difference]: Without dead ends: 1118 [2019-09-09 05:46:21,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-09-09 05:46:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 935. [2019-09-09 05:46:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-09-09 05:46:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1219 transitions. [2019-09-09 05:46:21,643 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1219 transitions. Word has length 42 [2019-09-09 05:46:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:21,644 INFO L475 AbstractCegarLoop]: Abstraction has 935 states and 1219 transitions. [2019-09-09 05:46:21,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1219 transitions. [2019-09-09 05:46:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-09 05:46:21,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:21,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:21,646 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash 424343062, now seen corresponding path program 1 times [2019-09-09 05:46:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:21,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:21,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:21,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:21,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:21,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:21,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:21,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:21,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:21,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:21,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:21,744 INFO L87 Difference]: Start difference. First operand 935 states and 1219 transitions. Second operand 5 states. [2019-09-09 05:46:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:22,097 INFO L93 Difference]: Finished difference Result 937 states and 1219 transitions. [2019-09-09 05:46:22,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:22,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-09 05:46:22,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:22,102 INFO L225 Difference]: With dead ends: 937 [2019-09-09 05:46:22,102 INFO L226 Difference]: Without dead ends: 937 [2019-09-09 05:46:22,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-09-09 05:46:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 935. [2019-09-09 05:46:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-09-09 05:46:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1218 transitions. [2019-09-09 05:46:22,126 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1218 transitions. Word has length 42 [2019-09-09 05:46:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:22,127 INFO L475 AbstractCegarLoop]: Abstraction has 935 states and 1218 transitions. [2019-09-09 05:46:22,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1218 transitions. [2019-09-09 05:46:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-09 05:46:22,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:22,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:22,128 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:22,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:22,129 INFO L82 PathProgramCache]: Analyzing trace with hash -590658574, now seen corresponding path program 1 times [2019-09-09 05:46:22,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:22,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:22,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:22,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:22,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:22,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:22,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:22,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:22,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:22,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:22,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:22,202 INFO L87 Difference]: Start difference. First operand 935 states and 1218 transitions. Second operand 5 states. [2019-09-09 05:46:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:22,510 INFO L93 Difference]: Finished difference Result 937 states and 1218 transitions. [2019-09-09 05:46:22,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:22,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-09-09 05:46:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:22,516 INFO L225 Difference]: With dead ends: 937 [2019-09-09 05:46:22,516 INFO L226 Difference]: Without dead ends: 937 [2019-09-09 05:46:22,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-09-09 05:46:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 935. [2019-09-09 05:46:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-09-09 05:46:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1217 transitions. [2019-09-09 05:46:22,542 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1217 transitions. Word has length 43 [2019-09-09 05:46:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:22,542 INFO L475 AbstractCegarLoop]: Abstraction has 935 states and 1217 transitions. [2019-09-09 05:46:22,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1217 transitions. [2019-09-09 05:46:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-09 05:46:22,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:22,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:22,544 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:22,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1046770881, now seen corresponding path program 1 times [2019-09-09 05:46:22,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:22,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:22,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:22,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:22,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:22,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:22,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:22,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:22,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:22,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:22,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:22,593 INFO L87 Difference]: Start difference. First operand 935 states and 1217 transitions. Second operand 5 states. [2019-09-09 05:46:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:22,622 INFO L93 Difference]: Finished difference Result 948 states and 1229 transitions. [2019-09-09 05:46:22,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:22,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-09 05:46:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:22,628 INFO L225 Difference]: With dead ends: 948 [2019-09-09 05:46:22,629 INFO L226 Difference]: Without dead ends: 933 [2019-09-09 05:46:22,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:22,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-09 05:46:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2019-09-09 05:46:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-09-09 05:46:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1213 transitions. [2019-09-09 05:46:22,655 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1213 transitions. Word has length 44 [2019-09-09 05:46:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:22,657 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1213 transitions. [2019-09-09 05:46:22,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1213 transitions. [2019-09-09 05:46:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:46:22,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:22,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:22,659 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1366251101, now seen corresponding path program 1 times [2019-09-09 05:46:22,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:22,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:22,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:22,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:22,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:22,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:22,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:22,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:22,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:22,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:22,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:22,724 INFO L87 Difference]: Start difference. First operand 933 states and 1213 transitions. Second operand 4 states. [2019-09-09 05:46:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:22,877 INFO L93 Difference]: Finished difference Result 684 states and 852 transitions. [2019-09-09 05:46:22,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:46:22,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-09 05:46:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:22,882 INFO L225 Difference]: With dead ends: 684 [2019-09-09 05:46:22,882 INFO L226 Difference]: Without dead ends: 684 [2019-09-09 05:46:22,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:22,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-09-09 05:46:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 647. [2019-09-09 05:46:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-09 05:46:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 808 transitions. [2019-09-09 05:46:22,906 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 808 transitions. Word has length 49 [2019-09-09 05:46:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:22,906 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 808 transitions. [2019-09-09 05:46:22,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 808 transitions. [2019-09-09 05:46:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:46:22,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:22,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:22,909 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1393689715, now seen corresponding path program 1 times [2019-09-09 05:46:22,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:22,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:22,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:22,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:22,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:22,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:22,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:22,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:22,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:22,973 INFO L87 Difference]: Start difference. First operand 647 states and 808 transitions. Second operand 3 states. [2019-09-09 05:46:23,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:23,030 INFO L93 Difference]: Finished difference Result 655 states and 819 transitions. [2019-09-09 05:46:23,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:23,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-09 05:46:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:23,034 INFO L225 Difference]: With dead ends: 655 [2019-09-09 05:46:23,034 INFO L226 Difference]: Without dead ends: 655 [2019-09-09 05:46:23,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-09 05:46:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-09-09 05:46:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-09 05:46:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 819 transitions. [2019-09-09 05:46:23,071 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 819 transitions. Word has length 55 [2019-09-09 05:46:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:23,071 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 819 transitions. [2019-09-09 05:46:23,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 819 transitions. [2019-09-09 05:46:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-09 05:46:23,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:23,073 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:23,073 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:23,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1429960054, now seen corresponding path program 1 times [2019-09-09 05:46:23,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:23,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:23,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:23,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:23,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:23,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:23,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:23,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:23,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:23,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:23,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:23,123 INFO L87 Difference]: Start difference. First operand 655 states and 819 transitions. Second operand 3 states. [2019-09-09 05:46:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:23,222 INFO L93 Difference]: Finished difference Result 851 states and 1080 transitions. [2019-09-09 05:46:23,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:23,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-09 05:46:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:23,227 INFO L225 Difference]: With dead ends: 851 [2019-09-09 05:46:23,227 INFO L226 Difference]: Without dead ends: 851 [2019-09-09 05:46:23,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-09-09 05:46:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 721. [2019-09-09 05:46:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-09-09 05:46:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 899 transitions. [2019-09-09 05:46:23,249 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 899 transitions. Word has length 52 [2019-09-09 05:46:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:23,249 INFO L475 AbstractCegarLoop]: Abstraction has 721 states and 899 transitions. [2019-09-09 05:46:23,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 899 transitions. [2019-09-09 05:46:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-09 05:46:23,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:23,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:23,252 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:23,253 INFO L82 PathProgramCache]: Analyzing trace with hash -927211119, now seen corresponding path program 1 times [2019-09-09 05:46:23,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:23,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:23,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:23,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:23,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:23,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:23,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:46:23,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:23,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:46:23,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:46:23,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:23,339 INFO L87 Difference]: Start difference. First operand 721 states and 899 transitions. Second operand 8 states. [2019-09-09 05:46:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:23,414 INFO L93 Difference]: Finished difference Result 810 states and 1020 transitions. [2019-09-09 05:46:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:46:23,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-09-09 05:46:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:23,418 INFO L225 Difference]: With dead ends: 810 [2019-09-09 05:46:23,418 INFO L226 Difference]: Without dead ends: 807 [2019-09-09 05:46:23,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:46:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-09-09 05:46:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 768. [2019-09-09 05:46:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-09-09 05:46:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 970 transitions. [2019-09-09 05:46:23,437 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 970 transitions. Word has length 53 [2019-09-09 05:46:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:23,437 INFO L475 AbstractCegarLoop]: Abstraction has 768 states and 970 transitions. [2019-09-09 05:46:23,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:46:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 970 transitions. [2019-09-09 05:46:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-09 05:46:23,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:23,439 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:23,439 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:23,439 INFO L82 PathProgramCache]: Analyzing trace with hash -926934289, now seen corresponding path program 1 times [2019-09-09 05:46:23,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:23,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:23,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:23,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:23,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:23,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-09-09 05:46:23,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:23,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:46:23,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:23,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:46:23,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:46:23,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:23,513 INFO L87 Difference]: Start difference. First operand 768 states and 970 transitions. Second operand 8 states. [2019-09-09 05:46:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:23,683 INFO L93 Difference]: Finished difference Result 795 states and 1001 transitions. [2019-09-09 05:46:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:46:23,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-09-09 05:46:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:23,688 INFO L225 Difference]: With dead ends: 795 [2019-09-09 05:46:23,688 INFO L226 Difference]: Without dead ends: 782 [2019-09-09 05:46:23,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-09-09 05:46:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 774. [2019-09-09 05:46:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-09-09 05:46:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 975 transitions. [2019-09-09 05:46:23,724 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 975 transitions. Word has length 53 [2019-09-09 05:46:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:23,725 INFO L475 AbstractCegarLoop]: Abstraction has 774 states and 975 transitions. [2019-09-09 05:46:23,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:46:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 975 transitions. [2019-09-09 05:46:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-09 05:46:23,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:23,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:23,733 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:23,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:23,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2047432327, now seen corresponding path program 1 times [2019-09-09 05:46:23,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:23,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:23,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:23,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:23,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:23,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:23,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:23,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:23,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:23,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:23,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:23,895 INFO L87 Difference]: Start difference. First operand 774 states and 975 transitions. Second operand 5 states. [2019-09-09 05:46:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:23,913 INFO L93 Difference]: Finished difference Result 755 states and 945 transitions. [2019-09-09 05:46:23,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:23,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-09 05:46:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:23,917 INFO L225 Difference]: With dead ends: 755 [2019-09-09 05:46:23,917 INFO L226 Difference]: Without dead ends: 755 [2019-09-09 05:46:23,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:23,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-09 05:46:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-09-09 05:46:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-09-09 05:46:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 945 transitions. [2019-09-09 05:46:23,935 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 945 transitions. Word has length 61 [2019-09-09 05:46:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:23,935 INFO L475 AbstractCegarLoop]: Abstraction has 755 states and 945 transitions. [2019-09-09 05:46:23,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 945 transitions. [2019-09-09 05:46:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-09 05:46:23,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:23,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:23,937 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:23,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:23,937 INFO L82 PathProgramCache]: Analyzing trace with hash -465967953, now seen corresponding path program 1 times [2019-09-09 05:46:23,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:23,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:23,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:23,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:23,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:23,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:23,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:23,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:23,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:23,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:23,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:23,979 INFO L87 Difference]: Start difference. First operand 755 states and 945 transitions. Second operand 3 states. [2019-09-09 05:46:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:24,028 INFO L93 Difference]: Finished difference Result 850 states and 1057 transitions. [2019-09-09 05:46:24,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:24,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-09 05:46:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:24,033 INFO L225 Difference]: With dead ends: 850 [2019-09-09 05:46:24,033 INFO L226 Difference]: Without dead ends: 841 [2019-09-09 05:46:24,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-09-09 05:46:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 831. [2019-09-09 05:46:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-09 05:46:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1038 transitions. [2019-09-09 05:46:24,054 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1038 transitions. Word has length 54 [2019-09-09 05:46:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:24,054 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1038 transitions. [2019-09-09 05:46:24,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1038 transitions. [2019-09-09 05:46:24,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-09 05:46:24,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:24,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:24,057 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:24,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:24,057 INFO L82 PathProgramCache]: Analyzing trace with hash -609247311, now seen corresponding path program 1 times [2019-09-09 05:46:24,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:24,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:24,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:24,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:24,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:24,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:24,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:24,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:24,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:24,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:24,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:24,116 INFO L87 Difference]: Start difference. First operand 831 states and 1038 transitions. Second operand 7 states. [2019-09-09 05:46:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:24,735 INFO L93 Difference]: Finished difference Result 759 states and 938 transitions. [2019-09-09 05:46:24,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:24,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-09-09 05:46:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:24,740 INFO L225 Difference]: With dead ends: 759 [2019-09-09 05:46:24,740 INFO L226 Difference]: Without dead ends: 759 [2019-09-09 05:46:24,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:46:24,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-09-09 05:46:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 713. [2019-09-09 05:46:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-09-09 05:46:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 881 transitions. [2019-09-09 05:46:24,757 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 881 transitions. Word has length 54 [2019-09-09 05:46:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:24,757 INFO L475 AbstractCegarLoop]: Abstraction has 713 states and 881 transitions. [2019-09-09 05:46:24,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 881 transitions. [2019-09-09 05:46:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-09 05:46:24,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:24,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:24,759 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:24,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1238038488, now seen corresponding path program 1 times [2019-09-09 05:46:24,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:24,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:24,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:24,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:24,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:24,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:24,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:24,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:24,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:24,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:24,814 INFO L87 Difference]: Start difference. First operand 713 states and 881 transitions. Second operand 5 states. [2019-09-09 05:46:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:25,214 INFO L93 Difference]: Finished difference Result 836 states and 1046 transitions. [2019-09-09 05:46:25,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:25,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-09 05:46:25,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:25,218 INFO L225 Difference]: With dead ends: 836 [2019-09-09 05:46:25,219 INFO L226 Difference]: Without dead ends: 836 [2019-09-09 05:46:25,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-09-09 05:46:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 713. [2019-09-09 05:46:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-09-09 05:46:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 879 transitions. [2019-09-09 05:46:25,236 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 879 transitions. Word has length 54 [2019-09-09 05:46:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:25,236 INFO L475 AbstractCegarLoop]: Abstraction has 713 states and 879 transitions. [2019-09-09 05:46:25,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 879 transitions. [2019-09-09 05:46:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:46:25,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:25,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:25,238 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1135904144, now seen corresponding path program 1 times [2019-09-09 05:46:25,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:25,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:25,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:25,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:25,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:25,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:25,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:25,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:25,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:25,288 INFO L87 Difference]: Start difference. First operand 713 states and 879 transitions. Second operand 5 states. [2019-09-09 05:46:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:25,780 INFO L93 Difference]: Finished difference Result 834 states and 1042 transitions. [2019-09-09 05:46:25,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:25,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-09 05:46:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:25,785 INFO L225 Difference]: With dead ends: 834 [2019-09-09 05:46:25,785 INFO L226 Difference]: Without dead ends: 822 [2019-09-09 05:46:25,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-09-09 05:46:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 702. [2019-09-09 05:46:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-09 05:46:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 863 transitions. [2019-09-09 05:46:25,801 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 863 transitions. Word has length 55 [2019-09-09 05:46:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:25,801 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 863 transitions. [2019-09-09 05:46:25,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 863 transitions. [2019-09-09 05:46:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:46:25,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:25,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:25,804 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:25,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:25,804 INFO L82 PathProgramCache]: Analyzing trace with hash 329035060, now seen corresponding path program 1 times [2019-09-09 05:46:25,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:25,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:25,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:25,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:25,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:25,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:25,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:25,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:25,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:25,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:25,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:25,859 INFO L87 Difference]: Start difference. First operand 702 states and 863 transitions. Second operand 6 states. [2019-09-09 05:46:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:25,905 INFO L93 Difference]: Finished difference Result 718 states and 878 transitions. [2019-09-09 05:46:25,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:25,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-09 05:46:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:25,909 INFO L225 Difference]: With dead ends: 718 [2019-09-09 05:46:25,909 INFO L226 Difference]: Without dead ends: 668 [2019-09-09 05:46:25,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-09-09 05:46:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2019-09-09 05:46:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-09 05:46:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 821 transitions. [2019-09-09 05:46:25,924 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 821 transitions. Word has length 57 [2019-09-09 05:46:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:25,924 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 821 transitions. [2019-09-09 05:46:25,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 821 transitions. [2019-09-09 05:46:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-09 05:46:25,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:25,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:25,928 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:25,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:25,929 INFO L82 PathProgramCache]: Analyzing trace with hash 932474003, now seen corresponding path program 1 times [2019-09-09 05:46:25,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:25,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:25,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:25,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:25,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:26,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:26,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:26,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:26,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:26,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:26,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:26,022 INFO L87 Difference]: Start difference. First operand 668 states and 821 transitions. Second operand 5 states. [2019-09-09 05:46:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:26,297 INFO L93 Difference]: Finished difference Result 674 states and 824 transitions. [2019-09-09 05:46:26,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:26,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-09 05:46:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:26,301 INFO L225 Difference]: With dead ends: 674 [2019-09-09 05:46:26,301 INFO L226 Difference]: Without dead ends: 660 [2019-09-09 05:46:26,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-09 05:46:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 648. [2019-09-09 05:46:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-09 05:46:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 793 transitions. [2019-09-09 05:46:26,326 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 793 transitions. Word has length 56 [2019-09-09 05:46:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:26,326 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 793 transitions. [2019-09-09 05:46:26,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 793 transitions. [2019-09-09 05:46:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:46:26,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:26,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:26,329 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:26,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:26,329 INFO L82 PathProgramCache]: Analyzing trace with hash -386931168, now seen corresponding path program 1 times [2019-09-09 05:46:26,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:26,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:26,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:26,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:26,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:26,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:26,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:26,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:26,399 INFO L87 Difference]: Start difference. First operand 648 states and 793 transitions. Second operand 5 states. [2019-09-09 05:46:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:26,661 INFO L93 Difference]: Finished difference Result 648 states and 791 transitions. [2019-09-09 05:46:26,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:26,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-09 05:46:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:26,665 INFO L225 Difference]: With dead ends: 648 [2019-09-09 05:46:26,665 INFO L226 Difference]: Without dead ends: 648 [2019-09-09 05:46:26,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-09 05:46:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-09-09 05:46:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-09 05:46:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 791 transitions. [2019-09-09 05:46:26,684 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 791 transitions. Word has length 65 [2019-09-09 05:46:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:26,686 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 791 transitions. [2019-09-09 05:46:26,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 791 transitions. [2019-09-09 05:46:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-09 05:46:26,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:26,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:26,688 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:26,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1079771977, now seen corresponding path program 1 times [2019-09-09 05:46:26,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:26,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:26,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:26,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:26,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:26,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:26,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:26,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:26,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:26,776 INFO L87 Difference]: Start difference. First operand 648 states and 791 transitions. Second operand 9 states. [2019-09-09 05:46:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:26,931 INFO L93 Difference]: Finished difference Result 674 states and 816 transitions. [2019-09-09 05:46:26,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:26,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-09 05:46:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:26,935 INFO L225 Difference]: With dead ends: 674 [2019-09-09 05:46:26,935 INFO L226 Difference]: Without dead ends: 643 [2019-09-09 05:46:26,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-09 05:46:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-09-09 05:46:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-09 05:46:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 783 transitions. [2019-09-09 05:46:26,950 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 783 transitions. Word has length 59 [2019-09-09 05:46:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:26,950 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 783 transitions. [2019-09-09 05:46:26,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 783 transitions. [2019-09-09 05:46:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-09 05:46:26,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:26,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:26,952 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:26,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:26,953 INFO L82 PathProgramCache]: Analyzing trace with hash -721668768, now seen corresponding path program 1 times [2019-09-09 05:46:26,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:26,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:26,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:26,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:26,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:27,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:27,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:27,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:27,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:27,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:27,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:27,003 INFO L87 Difference]: Start difference. First operand 643 states and 783 transitions. Second operand 3 states. [2019-09-09 05:46:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:27,021 INFO L93 Difference]: Finished difference Result 685 states and 838 transitions. [2019-09-09 05:46:27,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:27,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-09 05:46:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:27,025 INFO L225 Difference]: With dead ends: 685 [2019-09-09 05:46:27,025 INFO L226 Difference]: Without dead ends: 685 [2019-09-09 05:46:27,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-09 05:46:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 643. [2019-09-09 05:46:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-09 05:46:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 783 transitions. [2019-09-09 05:46:27,041 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 783 transitions. Word has length 68 [2019-09-09 05:46:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:27,041 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 783 transitions. [2019-09-09 05:46:27,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 783 transitions. [2019-09-09 05:46:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-09 05:46:27,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:27,045 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:27,045 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:27,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:27,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1272366496, now seen corresponding path program 1 times [2019-09-09 05:46:27,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:27,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:27,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:27,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:27,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:27,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:27,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:27,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:27,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:27,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:27,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:27,157 INFO L87 Difference]: Start difference. First operand 643 states and 783 transitions. Second operand 6 states. [2019-09-09 05:46:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:27,202 INFO L93 Difference]: Finished difference Result 686 states and 835 transitions. [2019-09-09 05:46:27,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:27,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-09 05:46:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:27,206 INFO L225 Difference]: With dead ends: 686 [2019-09-09 05:46:27,206 INFO L226 Difference]: Without dead ends: 686 [2019-09-09 05:46:27,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-09-09 05:46:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 643. [2019-09-09 05:46:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-09 05:46:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 781 transitions. [2019-09-09 05:46:27,220 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 781 transitions. Word has length 68 [2019-09-09 05:46:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:27,221 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 781 transitions. [2019-09-09 05:46:27,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 781 transitions. [2019-09-09 05:46:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-09 05:46:27,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:27,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:27,223 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:27,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2010224933, now seen corresponding path program 1 times [2019-09-09 05:46:27,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:27,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:27,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:27,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:27,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:27,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:27,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:27,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:27,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:27,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:27,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:27,294 INFO L87 Difference]: Start difference. First operand 643 states and 781 transitions. Second operand 9 states. [2019-09-09 05:46:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:27,450 INFO L93 Difference]: Finished difference Result 669 states and 806 transitions. [2019-09-09 05:46:27,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:27,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-09-09 05:46:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:27,454 INFO L225 Difference]: With dead ends: 669 [2019-09-09 05:46:27,454 INFO L226 Difference]: Without dead ends: 637 [2019-09-09 05:46:27,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-09 05:46:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-09-09 05:46:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-09-09 05:46:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 772 transitions. [2019-09-09 05:46:27,468 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 772 transitions. Word has length 60 [2019-09-09 05:46:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:27,469 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 772 transitions. [2019-09-09 05:46:27,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 772 transitions. [2019-09-09 05:46:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-09 05:46:27,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:27,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:27,471 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:27,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:27,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1034651091, now seen corresponding path program 1 times [2019-09-09 05:46:27,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:27,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:27,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:27,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:27,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:27,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:27,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:27,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:27,553 INFO L87 Difference]: Start difference. First operand 637 states and 772 transitions. Second operand 9 states. [2019-09-09 05:46:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:27,694 INFO L93 Difference]: Finished difference Result 663 states and 797 transitions. [2019-09-09 05:46:27,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:27,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-09-09 05:46:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:27,698 INFO L225 Difference]: With dead ends: 663 [2019-09-09 05:46:27,698 INFO L226 Difference]: Without dead ends: 632 [2019-09-09 05:46:27,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:27,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-09 05:46:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-09-09 05:46:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-09 05:46:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 764 transitions. [2019-09-09 05:46:27,712 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 764 transitions. Word has length 60 [2019-09-09 05:46:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:27,712 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 764 transitions. [2019-09-09 05:46:27,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 764 transitions. [2019-09-09 05:46:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-09 05:46:27,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:27,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:27,715 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1955784685, now seen corresponding path program 1 times [2019-09-09 05:46:27,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:27,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:27,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:27,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:27,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:27,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:27,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:27,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:27,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:27,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:27,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:27,828 INFO L87 Difference]: Start difference. First operand 632 states and 764 transitions. Second operand 5 states. [2019-09-09 05:46:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:28,251 INFO L93 Difference]: Finished difference Result 736 states and 891 transitions. [2019-09-09 05:46:28,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:28,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-09 05:46:28,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:28,255 INFO L225 Difference]: With dead ends: 736 [2019-09-09 05:46:28,255 INFO L226 Difference]: Without dead ends: 736 [2019-09-09 05:46:28,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:28,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-09-09 05:46:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 706. [2019-09-09 05:46:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-09 05:46:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 858 transitions. [2019-09-09 05:46:28,271 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 858 transitions. Word has length 67 [2019-09-09 05:46:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:28,272 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 858 transitions. [2019-09-09 05:46:28,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 858 transitions. [2019-09-09 05:46:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:46:28,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:28,274 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:28,274 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:28,274 INFO L82 PathProgramCache]: Analyzing trace with hash -816854438, now seen corresponding path program 1 times [2019-09-09 05:46:28,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:28,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:28,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:28,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:28,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:28,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:28,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:28,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:28,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:28,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:28,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:28,346 INFO L87 Difference]: Start difference. First operand 706 states and 858 transitions. Second operand 9 states. [2019-09-09 05:46:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:28,509 INFO L93 Difference]: Finished difference Result 732 states and 883 transitions. [2019-09-09 05:46:28,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:28,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-09-09 05:46:28,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:28,513 INFO L225 Difference]: With dead ends: 732 [2019-09-09 05:46:28,513 INFO L226 Difference]: Without dead ends: 660 [2019-09-09 05:46:28,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-09 05:46:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-09-09 05:46:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-09 05:46:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 801 transitions. [2019-09-09 05:46:28,529 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 801 transitions. Word has length 64 [2019-09-09 05:46:28,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:28,529 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 801 transitions. [2019-09-09 05:46:28,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 801 transitions. [2019-09-09 05:46:28,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:46:28,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:28,532 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:28,532 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:28,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:28,532 INFO L82 PathProgramCache]: Analyzing trace with hash 258674534, now seen corresponding path program 1 times [2019-09-09 05:46:28,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:28,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:28,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:28,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:28,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:28,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:28,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:28,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:28,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:28,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:28,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:28,691 INFO L87 Difference]: Start difference. First operand 660 states and 801 transitions. Second operand 6 states. [2019-09-09 05:46:29,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:29,360 INFO L93 Difference]: Finished difference Result 695 states and 835 transitions. [2019-09-09 05:46:29,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 05:46:29,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-09-09 05:46:29,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:29,366 INFO L225 Difference]: With dead ends: 695 [2019-09-09 05:46:29,366 INFO L226 Difference]: Without dead ends: 695 [2019-09-09 05:46:29,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:46:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-09-09 05:46:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 644. [2019-09-09 05:46:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-09 05:46:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 773 transitions. [2019-09-09 05:46:29,391 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 773 transitions. Word has length 79 [2019-09-09 05:46:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:29,391 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 773 transitions. [2019-09-09 05:46:29,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 773 transitions. [2019-09-09 05:46:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:46:29,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:29,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:29,396 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:29,397 INFO L82 PathProgramCache]: Analyzing trace with hash 58561833, now seen corresponding path program 1 times [2019-09-09 05:46:29,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:29,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:29,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:29,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:29,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:29,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:29,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:29,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:29,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:29,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:29,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:29,486 INFO L87 Difference]: Start difference. First operand 644 states and 773 transitions. Second operand 6 states. [2019-09-09 05:46:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:29,533 INFO L93 Difference]: Finished difference Result 723 states and 895 transitions. [2019-09-09 05:46:29,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:29,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-09-09 05:46:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:29,545 INFO L225 Difference]: With dead ends: 723 [2019-09-09 05:46:29,545 INFO L226 Difference]: Without dead ends: 723 [2019-09-09 05:46:29,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-09-09 05:46:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 610. [2019-09-09 05:46:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-09 05:46:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 729 transitions. [2019-09-09 05:46:29,562 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 729 transitions. Word has length 80 [2019-09-09 05:46:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:29,563 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 729 transitions. [2019-09-09 05:46:29,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 729 transitions. [2019-09-09 05:46:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-09 05:46:29,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:29,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:29,566 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash -232161523, now seen corresponding path program 1 times [2019-09-09 05:46:29,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:29,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:29,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:29,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:29,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:29,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:29,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:29,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:29,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:29,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:29,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:29,630 INFO L87 Difference]: Start difference. First operand 610 states and 729 transitions. Second operand 5 states. [2019-09-09 05:46:30,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:30,038 INFO L93 Difference]: Finished difference Result 750 states and 878 transitions. [2019-09-09 05:46:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:30,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-09 05:46:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:30,042 INFO L225 Difference]: With dead ends: 750 [2019-09-09 05:46:30,042 INFO L226 Difference]: Without dead ends: 750 [2019-09-09 05:46:30,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:30,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-09-09 05:46:30,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 727. [2019-09-09 05:46:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-09 05:46:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 856 transitions. [2019-09-09 05:46:30,055 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 856 transitions. Word has length 76 [2019-09-09 05:46:30,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:30,056 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 856 transitions. [2019-09-09 05:46:30,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 856 transitions. [2019-09-09 05:46:30,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:46:30,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:30,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:30,058 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:30,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:30,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1162436534, now seen corresponding path program 1 times [2019-09-09 05:46:30,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:30,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:30,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:30,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:30,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:30,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:30,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:30,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:30,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:30,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:30,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:30,147 INFO L87 Difference]: Start difference. First operand 727 states and 856 transitions. Second operand 9 states. [2019-09-09 05:46:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:30,267 INFO L93 Difference]: Finished difference Result 726 states and 854 transitions. [2019-09-09 05:46:30,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:30,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-09 05:46:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:30,272 INFO L225 Difference]: With dead ends: 726 [2019-09-09 05:46:30,272 INFO L226 Difference]: Without dead ends: 446 [2019-09-09 05:46:30,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-09 05:46:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2019-09-09 05:46:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-09 05:46:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 530 transitions. [2019-09-09 05:46:30,282 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 530 transitions. Word has length 77 [2019-09-09 05:46:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:30,283 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 530 transitions. [2019-09-09 05:46:30,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 530 transitions. [2019-09-09 05:46:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-09 05:46:30,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:30,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:30,284 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:30,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:30,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1637607580, now seen corresponding path program 1 times [2019-09-09 05:46:30,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:30,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:30,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:30,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:30,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:30,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:30,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:30,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:30,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:30,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:30,369 INFO L87 Difference]: Start difference. First operand 446 states and 530 transitions. Second operand 9 states. [2019-09-09 05:46:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:30,460 INFO L93 Difference]: Finished difference Result 464 states and 548 transitions. [2019-09-09 05:46:30,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:30,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-09 05:46:30,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:30,462 INFO L225 Difference]: With dead ends: 464 [2019-09-09 05:46:30,462 INFO L226 Difference]: Without dead ends: 446 [2019-09-09 05:46:30,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:46:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-09 05:46:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2019-09-09 05:46:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-09 05:46:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 529 transitions. [2019-09-09 05:46:30,470 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 529 transitions. Word has length 85 [2019-09-09 05:46:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:30,472 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 529 transitions. [2019-09-09 05:46:30,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 529 transitions. [2019-09-09 05:46:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-09 05:46:30,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:30,474 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:30,474 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash -274697648, now seen corresponding path program 1 times [2019-09-09 05:46:30,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:30,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:30,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:30,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:30,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:30,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:30,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:30,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:30,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:30,567 INFO L87 Difference]: Start difference. First operand 446 states and 529 transitions. Second operand 6 states. [2019-09-09 05:46:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:30,600 INFO L93 Difference]: Finished difference Result 442 states and 522 transitions. [2019-09-09 05:46:30,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:30,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-09 05:46:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:30,602 INFO L225 Difference]: With dead ends: 442 [2019-09-09 05:46:30,602 INFO L226 Difference]: Without dead ends: 440 [2019-09-09 05:46:30,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-09-09 05:46:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 387. [2019-09-09 05:46:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-09-09 05:46:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 453 transitions. [2019-09-09 05:46:30,616 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 453 transitions. Word has length 96 [2019-09-09 05:46:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:30,616 INFO L475 AbstractCegarLoop]: Abstraction has 387 states and 453 transitions. [2019-09-09 05:46:30,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 453 transitions. [2019-09-09 05:46:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-09 05:46:30,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:30,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:30,620 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:30,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:30,621 INFO L82 PathProgramCache]: Analyzing trace with hash -742138889, now seen corresponding path program 1 times [2019-09-09 05:46:30,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:30,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:30,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:30,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:30,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:30,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:30,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:30,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:30,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:30,692 INFO L87 Difference]: Start difference. First operand 387 states and 453 transitions. Second operand 7 states. [2019-09-09 05:46:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:30,801 INFO L93 Difference]: Finished difference Result 727 states and 857 transitions. [2019-09-09 05:46:30,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:30,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-09-09 05:46:30,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:30,804 INFO L225 Difference]: With dead ends: 727 [2019-09-09 05:46:30,804 INFO L226 Difference]: Without dead ends: 685 [2019-09-09 05:46:30,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-09 05:46:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 367. [2019-09-09 05:46:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-09 05:46:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 428 transitions. [2019-09-09 05:46:30,812 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 428 transitions. Word has length 96 [2019-09-09 05:46:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:30,813 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 428 transitions. [2019-09-09 05:46:30,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 428 transitions. [2019-09-09 05:46:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:46:30,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:30,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:30,815 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1608566912, now seen corresponding path program 1 times [2019-09-09 05:46:30,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:30,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:30,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:30,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:30,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:30,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-09 05:46:30,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:30,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 05:46:30,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 05:46:30,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:30,940 INFO L87 Difference]: Start difference. First operand 367 states and 428 transitions. Second operand 11 states. [2019-09-09 05:46:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:31,029 INFO L93 Difference]: Finished difference Result 395 states and 457 transitions. [2019-09-09 05:46:31,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 05:46:31,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2019-09-09 05:46:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:31,031 INFO L225 Difference]: With dead ends: 395 [2019-09-09 05:46:31,031 INFO L226 Difference]: Without dead ends: 363 [2019-09-09 05:46:31,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:46:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-09 05:46:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 350. [2019-09-09 05:46:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-09-09 05:46:31,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 405 transitions. [2019-09-09 05:46:31,038 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 405 transitions. Word has length 101 [2019-09-09 05:46:31,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:31,038 INFO L475 AbstractCegarLoop]: Abstraction has 350 states and 405 transitions. [2019-09-09 05:46:31,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 05:46:31,038 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 405 transitions. [2019-09-09 05:46:31,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:46:31,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:31,040 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:31,040 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:31,040 INFO L82 PathProgramCache]: Analyzing trace with hash -18483681, now seen corresponding path program 1 times [2019-09-09 05:46:31,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:31,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:31,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-09 05:46:31,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:31,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:31,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:31,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:31,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:31,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:31,110 INFO L87 Difference]: Start difference. First operand 350 states and 405 transitions. Second operand 6 states. [2019-09-09 05:46:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:31,140 INFO L93 Difference]: Finished difference Result 302 states and 341 transitions. [2019-09-09 05:46:31,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:31,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2019-09-09 05:46:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:31,142 INFO L225 Difference]: With dead ends: 302 [2019-09-09 05:46:31,142 INFO L226 Difference]: Without dead ends: 302 [2019-09-09 05:46:31,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-09 05:46:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 240. [2019-09-09 05:46:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-09 05:46:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 265 transitions. [2019-09-09 05:46:31,146 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 265 transitions. Word has length 110 [2019-09-09 05:46:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:31,147 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 265 transitions. [2019-09-09 05:46:31,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 265 transitions. [2019-09-09 05:46:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-09 05:46:31,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:31,149 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:31,150 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1525235784, now seen corresponding path program 1 times [2019-09-09 05:46:31,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:31,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:31,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-09 05:46:31,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:31,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:31,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:31,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:31,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:31,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:31,273 INFO L87 Difference]: Start difference. First operand 240 states and 265 transitions. Second operand 9 states. [2019-09-09 05:46:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:31,353 INFO L93 Difference]: Finished difference Result 284 states and 322 transitions. [2019-09-09 05:46:31,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:31,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-09 05:46:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:31,354 INFO L225 Difference]: With dead ends: 284 [2019-09-09 05:46:31,355 INFO L226 Difference]: Without dead ends: 284 [2019-09-09 05:46:31,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-09 05:46:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-09 05:46:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:46:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 290 transitions. [2019-09-09 05:46:31,360 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 290 transitions. Word has length 131 [2019-09-09 05:46:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:31,361 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 290 transitions. [2019-09-09 05:46:31,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 290 transitions. [2019-09-09 05:46:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-09 05:46:31,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:31,362 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:31,363 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:31,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:31,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2109636131, now seen corresponding path program 1 times [2019-09-09 05:46:31,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:31,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:31,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-09 05:46:31,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:31,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-09 05:46:31,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:31,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 05:46:31,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 05:46:31,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:46:31,530 INFO L87 Difference]: Start difference. First operand 260 states and 290 transitions. Second operand 13 states. [2019-09-09 05:46:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:31,749 INFO L93 Difference]: Finished difference Result 305 states and 347 transitions. [2019-09-09 05:46:31,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-09 05:46:31,749 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2019-09-09 05:46:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:31,750 INFO L225 Difference]: With dead ends: 305 [2019-09-09 05:46:31,751 INFO L226 Difference]: Without dead ends: 274 [2019-09-09 05:46:31,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-09-09 05:46:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-09 05:46:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 251. [2019-09-09 05:46:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-09 05:46:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 277 transitions. [2019-09-09 05:46:31,757 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 277 transitions. Word has length 132 [2019-09-09 05:46:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:31,757 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 277 transitions. [2019-09-09 05:46:31,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 05:46:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 277 transitions. [2019-09-09 05:46:31,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:46:31,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:31,759 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:31,759 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:31,760 INFO L82 PathProgramCache]: Analyzing trace with hash 144838378, now seen corresponding path program 1 times [2019-09-09 05:46:31,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:46:31,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:31,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:31,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:31,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:31,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:31,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:31,837 INFO L87 Difference]: Start difference. First operand 251 states and 277 transitions. Second operand 5 states. [2019-09-09 05:46:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:31,852 INFO L93 Difference]: Finished difference Result 257 states and 284 transitions. [2019-09-09 05:46:31,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:31,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-09 05:46:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:31,854 INFO L225 Difference]: With dead ends: 257 [2019-09-09 05:46:31,855 INFO L226 Difference]: Without dead ends: 257 [2019-09-09 05:46:31,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-09 05:46:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2019-09-09 05:46:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-09 05:46:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 281 transitions. [2019-09-09 05:46:31,861 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 281 transitions. Word has length 150 [2019-09-09 05:46:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:31,861 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 281 transitions. [2019-09-09 05:46:31,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 281 transitions. [2019-09-09 05:46:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:46:31,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:31,864 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:46:31,864 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:31,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash 326324875, now seen corresponding path program 1 times [2019-09-09 05:46:31,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:31,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-09 05:46:32,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:46:32,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:46:32,039 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2019-09-09 05:46:32,041 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [250], [258], [261], [267], [285], [297], [301], [304], [307], [310], [316], [334], [337], [340], [368], [373], [374], [376], [377], [415], [418], [423], [424], [430], [436], [438], [440], [447], [449], [451], [454], [457], [460], [462], [465], [509], [512], [517], [524], [526], [533], [535], [536], [561], [564], [569], [572], [573], [574], [575], [576], [577], [627], [630], [632], [635], [643], [646], [656], [668], [671], [676], [687], [688], [689], [690], [691], [693], [697], [699], [706], [708], [709], [710], [711], [753], [754], [799], [800], [801], [802], [803], [804], [807], [815], [816], [825], [826], [829], [830], [831], [832], [835], [836], [839], [840], [849], [850], [851], [852], [855], [856], [857], [858], [861], [862], [863] [2019-09-09 05:46:32,114 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:46:32,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:46:32,329 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:46:32,453 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:46:32,455 INFO L272 AbstractInterpreter]: Visited 123 different actions 148 times. Never merged. Never widened. Performed 1157 root evaluator evaluations with a maximum evaluation depth of 9. Performed 1157 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 124 variables. [2019-09-09 05:46:32,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:32,460 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:46:32,859 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 84.7% of their original sizes. [2019-09-09 05:46:32,859 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:46:47,496 INFO L420 sIntCurrentIteration]: We unified 149 AI predicates to 149 [2019-09-09 05:46:47,496 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:46:47,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:46:47,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [107] imperfect sequences [12] total 117 [2019-09-09 05:46:47,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:47,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-09 05:46:47,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-09 05:46:47,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=10874, Unknown=0, NotChecked=0, Total=11342 [2019-09-09 05:46:47,502 INFO L87 Difference]: Start difference. First operand 255 states and 281 transitions. Second operand 107 states. [2019-09-09 05:47:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:57,273 INFO L93 Difference]: Finished difference Result 578 states and 661 transitions. [2019-09-09 05:47:57,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-09 05:47:57,274 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 150 [2019-09-09 05:47:57,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:57,277 INFO L225 Difference]: With dead ends: 578 [2019-09-09 05:47:57,277 INFO L226 Difference]: Without dead ends: 519 [2019-09-09 05:47:57,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4911 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=807, Invalid=19785, Unknown=0, NotChecked=0, Total=20592 [2019-09-09 05:47:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-09 05:47:57,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 450. [2019-09-09 05:47:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-09 05:47:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 502 transitions. [2019-09-09 05:47:57,291 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 502 transitions. Word has length 150 [2019-09-09 05:47:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:57,291 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 502 transitions. [2019-09-09 05:47:57,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-09 05:47:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 502 transitions. [2019-09-09 05:47:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:47:57,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:57,293 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:47:57,294 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:57,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:57,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1461544947, now seen corresponding path program 1 times [2019-09-09 05:47:57,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:57,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:57,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:57,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:57,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-09 05:47:57,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:57,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:47:57,440 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2019-09-09 05:47:57,442 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [252], [258], [261], [267], [285], [297], [301], [304], [307], [310], [316], [334], [337], [340], [368], [373], [374], [376], [377], [415], [418], [423], [424], [430], [436], [438], [440], [447], [449], [451], [454], [457], [460], [462], [465], [509], [512], [517], [524], [526], [533], [535], [536], [561], [564], [569], [572], [573], [574], [575], [576], [577], [627], [630], [632], [635], [643], [646], [656], [668], [671], [676], [687], [688], [689], [690], [691], [693], [697], [699], [706], [708], [709], [710], [711], [753], [754], [799], [800], [801], [802], [803], [804], [807], [815], [816], [825], [826], [829], [830], [831], [832], [835], [836], [839], [840], [849], [850], [851], [852], [855], [856], [857], [858], [861], [862], [863] [2019-09-09 05:47:57,457 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:47:57,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:47:57,495 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:47:57,559 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:47:57,559 INFO L272 AbstractInterpreter]: Visited 123 different actions 148 times. Never merged. Never widened. Performed 1226 root evaluator evaluations with a maximum evaluation depth of 9. Performed 1226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 124 variables. [2019-09-09 05:47:57,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:57,560 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:47:57,759 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 84.7% of their original sizes. [2019-09-09 05:47:57,759 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:48:12,114 INFO L420 sIntCurrentIteration]: We unified 149 AI predicates to 149 [2019-09-09 05:48:12,114 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:48:12,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:48:12,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [107] imperfect sequences [12] total 117 [2019-09-09 05:48:12,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:12,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-09 05:48:12,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-09 05:48:12,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=10871, Unknown=0, NotChecked=0, Total=11342 [2019-09-09 05:48:12,119 INFO L87 Difference]: Start difference. First operand 450 states and 502 transitions. Second operand 107 states. [2019-09-09 05:48:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:59,000 INFO L93 Difference]: Finished difference Result 714 states and 816 transitions. [2019-09-09 05:48:59,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-09 05:48:59,000 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 150 [2019-09-09 05:48:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:59,056 INFO L225 Difference]: With dead ends: 714 [2019-09-09 05:48:59,057 INFO L226 Difference]: Without dead ends: 655 [2019-09-09 05:48:59,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5049 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=810, Invalid=19782, Unknown=0, NotChecked=0, Total=20592 [2019-09-09 05:48:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-09 05:48:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 341. [2019-09-09 05:48:59,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-09 05:48:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 377 transitions. [2019-09-09 05:48:59,072 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 377 transitions. Word has length 150 [2019-09-09 05:48:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:59,072 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 377 transitions. [2019-09-09 05:48:59,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-09 05:48:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 377 transitions. [2019-09-09 05:48:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:48:59,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:59,074 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:48:59,074 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:59,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2073819428, now seen corresponding path program 1 times [2019-09-09 05:48:59,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:59,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:59,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:59,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:59,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-09 05:48:59,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:59,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:59,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-09 05:48:59,215 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [250], [258], [261], [267], [285], [297], [301], [304], [307], [310], [316], [334], [337], [340], [368], [373], [374], [376], [377], [415], [418], [423], [424], [430], [436], [438], [440], [447], [449], [451], [454], [473], [477], [481], [490], [496], [498], [501], [509], [512], [517], [524], [526], [533], [535], [536], [561], [564], [569], [572], [573], [574], [575], [576], [577], [627], [630], [632], [635], [643], [646], [656], [668], [671], [676], [687], [688], [689], [690], [691], [693], [697], [699], [706], [708], [709], [727], [730], [735], [738], [753], [754], [799], [800], [801], [802], [803], [804], [807], [815], [816], [825], [826], [829], [830], [833], [834], [835], [836], [839], [840], [849], [850], [851], [852], [855], [856], [857], [858], [861], [862], [863] [2019-09-09 05:48:59,223 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:59,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:59,258 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:59,300 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:48:59,302 INFO L272 AbstractInterpreter]: Visited 83 different actions 108 times. Never merged. Never widened. Performed 912 root evaluator evaluations with a maximum evaluation depth of 9. Performed 912 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 124 variables. [2019-09-09 05:48:59,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:59,302 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:48:59,487 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 77.37% of their original sizes. [2019-09-09 05:48:59,487 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:49:09,004 INFO L420 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2019-09-09 05:49:09,004 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:49:09,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:49:09,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [79] imperfect sequences [12] total 89 [2019-09-09 05:49:09,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:09,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-09 05:49:09,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-09 05:49:09,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=5865, Unknown=0, NotChecked=0, Total=6162 [2019-09-09 05:49:09,008 INFO L87 Difference]: Start difference. First operand 341 states and 377 transitions. Second operand 79 states. [2019-09-09 05:49:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:37,236 INFO L93 Difference]: Finished difference Result 587 states and 658 transitions. [2019-09-09 05:49:37,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-09 05:49:37,236 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-09-09 05:49:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:37,241 INFO L225 Difference]: With dead ends: 587 [2019-09-09 05:49:37,241 INFO L226 Difference]: Without dead ends: 547 [2019-09-09 05:49:37,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2397 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=461, Invalid=9639, Unknown=0, NotChecked=0, Total=10100 [2019-09-09 05:49:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-09 05:49:37,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 474. [2019-09-09 05:49:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-09-09 05:49:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 525 transitions. [2019-09-09 05:49:37,253 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 525 transitions. Word has length 155 [2019-09-09 05:49:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:37,253 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 525 transitions. [2019-09-09 05:49:37,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-09 05:49:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 525 transitions. [2019-09-09 05:49:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:49:37,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:37,255 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:49:37,255 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:37,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1882860318, now seen corresponding path program 1 times [2019-09-09 05:49:37,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:37,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:37,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:37,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:37,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-09 05:49:37,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:37,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:37,394 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-09 05:49:37,395 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [252], [258], [261], [267], [285], [297], [301], [304], [307], [310], [316], [334], [337], [340], [368], [373], [374], [376], [377], [415], [418], [423], [424], [430], [436], [438], [440], [447], [449], [451], [454], [473], [477], [481], [490], [496], [498], [501], [509], [512], [517], [524], [526], [533], [535], [536], [561], [564], [569], [572], [573], [574], [575], [576], [577], [627], [630], [632], [635], [643], [646], [656], [668], [671], [676], [687], [688], [689], [690], [691], [693], [697], [699], [706], [708], [709], [727], [730], [735], [738], [753], [754], [799], [800], [801], [802], [803], [804], [807], [815], [816], [825], [826], [829], [830], [833], [834], [835], [836], [839], [840], [849], [850], [851], [852], [855], [856], [857], [858], [861], [862], [863] [2019-09-09 05:49:37,398 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:37,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:37,430 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:37,460 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:49:37,461 INFO L272 AbstractInterpreter]: Visited 83 different actions 108 times. Never merged. Never widened. Performed 968 root evaluator evaluations with a maximum evaluation depth of 9. Performed 968 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 124 variables. [2019-09-09 05:49:37,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:37,461 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:49:37,593 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 77.37% of their original sizes. [2019-09-09 05:49:37,593 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:49:47,228 INFO L420 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2019-09-09 05:49:47,229 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:49:47,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:49:47,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [79] imperfect sequences [12] total 89 [2019-09-09 05:49:47,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:47,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-09 05:49:47,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-09 05:49:47,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=5862, Unknown=0, NotChecked=0, Total=6162 [2019-09-09 05:49:47,233 INFO L87 Difference]: Start difference. First operand 474 states and 525 transitions. Second operand 79 states. [2019-09-09 05:50:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:27,015 INFO L93 Difference]: Finished difference Result 575 states and 644 transitions. [2019-09-09 05:50:27,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-09 05:50:27,016 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-09-09 05:50:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:27,018 INFO L225 Difference]: With dead ends: 575 [2019-09-09 05:50:27,019 INFO L226 Difference]: Without dead ends: 535 [2019-09-09 05:50:27,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=464, Invalid=9636, Unknown=0, NotChecked=0, Total=10100 [2019-09-09 05:50:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-09 05:50:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 329. [2019-09-09 05:50:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-09 05:50:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 363 transitions. [2019-09-09 05:50:27,026 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 363 transitions. Word has length 155 [2019-09-09 05:50:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:27,027 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 363 transitions. [2019-09-09 05:50:27,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-09 05:50:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 363 transitions. [2019-09-09 05:50:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:50:27,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:27,029 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:50:27,029 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:27,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash 223545200, now seen corresponding path program 1 times [2019-09-09 05:50:27,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:27,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:27,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:27,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:27,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-09 05:50:27,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:27,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-09 05:50:27,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:27,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 05:50:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 05:50:27,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:50:27,151 INFO L87 Difference]: Start difference. First operand 329 states and 363 transitions. Second operand 10 states. [2019-09-09 05:50:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:28,299 INFO L93 Difference]: Finished difference Result 693 states and 773 transitions. [2019-09-09 05:50:28,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-09 05:50:28,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2019-09-09 05:50:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:28,302 INFO L225 Difference]: With dead ends: 693 [2019-09-09 05:50:28,302 INFO L226 Difference]: Without dead ends: 564 [2019-09-09 05:50:28,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2019-09-09 05:50:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-09 05:50:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 501. [2019-09-09 05:50:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-09 05:50:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 553 transitions. [2019-09-09 05:50:28,312 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 553 transitions. Word has length 158 [2019-09-09 05:50:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:28,312 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 553 transitions. [2019-09-09 05:50:28,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-09 05:50:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 553 transitions. [2019-09-09 05:50:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:50:28,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:28,314 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:50:28,315 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:28,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:28,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2140296462, now seen corresponding path program 1 times [2019-09-09 05:50:28,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:28,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:28,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:28,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:28,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:50:28,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:50:28,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:50:28,513 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-09-09 05:50:28,513 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [252], [258], [261], [267], [285], [297], [301], [304], [307], [310], [316], [334], [337], [340], [368], [373], [374], [376], [377], [378], [389], [393], [403], [406], [411], [414], [415], [418], [423], [424], [430], [436], [438], [440], [447], [449], [451], [454], [473], [477], [481], [490], [494], [509], [512], [517], [524], [526], [533], [535], [536], [561], [564], [569], [572], [573], [574], [575], [576], [577], [627], [630], [632], [635], [643], [646], [648], [651], [656], [658], [668], [671], [676], [687], [688], [689], [690], [691], [693], [697], [699], [702], [704], [708], [709], [753], [754], [799], [800], [801], [802], [803], [804], [807], [815], [816], [825], [826], [829], [830], [835], [836], [839], [840], [849], [850], [851], [852], [855], [856], [857], [858], [859], [860], [861], [862], [863] [2019-09-09 05:50:28,516 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:50:28,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:50:28,537 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:50:28,647 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:50:28,649 INFO L272 AbstractInterpreter]: Visited 76 different actions 171 times. Merged at 12 different actions 26 times. Never widened. Performed 1497 root evaluator evaluations with a maximum evaluation depth of 9. Performed 1497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 123 variables. [2019-09-09 05:50:28,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:28,650 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:50:28,879 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 70.88% of their original sizes. [2019-09-09 05:50:28,880 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:50:37,590 INFO L420 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2019-09-09 05:50:37,591 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:50:37,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:50:37,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [15] total 85 [2019-09-09 05:50:37,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:37,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-09 05:50:37,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-09 05:50:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=4916, Unknown=0, NotChecked=0, Total=5112 [2019-09-09 05:50:37,592 INFO L87 Difference]: Start difference. First operand 501 states and 553 transitions. Second operand 72 states. [2019-09-09 05:51:16,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:51:16,019 INFO L93 Difference]: Finished difference Result 572 states and 632 transitions. [2019-09-09 05:51:16,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-09 05:51:16,019 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 158 [2019-09-09 05:51:16,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:51:16,022 INFO L225 Difference]: With dead ends: 572 [2019-09-09 05:51:16,022 INFO L226 Difference]: Without dead ends: 570 [2019-09-09 05:51:16,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=288, Invalid=7194, Unknown=0, NotChecked=0, Total=7482 [2019-09-09 05:51:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-09 05:51:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 552. [2019-09-09 05:51:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-09 05:51:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 611 transitions. [2019-09-09 05:51:16,040 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 611 transitions. Word has length 158 [2019-09-09 05:51:16,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:51:16,040 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 611 transitions. [2019-09-09 05:51:16,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-09 05:51:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 611 transitions. [2019-09-09 05:51:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:51:16,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:51:16,043 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:51:16,043 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:51:16,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:51:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1598398701, now seen corresponding path program 1 times [2019-09-09 05:51:16,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:51:16,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:16,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:51:16,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:16,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:51:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:51:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-09 05:51:16,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:51:16,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:51:16,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:51:16,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:51:16,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:51:16,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:51:16,142 INFO L87 Difference]: Start difference. First operand 552 states and 611 transitions. Second operand 5 states. [2019-09-09 05:51:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:51:16,162 INFO L93 Difference]: Finished difference Result 557 states and 608 transitions. [2019-09-09 05:51:16,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:51:16,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-09 05:51:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:51:16,166 INFO L225 Difference]: With dead ends: 557 [2019-09-09 05:51:16,166 INFO L226 Difference]: Without dead ends: 530 [2019-09-09 05:51:16,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:51:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-09-09 05:51:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2019-09-09 05:51:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2019-09-09 05:51:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 581 transitions. [2019-09-09 05:51:16,187 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 581 transitions. Word has length 158 [2019-09-09 05:51:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:51:16,187 INFO L475 AbstractCegarLoop]: Abstraction has 530 states and 581 transitions. [2019-09-09 05:51:16,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:51:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 581 transitions. [2019-09-09 05:51:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:51:16,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:51:16,191 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:51:16,191 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:51:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:51:16,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2027926138, now seen corresponding path program 1 times [2019-09-09 05:51:16,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:51:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:16,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:51:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:16,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:51:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:51:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:51:16,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:51:16,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:51:16,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:51:16,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:51:16,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:51:16,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:51:16,425 INFO L87 Difference]: Start difference. First operand 530 states and 581 transitions. Second operand 14 states. [2019-09-09 05:51:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:51:18,004 INFO L93 Difference]: Finished difference Result 605 states and 668 transitions. [2019-09-09 05:51:18,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-09 05:51:18,005 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2019-09-09 05:51:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:51:18,008 INFO L225 Difference]: With dead ends: 605 [2019-09-09 05:51:18,008 INFO L226 Difference]: Without dead ends: 536 [2019-09-09 05:51:18,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-09-09 05:51:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-09 05:51:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 448. [2019-09-09 05:51:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-09 05:51:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 486 transitions. [2019-09-09 05:51:18,021 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 486 transitions. Word has length 159 [2019-09-09 05:51:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:51:18,021 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 486 transitions. [2019-09-09 05:51:18,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:51:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 486 transitions. [2019-09-09 05:51:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:51:18,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:51:18,023 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:51:18,023 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:51:18,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:51:18,023 INFO L82 PathProgramCache]: Analyzing trace with hash -973879413, now seen corresponding path program 1 times [2019-09-09 05:51:18,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:51:18,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:18,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:51:18,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:18,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:51:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:51:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:51:18,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:51:18,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-09 05:51:18,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:51:18,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 05:51:18,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 05:51:18,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:51:18,177 INFO L87 Difference]: Start difference. First operand 448 states and 486 transitions. Second operand 12 states. [2019-09-09 05:51:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:51:18,336 INFO L93 Difference]: Finished difference Result 521 states and 574 transitions. [2019-09-09 05:51:18,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-09 05:51:18,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 161 [2019-09-09 05:51:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:51:18,339 INFO L225 Difference]: With dead ends: 521 [2019-09-09 05:51:18,339 INFO L226 Difference]: Without dead ends: 456 [2019-09-09 05:51:18,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-09 05:51:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-09 05:51:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 436. [2019-09-09 05:51:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-09-09 05:51:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 470 transitions. [2019-09-09 05:51:18,348 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 470 transitions. Word has length 161 [2019-09-09 05:51:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:51:18,348 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 470 transitions. [2019-09-09 05:51:18,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-09 05:51:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 470 transitions. [2019-09-09 05:51:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:51:18,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:51:18,350 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:51:18,351 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:51:18,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:51:18,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1767594586, now seen corresponding path program 1 times [2019-09-09 05:51:18,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:51:18,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:18,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:51:18,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:18,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:51:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:51:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:51:18,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:51:18,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-09 05:51:18,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:51:18,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 05:51:18,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 05:51:18,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:51:18,498 INFO L87 Difference]: Start difference. First operand 436 states and 470 transitions. Second operand 12 states. [2019-09-09 05:51:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:51:18,690 INFO L93 Difference]: Finished difference Result 519 states and 572 transitions. [2019-09-09 05:51:18,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-09 05:51:18,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2019-09-09 05:51:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:51:18,693 INFO L225 Difference]: With dead ends: 519 [2019-09-09 05:51:18,693 INFO L226 Difference]: Without dead ends: 466 [2019-09-09 05:51:18,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-09-09 05:51:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-09 05:51:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 444. [2019-09-09 05:51:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-09-09 05:51:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 478 transitions. [2019-09-09 05:51:18,705 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 478 transitions. Word has length 166 [2019-09-09 05:51:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:51:18,706 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 478 transitions. [2019-09-09 05:51:18,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-09 05:51:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 478 transitions. [2019-09-09 05:51:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:51:18,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:51:18,708 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-09 05:51:18,708 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:51:18,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:51:18,709 INFO L82 PathProgramCache]: Analyzing trace with hash -129330555, now seen corresponding path program 1 times [2019-09-09 05:51:18,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:51:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:18,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:51:18,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:51:18,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:51:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:51:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-09 05:51:18,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:51:18,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:51:18,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:51:18,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:51:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:51:18,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:51:18,833 INFO L87 Difference]: Start difference. First operand 444 states and 478 transitions. Second operand 5 states. [2019-09-09 05:51:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:51:18,869 INFO L93 Difference]: Finished difference Result 366 states and 392 transitions. [2019-09-09 05:51:18,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:51:18,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-09-09 05:51:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:51:18,870 INFO L225 Difference]: With dead ends: 366 [2019-09-09 05:51:18,870 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:51:18,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:51:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:51:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:51:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:51:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:51:18,871 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2019-09-09 05:51:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:51:18,871 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:51:18,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:51:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:51:18,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:51:18,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:51:18 BoogieIcfgContainer [2019-09-09 05:51:18,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:51:18,882 INFO L168 Benchmark]: Toolchain (without parser) took 302812.86 ms. Allocated memory was 133.2 MB in the beginning and 496.5 MB in the end (delta: 363.3 MB). Free memory was 87.5 MB in the beginning and 202.9 MB in the end (delta: -115.4 MB). Peak memory consumption was 248.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:51:18,882 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 05:51:18,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.92 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 87.5 MB in the beginning and 165.0 MB in the end (delta: -77.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:51:18,887 INFO L168 Benchmark]: Boogie Preprocessor took 107.86 ms. Allocated memory is still 200.3 MB. Free memory was 165.0 MB in the beginning and 161.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:51:18,888 INFO L168 Benchmark]: RCFGBuilder took 1355.43 ms. Allocated memory was 200.3 MB in the beginning and 224.9 MB in the end (delta: 24.6 MB). Free memory was 161.3 MB in the beginning and 193.5 MB in the end (delta: -32.2 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:51:18,890 INFO L168 Benchmark]: TraceAbstraction took 300639.29 ms. Allocated memory was 224.9 MB in the beginning and 496.5 MB in the end (delta: 271.6 MB). Free memory was 191.6 MB in the beginning and 202.9 MB in the end (delta: -11.3 MB). Peak memory consumption was 260.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:51:18,899 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 705.92 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 87.5 MB in the beginning and 165.0 MB in the end (delta: -77.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.86 ms. Allocated memory is still 200.3 MB. Free memory was 165.0 MB in the beginning and 161.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1355.43 ms. Allocated memory was 200.3 MB in the beginning and 224.9 MB in the end (delta: 24.6 MB). Free memory was 161.3 MB in the beginning and 193.5 MB in the end (delta: -32.2 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 300639.29 ms. Allocated memory was 224.9 MB in the beginning and 496.5 MB in the end (delta: 271.6 MB). Free memory was 191.6 MB in the beginning and 202.9 MB in the end (delta: -11.3 MB). Peak memory consumption was 260.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 64]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 309 locations, 1 error locations. SAFE Result, 300.5s OverallTime, 55 OverallIterations, 2 TraceHistogramMax, 234.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17476 SDtfs, 11353 SDslu, 67583 SDs, 0 SdLazy, 30719 SolverSat, 2039 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1353 GetRequests, 467 SyntacticMatches, 10 SemanticMatches, 876 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16622 ImplicationChecksByTransitivity, 72.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=950occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 5 AbstIntIterations, 5 AbstIntStrong, 0.9674287400846289 AbsIntWeakeningRatio, 2.2332896461336826 AbsIntAvgWeakeningVarsNumRemoved, 26.128440366972477 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 55 MinimizatonAttempts, 2857 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 4546 NumberOfCodeBlocks, 4546 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 4491 ConstructedInterpolants, 0 QuantifiedInterpolants, 779303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 50 PerfectInterpolantSequences, 367/382 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...