/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:27:22,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:27:22,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:27:22,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:27:22,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:27:22,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:27:22,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:27:22,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:27:22,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:27:22,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:27:22,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:27:22,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:27:22,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:27:22,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:27:22,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:27:22,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:27:22,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:27:22,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:27:22,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:27:22,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:27:22,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:27:22,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:27:22,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:27:22,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:27:22,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:27:22,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:27:22,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:27:22,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:27:22,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:27:22,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:27:22,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:27:22,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:27:22,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:27:22,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:27:22,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:27:22,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:27:22,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:27:22,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:27:22,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:27:22,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:27:22,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:27:22,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:27:22,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:27:22,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:27:22,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:27:22,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:27:22,097 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:27:22,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:27:22,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:27:22,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:27:22,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:27:22,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:27:22,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:27:22,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:27:22,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:27:22,099 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:27:22,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:27:22,099 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:27:22,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:27:22,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:27:22,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:27:22,100 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:27:22,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:27:22,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:27:22,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:27:22,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:27:22,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:27:22,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:27:22,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:27:22,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:27:22,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:27:22,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:27:22,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:27:22,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:27:22,405 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:27:22,405 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:27:22,406 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-11-06 21:27:22,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b258b24/5abcbb9b7e4e42a8bce602b1d2c90b00/FLAG61f564f74 [2019-11-06 21:27:22,949 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:27:22,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-11-06 21:27:22,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b258b24/5abcbb9b7e4e42a8bce602b1d2c90b00/FLAG61f564f74 [2019-11-06 21:27:23,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b258b24/5abcbb9b7e4e42a8bce602b1d2c90b00 [2019-11-06 21:27:23,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:27:23,326 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:27:23,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:27:23,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:27:23,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:27:23,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:23" (1/1) ... [2019-11-06 21:27:23,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b9adc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:23, skipping insertion in model container [2019-11-06 21:27:23,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:23" (1/1) ... [2019-11-06 21:27:23,343 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:27:23,409 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:27:23,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:27:23,769 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:27:23,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:27:23,972 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:27:23,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:23 WrapperNode [2019-11-06 21:27:23,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:27:23,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:27:23,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:27:23,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:27:23,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:23" (1/1) ... [2019-11-06 21:27:23,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:23" (1/1) ... [2019-11-06 21:27:24,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:23" (1/1) ... [2019-11-06 21:27:24,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:23" (1/1) ... [2019-11-06 21:27:24,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:23" (1/1) ... [2019-11-06 21:27:24,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:23" (1/1) ... [2019-11-06 21:27:24,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:23" (1/1) ... [2019-11-06 21:27:24,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:27:24,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:27:24,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:27:24,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:27:24,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:23" (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-11-06 21:27:24,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:27:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:27:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-06 21:27:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-06 21:27:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-11-06 21:27:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-11-06 21:27:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-11-06 21:27:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-11-06 21:27:24,116 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-11-06 21:27:24,116 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-11-06 21:27:24,116 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-11-06 21:27:24,116 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-11-06 21:27:24,116 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-11-06 21:27:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-11-06 21:27:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-11-06 21:27:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-11-06 21:27:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-11-06 21:27:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-11-06 21:27:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-06 21:27:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:27:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-11-06 21:27:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-06 21:27:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-06 21:27:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-06 21:27:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-06 21:27:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-06 21:27:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-11-06 21:27:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:27:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 21:27:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:27:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 21:27:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 21:27:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-11-06 21:27:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-11-06 21:27:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-11-06 21:27:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-11-06 21:27:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-11-06 21:27:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-11-06 21:27:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-11-06 21:27:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-11-06 21:27:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-11-06 21:27:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-11-06 21:27:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-11-06 21:27:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-11-06 21:27:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-11-06 21:27:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-06 21:27:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-06 21:27:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-06 21:27:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-11-06 21:27:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-06 21:27:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-06 21:27:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-06 21:27:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-11-06 21:27:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-11-06 21:27:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-06 21:27:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:27:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-06 21:27:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:27:24,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:27:24,474 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:24,676 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-06 21:27:24,676 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-06 21:27:24,690 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:24,752 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-11-06 21:27:24,752 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-11-06 21:27:24,780 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:24,815 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-06 21:27:24,816 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-06 21:27:24,821 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:24,831 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-06 21:27:24,832 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-06 21:27:25,090 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:25,126 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-11-06 21:27:25,126 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-11-06 21:27:25,161 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:25,198 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-11-06 21:27:25,198 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-11-06 21:27:25,222 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:27:25,223 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 21:27:25,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:25 BoogieIcfgContainer [2019-11-06 21:27:25,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:27:25,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:27:25,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:27:25,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:27:25,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:27:23" (1/3) ... [2019-11-06 21:27:25,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0f14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:25, skipping insertion in model container [2019-11-06 21:27:25,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:23" (2/3) ... [2019-11-06 21:27:25,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0f14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:25, skipping insertion in model container [2019-11-06 21:27:25,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:25" (3/3) ... [2019-11-06 21:27:25,232 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-11-06 21:27:25,242 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:27:25,251 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:27:25,262 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:27:25,290 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:27:25,290 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:27:25,290 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:27:25,291 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:27:25,291 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:27:25,291 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:27:25,291 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:27:25,291 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:27:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2019-11-06 21:27:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:27:25,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:25,325 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:25,326 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:25,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:25,332 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2019-11-06 21:27:25,341 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:25,342 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049805998] [2019-11-06 21:27:25,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:25,757 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049805998] [2019-11-06 21:27:25,758 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:25,758 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:27:25,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91252235] [2019-11-06 21:27:25,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:27:25,769 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:25,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:27:25,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:27:25,785 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 5 states. [2019-11-06 21:27:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:27,209 INFO L93 Difference]: Finished difference Result 576 states and 845 transitions. [2019-11-06 21:27:27,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:27,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-06 21:27:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:27,228 INFO L225 Difference]: With dead ends: 576 [2019-11-06 21:27:27,228 INFO L226 Difference]: Without dead ends: 326 [2019-11-06 21:27:27,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-06 21:27:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2019-11-06 21:27:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-06 21:27:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2019-11-06 21:27:27,363 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2019-11-06 21:27:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:27,364 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2019-11-06 21:27:27,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:27:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2019-11-06 21:27:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:27:27,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:27,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:27,378 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:27,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash -240124352, now seen corresponding path program 1 times [2019-11-06 21:27:27,378 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:27,379 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123595978] [2019-11-06 21:27:27,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:27,760 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123595978] [2019-11-06 21:27:27,761 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:27,761 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:27,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051934063] [2019-11-06 21:27:27,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:27,764 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:27,768 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 6 states. [2019-11-06 21:27:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:30,106 INFO L93 Difference]: Finished difference Result 690 states and 962 transitions. [2019-11-06 21:27:30,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:30,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-06 21:27:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:30,114 INFO L225 Difference]: With dead ends: 690 [2019-11-06 21:27:30,114 INFO L226 Difference]: Without dead ends: 507 [2019-11-06 21:27:30,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-06 21:27:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2019-11-06 21:27:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-06 21:27:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2019-11-06 21:27:30,218 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 25 [2019-11-06 21:27:30,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:30,220 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2019-11-06 21:27:30,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2019-11-06 21:27:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:27:30,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:30,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:30,227 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2018358777, now seen corresponding path program 1 times [2019-11-06 21:27:30,228 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:30,228 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578951260] [2019-11-06 21:27:30,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:30,469 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578951260] [2019-11-06 21:27:30,469 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:30,469 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:30,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206215609] [2019-11-06 21:27:30,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:30,470 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:30,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:30,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:30,471 INFO L87 Difference]: Start difference. First operand 440 states and 608 transitions. Second operand 6 states. [2019-11-06 21:27:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:32,310 INFO L93 Difference]: Finished difference Result 1013 states and 1458 transitions. [2019-11-06 21:27:32,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:32,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-06 21:27:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:32,318 INFO L225 Difference]: With dead ends: 1013 [2019-11-06 21:27:32,318 INFO L226 Difference]: Without dead ends: 690 [2019-11-06 21:27:32,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-11-06 21:27:32,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 618. [2019-11-06 21:27:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-11-06 21:27:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 888 transitions. [2019-11-06 21:27:32,384 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 888 transitions. Word has length 31 [2019-11-06 21:27:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:32,385 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 888 transitions. [2019-11-06 21:27:32,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 888 transitions. [2019-11-06 21:27:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-06 21:27:32,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:32,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:32,387 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:32,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:32,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2019-11-06 21:27:32,388 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:32,388 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784092526] [2019-11-06 21:27:32,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:32,563 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784092526] [2019-11-06 21:27:32,564 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:32,564 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:32,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292775838] [2019-11-06 21:27:32,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:32,565 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:32,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:32,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:32,566 INFO L87 Difference]: Start difference. First operand 618 states and 888 transitions. Second operand 6 states. [2019-11-06 21:27:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:33,721 INFO L93 Difference]: Finished difference Result 665 states and 952 transitions. [2019-11-06 21:27:33,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:33,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-06 21:27:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:33,729 INFO L225 Difference]: With dead ends: 665 [2019-11-06 21:27:33,729 INFO L226 Difference]: Without dead ends: 661 [2019-11-06 21:27:33,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:27:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-11-06 21:27:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2019-11-06 21:27:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-11-06 21:27:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 901 transitions. [2019-11-06 21:27:33,803 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 901 transitions. Word has length 36 [2019-11-06 21:27:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:33,804 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 901 transitions. [2019-11-06 21:27:33,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 901 transitions. [2019-11-06 21:27:33,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 21:27:33,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:33,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:33,809 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:33,811 INFO L82 PathProgramCache]: Analyzing trace with hash -113678377, now seen corresponding path program 1 times [2019-11-06 21:27:33,816 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:33,816 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253835610] [2019-11-06 21:27:33,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:34,031 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253835610] [2019-11-06 21:27:34,032 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:34,032 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:34,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539597885] [2019-11-06 21:27:34,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:34,033 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:34,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:34,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:34,035 INFO L87 Difference]: Start difference. First operand 628 states and 901 transitions. Second operand 8 states. [2019-11-06 21:27:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:35,061 INFO L93 Difference]: Finished difference Result 1186 states and 1751 transitions. [2019-11-06 21:27:35,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:27:35,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-11-06 21:27:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:35,073 INFO L225 Difference]: With dead ends: 1186 [2019-11-06 21:27:35,073 INFO L226 Difference]: Without dead ends: 1167 [2019-11-06 21:27:35,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:27:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2019-11-06 21:27:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1065. [2019-11-06 21:27:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-11-06 21:27:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1584 transitions. [2019-11-06 21:27:35,208 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1584 transitions. Word has length 39 [2019-11-06 21:27:35,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:35,211 INFO L462 AbstractCegarLoop]: Abstraction has 1065 states and 1584 transitions. [2019-11-06 21:27:35,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1584 transitions. [2019-11-06 21:27:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 21:27:35,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:35,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:35,214 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:35,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:35,215 INFO L82 PathProgramCache]: Analyzing trace with hash -128023286, now seen corresponding path program 1 times [2019-11-06 21:27:35,215 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:35,216 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518448585] [2019-11-06 21:27:35,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:35,484 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518448585] [2019-11-06 21:27:35,485 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:35,485 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:35,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913033775] [2019-11-06 21:27:35,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:35,486 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:35,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:35,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:35,487 INFO L87 Difference]: Start difference. First operand 1065 states and 1584 transitions. Second operand 8 states. [2019-11-06 21:27:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:36,318 INFO L93 Difference]: Finished difference Result 1162 states and 1720 transitions. [2019-11-06 21:27:36,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:27:36,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-11-06 21:27:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:36,326 INFO L225 Difference]: With dead ends: 1162 [2019-11-06 21:27:36,326 INFO L226 Difference]: Without dead ends: 1157 [2019-11-06 21:27:36,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:27:36,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-11-06 21:27:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1085. [2019-11-06 21:27:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1085 states. [2019-11-06 21:27:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1606 transitions. [2019-11-06 21:27:36,402 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1606 transitions. Word has length 39 [2019-11-06 21:27:36,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:36,402 INFO L462 AbstractCegarLoop]: Abstraction has 1085 states and 1606 transitions. [2019-11-06 21:27:36,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1606 transitions. [2019-11-06 21:27:36,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 21:27:36,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:36,404 INFO L410 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-11-06 21:27:36,404 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:36,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:36,405 INFO L82 PathProgramCache]: Analyzing trace with hash 778971858, now seen corresponding path program 1 times [2019-11-06 21:27:36,405 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:36,405 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488457943] [2019-11-06 21:27:36,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:36,608 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488457943] [2019-11-06 21:27:36,608 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:36,608 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 21:27:36,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999627996] [2019-11-06 21:27:36,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:27:36,609 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:36,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:27:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:27:36,610 INFO L87 Difference]: Start difference. First operand 1085 states and 1606 transitions. Second operand 10 states. [2019-11-06 21:27:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:37,884 INFO L93 Difference]: Finished difference Result 1170 states and 1730 transitions. [2019-11-06 21:27:37,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:27:37,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-11-06 21:27:37,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:37,897 INFO L225 Difference]: With dead ends: 1170 [2019-11-06 21:27:37,897 INFO L226 Difference]: Without dead ends: 1148 [2019-11-06 21:27:37,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:27:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-06 21:27:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1078. [2019-11-06 21:27:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-11-06 21:27:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1597 transitions. [2019-11-06 21:27:37,986 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1597 transitions. Word has length 40 [2019-11-06 21:27:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:37,986 INFO L462 AbstractCegarLoop]: Abstraction has 1078 states and 1597 transitions. [2019-11-06 21:27:37,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:27:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1597 transitions. [2019-11-06 21:27:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 21:27:37,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:37,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:37,989 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1897332428, now seen corresponding path program 1 times [2019-11-06 21:27:37,990 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:37,990 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991177482] [2019-11-06 21:27:37,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:38,145 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991177482] [2019-11-06 21:27:38,145 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:38,145 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:38,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359532075] [2019-11-06 21:27:38,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:38,146 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:38,147 INFO L87 Difference]: Start difference. First operand 1078 states and 1597 transitions. Second operand 6 states. [2019-11-06 21:27:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:39,163 INFO L93 Difference]: Finished difference Result 1507 states and 2281 transitions. [2019-11-06 21:27:39,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:39,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-06 21:27:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:39,168 INFO L225 Difference]: With dead ends: 1507 [2019-11-06 21:27:39,169 INFO L226 Difference]: Without dead ends: 599 [2019-11-06 21:27:39,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-11-06 21:27:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2019-11-06 21:27:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-06 21:27:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 852 transitions. [2019-11-06 21:27:39,214 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 852 transitions. Word has length 45 [2019-11-06 21:27:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:39,214 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 852 transitions. [2019-11-06 21:27:39,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 852 transitions. [2019-11-06 21:27:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 21:27:39,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:39,216 INFO L410 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-11-06 21:27:39,216 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:39,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:39,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2019-11-06 21:27:39,217 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:39,217 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391978905] [2019-11-06 21:27:39,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:39,516 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391978905] [2019-11-06 21:27:39,518 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:39,518 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-06 21:27:39,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474162457] [2019-11-06 21:27:39,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:27:39,519 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:39,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:27:39,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:27:39,520 INFO L87 Difference]: Start difference. First operand 598 states and 852 transitions. Second operand 15 states. [2019-11-06 21:27:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:42,396 INFO L93 Difference]: Finished difference Result 639 states and 902 transitions. [2019-11-06 21:27:42,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 21:27:42,396 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2019-11-06 21:27:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:42,401 INFO L225 Difference]: With dead ends: 639 [2019-11-06 21:27:42,401 INFO L226 Difference]: Without dead ends: 633 [2019-11-06 21:27:42,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2019-11-06 21:27:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-11-06 21:27:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 598. [2019-11-06 21:27:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-06 21:27:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 851 transitions. [2019-11-06 21:27:42,443 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 851 transitions. Word has length 44 [2019-11-06 21:27:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:42,443 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 851 transitions. [2019-11-06 21:27:42,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:27:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 851 transitions. [2019-11-06 21:27:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 21:27:42,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:42,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:42,445 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:42,445 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2019-11-06 21:27:42,446 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:42,446 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505567280] [2019-11-06 21:27:42,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:42,724 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505567280] [2019-11-06 21:27:42,724 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:42,725 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-06 21:27:42,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355662270] [2019-11-06 21:27:42,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:27:42,726 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:42,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:27:42,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:27:42,727 INFO L87 Difference]: Start difference. First operand 598 states and 851 transitions. Second operand 15 states. [2019-11-06 21:27:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:45,530 INFO L93 Difference]: Finished difference Result 639 states and 900 transitions. [2019-11-06 21:27:45,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 21:27:45,531 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-11-06 21:27:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:45,535 INFO L225 Difference]: With dead ends: 639 [2019-11-06 21:27:45,535 INFO L226 Difference]: Without dead ends: 633 [2019-11-06 21:27:45,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2019-11-06 21:27:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-11-06 21:27:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 598. [2019-11-06 21:27:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-06 21:27:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 850 transitions. [2019-11-06 21:27:45,577 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 850 transitions. Word has length 45 [2019-11-06 21:27:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:45,578 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 850 transitions. [2019-11-06 21:27:45,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:27:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 850 transitions. [2019-11-06 21:27:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-06 21:27:45,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:45,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:45,579 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:45,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:45,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2019-11-06 21:27:45,580 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:45,580 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613101031] [2019-11-06 21:27:45,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:45,815 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613101031] [2019-11-06 21:27:45,815 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:45,815 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 21:27:45,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717850151] [2019-11-06 21:27:45,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:27:45,816 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:45,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:27:45,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:27:45,817 INFO L87 Difference]: Start difference. First operand 598 states and 850 transitions. Second operand 11 states. [2019-11-06 21:27:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:46,783 INFO L93 Difference]: Finished difference Result 633 states and 893 transitions. [2019-11-06 21:27:46,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:27:46,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-11-06 21:27:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:46,788 INFO L225 Difference]: With dead ends: 633 [2019-11-06 21:27:46,788 INFO L226 Difference]: Without dead ends: 608 [2019-11-06 21:27:46,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:27:46,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-11-06 21:27:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2019-11-06 21:27:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-06 21:27:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2019-11-06 21:27:46,833 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 46 [2019-11-06 21:27:46,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:46,833 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2019-11-06 21:27:46,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:27:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2019-11-06 21:27:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-06 21:27:46,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:46,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:46,835 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:46,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:46,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1289582749, now seen corresponding path program 1 times [2019-11-06 21:27:46,835 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:46,835 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840095022] [2019-11-06 21:27:46,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:47,065 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840095022] [2019-11-06 21:27:47,065 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:47,065 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:47,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300504745] [2019-11-06 21:27:47,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:47,067 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:47,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:47,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:47,068 INFO L87 Difference]: Start difference. First operand 596 states and 845 transitions. Second operand 8 states. [2019-11-06 21:27:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:48,107 INFO L93 Difference]: Finished difference Result 834 states and 1234 transitions. [2019-11-06 21:27:48,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:27:48,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-06 21:27:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:48,114 INFO L225 Difference]: With dead ends: 834 [2019-11-06 21:27:48,114 INFO L226 Difference]: Without dead ends: 826 [2019-11-06 21:27:48,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:27:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-11-06 21:27:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2019-11-06 21:27:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-11-06 21:27:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 948 transitions. [2019-11-06 21:27:48,164 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 948 transitions. Word has length 46 [2019-11-06 21:27:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:48,164 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 948 transitions. [2019-11-06 21:27:48,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 948 transitions. [2019-11-06 21:27:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-06 21:27:48,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:48,166 INFO L410 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-11-06 21:27:48,166 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:48,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1713004902, now seen corresponding path program 1 times [2019-11-06 21:27:48,167 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:48,167 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119828848] [2019-11-06 21:27:48,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:48,323 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119828848] [2019-11-06 21:27:48,324 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:48,324 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:48,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949756111] [2019-11-06 21:27:48,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:48,325 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:48,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:48,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:48,326 INFO L87 Difference]: Start difference. First operand 665 states and 948 transitions. Second operand 8 states. [2019-11-06 21:27:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:49,789 INFO L93 Difference]: Finished difference Result 739 states and 1021 transitions. [2019-11-06 21:27:49,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:27:49,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-06 21:27:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:49,792 INFO L225 Difference]: With dead ends: 739 [2019-11-06 21:27:49,792 INFO L226 Difference]: Without dead ends: 462 [2019-11-06 21:27:49,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:27:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-11-06 21:27:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 441. [2019-11-06 21:27:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-06 21:27:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 578 transitions. [2019-11-06 21:27:49,825 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 578 transitions. Word has length 49 [2019-11-06 21:27:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:49,825 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 578 transitions. [2019-11-06 21:27:49,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 578 transitions. [2019-11-06 21:27:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 21:27:49,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:49,826 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:49,827 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:49,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash -869356297, now seen corresponding path program 1 times [2019-11-06 21:27:49,827 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:49,827 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783224142] [2019-11-06 21:27:49,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:50,041 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783224142] [2019-11-06 21:27:50,041 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:50,042 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 21:27:50,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440006249] [2019-11-06 21:27:50,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 21:27:50,042 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:50,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 21:27:50,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:27:50,043 INFO L87 Difference]: Start difference. First operand 441 states and 578 transitions. Second operand 13 states. [2019-11-06 21:27:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:51,029 INFO L93 Difference]: Finished difference Result 457 states and 597 transitions. [2019-11-06 21:27:51,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:27:51,029 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-11-06 21:27:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:51,032 INFO L225 Difference]: With dead ends: 457 [2019-11-06 21:27:51,033 INFO L226 Difference]: Without dead ends: 453 [2019-11-06 21:27:51,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:27:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-06 21:27:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2019-11-06 21:27:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-06 21:27:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-11-06 21:27:51,066 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2019-11-06 21:27:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:51,067 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-11-06 21:27:51,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 21:27:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-11-06 21:27:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 21:27:51,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:51,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:51,068 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:51,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash -869633127, now seen corresponding path program 1 times [2019-11-06 21:27:51,069 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:51,069 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900268287] [2019-11-06 21:27:51,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:51,342 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900268287] [2019-11-06 21:27:51,343 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:51,343 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 21:27:51,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864286077] [2019-11-06 21:27:51,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 21:27:51,344 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:51,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 21:27:51,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:27:51,345 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 13 states. [2019-11-06 21:27:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:52,307 INFO L93 Difference]: Finished difference Result 780 states and 1069 transitions. [2019-11-06 21:27:52,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 21:27:52,307 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-11-06 21:27:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:52,311 INFO L225 Difference]: With dead ends: 780 [2019-11-06 21:27:52,311 INFO L226 Difference]: Without dead ends: 472 [2019-11-06 21:27:52,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:27:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-06 21:27:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 459. [2019-11-06 21:27:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-11-06 21:27:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2019-11-06 21:27:52,345 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 47 [2019-11-06 21:27:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:52,346 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2019-11-06 21:27:52,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 21:27:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2019-11-06 21:27:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-06 21:27:52,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:52,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:52,347 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:52,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1156321742, now seen corresponding path program 1 times [2019-11-06 21:27:52,348 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:52,348 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270396290] [2019-11-06 21:27:52,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:52,829 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270396290] [2019-11-06 21:27:52,829 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:52,829 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-06 21:27:52,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963795908] [2019-11-06 21:27:52,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:27:52,835 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:52,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:27:52,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:27:52,836 INFO L87 Difference]: Start difference. First operand 459 states and 604 transitions. Second operand 15 states. [2019-11-06 21:27:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:55,368 INFO L93 Difference]: Finished difference Result 793 states and 1089 transitions. [2019-11-06 21:27:55,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 21:27:55,369 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-11-06 21:27:55,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:55,373 INFO L225 Difference]: With dead ends: 793 [2019-11-06 21:27:55,373 INFO L226 Difference]: Without dead ends: 482 [2019-11-06 21:27:55,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2019-11-06 21:27:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-06 21:27:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 459. [2019-11-06 21:27:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-11-06 21:27:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2019-11-06 21:27:55,432 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 48 [2019-11-06 21:27:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:55,432 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2019-11-06 21:27:55,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:27:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2019-11-06 21:27:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-06 21:27:55,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:55,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:55,436 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1551268366, now seen corresponding path program 1 times [2019-11-06 21:27:55,437 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:55,438 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190117120] [2019-11-06 21:27:55,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:55,769 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190117120] [2019-11-06 21:27:55,770 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:55,770 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 21:27:55,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333670811] [2019-11-06 21:27:55,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:27:55,771 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:27:55,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:27:55,772 INFO L87 Difference]: Start difference. First operand 459 states and 604 transitions. Second operand 10 states. [2019-11-06 21:27:56,681 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-11-06 21:27:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:57,844 INFO L93 Difference]: Finished difference Result 592 states and 811 transitions. [2019-11-06 21:27:57,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 21:27:57,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2019-11-06 21:27:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:57,849 INFO L225 Difference]: With dead ends: 592 [2019-11-06 21:27:57,849 INFO L226 Difference]: Without dead ends: 573 [2019-11-06 21:27:57,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:27:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-11-06 21:27:57,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 444. [2019-11-06 21:27:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-11-06 21:27:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 583 transitions. [2019-11-06 21:27:57,907 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 583 transitions. Word has length 48 [2019-11-06 21:27:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:57,908 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 583 transitions. [2019-11-06 21:27:57,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:27:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 583 transitions. [2019-11-06 21:27:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-06 21:27:57,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:57,910 INFO L410 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-11-06 21:27:57,910 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:57,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1985376582, now seen corresponding path program 1 times [2019-11-06 21:27:57,911 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:57,911 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392869807] [2019-11-06 21:27:57,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat