java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:46:29,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:46:29,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:46:29,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:46:29,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:46:29,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:46:29,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:46:29,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:46:29,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:46:29,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:46:29,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:46:29,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:46:29,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:46:29,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:46:29,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:46:29,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:46:29,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:46:29,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:46:29,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:46:29,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:46:29,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:46:29,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:46:29,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:46:29,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:46:29,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:46:29,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:46:29,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:46:29,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:46:29,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:46:29,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:46:29,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:46:29,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:46:29,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:46:29,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:46:29,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:46:29,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:46:29,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:46:29,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:46:29,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:46:29,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:46:29,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:46:29,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:46:29,737 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:46:29,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:46:29,738 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:46:29,738 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:46:29,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:46:29,739 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:46:29,739 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:46:29,740 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:46:29,740 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:46:29,740 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:46:29,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:46:29,741 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:46:29,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:46:29,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:46:29,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:46:29,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:46:29,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:46:29,742 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:46:29,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:46:29,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:46:29,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:46:29,743 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:46:29,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:46:29,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:46:29,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:46:29,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:46:29,745 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:46:29,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:46:29,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:46:29,746 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:46:29,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:46:29,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:46:29,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:46:29,807 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:46:29,808 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:46:29,809 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-09-09 05:46:29,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4536a8227/1ade9a9999f0474aa0365b2c69da7ea6/FLAGec88df643 [2019-09-09 05:46:30,435 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:46:30,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-09-09 05:46:30,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4536a8227/1ade9a9999f0474aa0365b2c69da7ea6/FLAGec88df643 [2019-09-09 05:46:30,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4536a8227/1ade9a9999f0474aa0365b2c69da7ea6 [2019-09-09 05:46:30,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:46:30,895 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:46:30,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:46:30,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:46:30,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:46:30,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:46:30" (1/1) ... [2019-09-09 05:46:30,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b76698c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:30, skipping insertion in model container [2019-09-09 05:46:30,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:46:30" (1/1) ... [2019-09-09 05:46:30,910 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:46:30,985 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:46:31,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:46:31,458 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:46:31,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:46:31,609 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:46:31,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31 WrapperNode [2019-09-09 05:46:31,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:46:31,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:46:31,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:46:31,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:46:31,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:46:31,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:46:31,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:46:31,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:46:31,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:46:31,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:46:31,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:46:31,811 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-09 05:46:31,811 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-09-09 05:46:31,811 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-09-09 05:46:31,811 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-09-09 05:46:31,812 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-09-09 05:46:31,812 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-09-09 05:46:31,812 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-09-09 05:46:31,812 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-09-09 05:46:31,812 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-09 05:46:31,812 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:46:31,813 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-09 05:46:31,813 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-09-09 05:46:31,813 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-09-09 05:46:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-09-09 05:46:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-09-09 05:46:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-09 05:46:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-09 05:46:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-09 05:46:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-09 05:46:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-09 05:46:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-09-09 05:46:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-09-09 05:46:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-09 05:46:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-09-09 05:46:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2019-09-09 05:46:31,816 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2019-09-09 05:46:31,816 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2019-09-09 05:46:31,816 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-09 05:46:31,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:46:31,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:46:31,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:46:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:46:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:46:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-09-09 05:46:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-09-09 05:46:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-09-09 05:46:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-09-09 05:46:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-09-09 05:46:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-09-09 05:46:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-09 05:46:31,817 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-09-09 05:46:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-09-09 05:46:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-09-09 05:46:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-09-09 05:46:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-09 05:46:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-09 05:46:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-09 05:46:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-09-09 05:46:31,818 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-09-09 05:46:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-09 05:46:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-09-09 05:46:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2019-09-09 05:46:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2019-09-09 05:46:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2019-09-09 05:46:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-09 05:46:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-09 05:46:31,819 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-09 05:46:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-09-09 05:46:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-09 05:46:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:46:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-09 05:46:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:46:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:46:32,159 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,230 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:32,230 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:32,241 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,266 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:32,266 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:32,277 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,493 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-09-09 05:46:32,494 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-09-09 05:46:32,496 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,593 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-09-09 05:46:32,594 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-09-09 05:46:32,610 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,634 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-09 05:46:32,634 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-09 05:46:32,732 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,765 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:32,766 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:32,766 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,775 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:32,776 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:32,776 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,785 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:32,786 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:32,827 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,863 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-09 05:46:32,863 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-09 05:46:32,866 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,985 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2019-09-09 05:46:32,985 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2019-09-09 05:46:33,027 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:33,033 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:33,034 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:33,034 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:33,041 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:33,042 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:33,042 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:33,048 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:46:33,048 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:46:33,059 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:46:33,059 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:46:33,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:46:33 BoogieIcfgContainer [2019-09-09 05:46:33,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:46:33,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:46:33,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:46:33,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:46:33,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:46:30" (1/3) ... [2019-09-09 05:46:33,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c474bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:46:33, skipping insertion in model container [2019-09-09 05:46:33,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (2/3) ... [2019-09-09 05:46:33,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c474bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:46:33, skipping insertion in model container [2019-09-09 05:46:33,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:46:33" (3/3) ... [2019-09-09 05:46:33,069 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-09-09 05:46:33,080 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:46:33,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:46:33,104 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:46:33,128 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:46:33,129 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:46:33,129 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:46:33,129 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:46:33,129 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:46:33,129 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:46:33,129 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:46:33,129 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:46:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states. [2019-09-09 05:46:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:46:33,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:33,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:33,171 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash 513471565, now seen corresponding path program 1 times [2019-09-09 05:46:33,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:33,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:33,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:33,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:33,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:33,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:33,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:33,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:33,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:33,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:33,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:33,522 INFO L87 Difference]: Start difference. First operand 389 states. Second operand 3 states. [2019-09-09 05:46:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:33,641 INFO L93 Difference]: Finished difference Result 388 states and 539 transitions. [2019-09-09 05:46:33,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:33,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:46:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:33,683 INFO L225 Difference]: With dead ends: 388 [2019-09-09 05:46:33,683 INFO L226 Difference]: Without dead ends: 380 [2019-09-09 05:46:33,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:33,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-09 05:46:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-09-09 05:46:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-09 05:46:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2019-09-09 05:46:33,838 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2019-09-09 05:46:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:33,839 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2019-09-09 05:46:33,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2019-09-09 05:46:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:46:33,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:33,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:33,845 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:33,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:33,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2120474792, now seen corresponding path program 1 times [2019-09-09 05:46:33,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:33,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:33,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:33,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:34,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:34,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:34,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:34,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:34,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:34,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:34,031 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand 3 states. [2019-09-09 05:46:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:34,279 INFO L93 Difference]: Finished difference Result 537 states and 728 transitions. [2019-09-09 05:46:34,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:34,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:46:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:34,291 INFO L225 Difference]: With dead ends: 537 [2019-09-09 05:46:34,291 INFO L226 Difference]: Without dead ends: 536 [2019-09-09 05:46:34,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-09 05:46:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 519. [2019-09-09 05:46:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-09 05:46:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 706 transitions. [2019-09-09 05:46:34,344 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 706 transitions. Word has length 25 [2019-09-09 05:46:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:34,345 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 706 transitions. [2019-09-09 05:46:34,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 706 transitions. [2019-09-09 05:46:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:46:34,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:34,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:34,347 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1525052010, now seen corresponding path program 1 times [2019-09-09 05:46:34,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:34,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:34,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:34,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:34,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:34,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:34,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:34,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:34,508 INFO L87 Difference]: Start difference. First operand 519 states and 706 transitions. Second operand 3 states. [2019-09-09 05:46:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:34,551 INFO L93 Difference]: Finished difference Result 623 states and 832 transitions. [2019-09-09 05:46:34,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:34,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 05:46:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:34,557 INFO L225 Difference]: With dead ends: 623 [2019-09-09 05:46:34,557 INFO L226 Difference]: Without dead ends: 623 [2019-09-09 05:46:34,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-09 05:46:34,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 577. [2019-09-09 05:46:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-09 05:46:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 780 transitions. [2019-09-09 05:46:34,589 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 780 transitions. Word has length 31 [2019-09-09 05:46:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:34,589 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 780 transitions. [2019-09-09 05:46:34,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 780 transitions. [2019-09-09 05:46:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-09 05:46:34,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:34,592 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:34,592 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:34,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1803096900, now seen corresponding path program 1 times [2019-09-09 05:46:34,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:34,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:34,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:34,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:34,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:34,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:34,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:34,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:34,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:34,682 INFO L87 Difference]: Start difference. First operand 577 states and 780 transitions. Second operand 3 states. [2019-09-09 05:46:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:34,732 INFO L93 Difference]: Finished difference Result 788 states and 1063 transitions. [2019-09-09 05:46:34,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:34,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-09 05:46:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:34,739 INFO L225 Difference]: With dead ends: 788 [2019-09-09 05:46:34,740 INFO L226 Difference]: Without dead ends: 788 [2019-09-09 05:46:34,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-09 05:46:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 759. [2019-09-09 05:46:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-09 05:46:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1030 transitions. [2019-09-09 05:46:34,776 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1030 transitions. Word has length 33 [2019-09-09 05:46:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:34,777 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1030 transitions. [2019-09-09 05:46:34,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1030 transitions. [2019-09-09 05:46:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-09 05:46:34,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:34,780 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:34,780 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1275107652, now seen corresponding path program 1 times [2019-09-09 05:46:34,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:34,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:34,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:34,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:34,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:34,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:34,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:34,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:34,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:34,821 INFO L87 Difference]: Start difference. First operand 759 states and 1030 transitions. Second operand 3 states. [2019-09-09 05:46:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:34,912 INFO L93 Difference]: Finished difference Result 790 states and 1066 transitions. [2019-09-09 05:46:34,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:34,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-09 05:46:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:34,918 INFO L225 Difference]: With dead ends: 790 [2019-09-09 05:46:34,918 INFO L226 Difference]: Without dead ends: 790 [2019-09-09 05:46:34,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:34,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-09-09 05:46:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-09-09 05:46:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-09-09 05:46:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1065 transitions. [2019-09-09 05:46:34,946 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1065 transitions. Word has length 39 [2019-09-09 05:46:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:34,947 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 1065 transitions. [2019-09-09 05:46:34,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1065 transitions. [2019-09-09 05:46:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-09 05:46:34,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:34,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:34,950 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1074736541, now seen corresponding path program 1 times [2019-09-09 05:46:34,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:34,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:34,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:35,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:35,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:35,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:35,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:35,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:35,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:35,039 INFO L87 Difference]: Start difference. First operand 788 states and 1065 transitions. Second operand 3 states. [2019-09-09 05:46:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:35,152 INFO L93 Difference]: Finished difference Result 800 states and 1081 transitions. [2019-09-09 05:46:35,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:35,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-09-09 05:46:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:35,159 INFO L225 Difference]: With dead ends: 800 [2019-09-09 05:46:35,160 INFO L226 Difference]: Without dead ends: 800 [2019-09-09 05:46:35,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-09-09 05:46:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 799. [2019-09-09 05:46:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-09-09 05:46:35,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1079 transitions. [2019-09-09 05:46:35,188 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1079 transitions. Word has length 38 [2019-09-09 05:46:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:35,188 INFO L475 AbstractCegarLoop]: Abstraction has 799 states and 1079 transitions. [2019-09-09 05:46:35,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1079 transitions. [2019-09-09 05:46:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-09 05:46:35,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:35,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:35,191 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:35,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1033738490, now seen corresponding path program 1 times [2019-09-09 05:46:35,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:35,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:35,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:35,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:35,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:35,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:35,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:35,236 INFO L87 Difference]: Start difference. First operand 799 states and 1079 transitions. Second operand 5 states. [2019-09-09 05:46:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:35,281 INFO L93 Difference]: Finished difference Result 809 states and 1090 transitions. [2019-09-09 05:46:35,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:35,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-09-09 05:46:35,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:35,286 INFO L225 Difference]: With dead ends: 809 [2019-09-09 05:46:35,287 INFO L226 Difference]: Without dead ends: 797 [2019-09-09 05:46:35,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-09-09 05:46:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-09-09 05:46:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-09-09 05:46:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1075 transitions. [2019-09-09 05:46:35,313 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1075 transitions. Word has length 39 [2019-09-09 05:46:35,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:35,314 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 1075 transitions. [2019-09-09 05:46:35,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1075 transitions. [2019-09-09 05:46:35,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-09 05:46:35,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:35,315 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:35,316 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:35,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1325280387, now seen corresponding path program 1 times [2019-09-09 05:46:35,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:35,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:35,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:35,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:35,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:35,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:35,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:35,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:35,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:35,385 INFO L87 Difference]: Start difference. First operand 797 states and 1075 transitions. Second operand 5 states. [2019-09-09 05:46:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:35,431 INFO L93 Difference]: Finished difference Result 807 states and 1086 transitions. [2019-09-09 05:46:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:35,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-09-09 05:46:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:35,436 INFO L225 Difference]: With dead ends: 807 [2019-09-09 05:46:35,437 INFO L226 Difference]: Without dead ends: 790 [2019-09-09 05:46:35,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-09-09 05:46:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-09-09 05:46:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-09-09 05:46:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-09-09 05:46:35,461 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 40 [2019-09-09 05:46:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:35,462 INFO L475 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-09-09 05:46:35,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-09-09 05:46:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-09 05:46:35,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:35,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:35,464 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:35,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:35,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1677893832, now seen corresponding path program 1 times [2019-09-09 05:46:35,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:35,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:35,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:35,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:35,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:35,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:35,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:35,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:35,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:35,506 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-09-09 05:46:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:35,620 INFO L93 Difference]: Finished difference Result 1165 states and 1583 transitions. [2019-09-09 05:46:35,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:35,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-09 05:46:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:35,627 INFO L225 Difference]: With dead ends: 1165 [2019-09-09 05:46:35,627 INFO L226 Difference]: Without dead ends: 1165 [2019-09-09 05:46:35,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-09-09 05:46:35,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 913. [2019-09-09 05:46:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-09-09 05:46:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1235 transitions. [2019-09-09 05:46:35,665 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1235 transitions. Word has length 44 [2019-09-09 05:46:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:35,666 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1235 transitions. [2019-09-09 05:46:35,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1235 transitions. [2019-09-09 05:46:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-09 05:46:35,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:35,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:35,669 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2097381887, now seen corresponding path program 1 times [2019-09-09 05:46:35,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:35,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:35,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:35,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:35,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:35,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:35,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:35,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:35,741 INFO L87 Difference]: Start difference. First operand 913 states and 1235 transitions. Second operand 5 states. [2019-09-09 05:46:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:36,141 INFO L93 Difference]: Finished difference Result 915 states and 1235 transitions. [2019-09-09 05:46:36,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:36,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-09-09 05:46:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:36,147 INFO L225 Difference]: With dead ends: 915 [2019-09-09 05:46:36,148 INFO L226 Difference]: Without dead ends: 915 [2019-09-09 05:46:36,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-09 05:46:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2019-09-09 05:46:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-09-09 05:46:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1234 transitions. [2019-09-09 05:46:36,179 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1234 transitions. Word has length 43 [2019-09-09 05:46:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:36,180 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1234 transitions. [2019-09-09 05:46:36,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1234 transitions. [2019-09-09 05:46:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-09 05:46:36,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:36,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:36,183 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:36,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:36,183 INFO L82 PathProgramCache]: Analyzing trace with hash 667497540, now seen corresponding path program 1 times [2019-09-09 05:46:36,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:36,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:36,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:36,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:36,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:36,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:36,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:36,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:36,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:36,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:36,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:36,285 INFO L87 Difference]: Start difference. First operand 913 states and 1234 transitions. Second operand 4 states. [2019-09-09 05:46:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:36,341 INFO L93 Difference]: Finished difference Result 919 states and 1241 transitions. [2019-09-09 05:46:36,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:46:36,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-09-09 05:46:36,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:36,347 INFO L225 Difference]: With dead ends: 919 [2019-09-09 05:46:36,347 INFO L226 Difference]: Without dead ends: 919 [2019-09-09 05:46:36,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-09 05:46:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 915. [2019-09-09 05:46:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-09-09 05:46:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1236 transitions. [2019-09-09 05:46:36,373 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1236 transitions. Word has length 42 [2019-09-09 05:46:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:36,374 INFO L475 AbstractCegarLoop]: Abstraction has 915 states and 1236 transitions. [2019-09-09 05:46:36,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1236 transitions. [2019-09-09 05:46:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-09 05:46:36,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:36,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:36,376 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:36,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:36,376 INFO L82 PathProgramCache]: Analyzing trace with hash 237043572, now seen corresponding path program 1 times [2019-09-09 05:46:36,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:36,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:36,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:36,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:36,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:36,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:36,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:36,472 INFO L87 Difference]: Start difference. First operand 915 states and 1236 transitions. Second operand 5 states. [2019-09-09 05:46:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:37,179 INFO L93 Difference]: Finished difference Result 1088 states and 1459 transitions. [2019-09-09 05:46:37,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:37,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-09 05:46:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:37,186 INFO L225 Difference]: With dead ends: 1088 [2019-09-09 05:46:37,186 INFO L226 Difference]: Without dead ends: 1088 [2019-09-09 05:46:37,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-09 05:46:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 906. [2019-09-09 05:46:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-09 05:46:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1215 transitions. [2019-09-09 05:46:37,219 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1215 transitions. Word has length 45 [2019-09-09 05:46:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:37,219 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1215 transitions. [2019-09-09 05:46:37,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1215 transitions. [2019-09-09 05:46:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-09 05:46:37,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:37,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:37,221 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash -266291307, now seen corresponding path program 1 times [2019-09-09 05:46:37,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:37,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:37,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:37,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:37,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:37,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:37,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:37,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:37,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:37,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:37,297 INFO L87 Difference]: Start difference. First operand 906 states and 1215 transitions. Second operand 5 states. [2019-09-09 05:46:37,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:37,775 INFO L93 Difference]: Finished difference Result 908 states and 1215 transitions. [2019-09-09 05:46:37,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:37,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-09 05:46:37,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:37,780 INFO L225 Difference]: With dead ends: 908 [2019-09-09 05:46:37,780 INFO L226 Difference]: Without dead ends: 908 [2019-09-09 05:46:37,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-09-09 05:46:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 906. [2019-09-09 05:46:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-09 05:46:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-09-09 05:46:37,806 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 44 [2019-09-09 05:46:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:37,806 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-09-09 05:46:37,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-09-09 05:46:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-09 05:46:37,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:37,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:37,809 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:37,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2124566473, now seen corresponding path program 1 times [2019-09-09 05:46:37,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:37,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:37,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:37,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:37,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:37,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:37,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:37,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:37,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:37,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:37,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:37,854 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 4 states. [2019-09-09 05:46:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:37,909 INFO L93 Difference]: Finished difference Result 912 states and 1221 transitions. [2019-09-09 05:46:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:46:37,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-09-09 05:46:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:37,915 INFO L225 Difference]: With dead ends: 912 [2019-09-09 05:46:37,915 INFO L226 Difference]: Without dead ends: 912 [2019-09-09 05:46:37,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-09 05:46:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 906. [2019-09-09 05:46:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-09 05:46:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-09-09 05:46:37,939 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 43 [2019-09-09 05:46:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:37,940 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-09-09 05:46:37,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-09-09 05:46:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-09 05:46:37,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:37,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:37,942 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:37,943 INFO L82 PathProgramCache]: Analyzing trace with hash 418451048, now seen corresponding path program 1 times [2019-09-09 05:46:37,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:37,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:37,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:37,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:37,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:37,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:37,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:37,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:37,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:37,994 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 5 states. [2019-09-09 05:46:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:38,028 INFO L93 Difference]: Finished difference Result 919 states and 1226 transitions. [2019-09-09 05:46:38,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:38,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-09 05:46:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:38,034 INFO L225 Difference]: With dead ends: 919 [2019-09-09 05:46:38,034 INFO L226 Difference]: Without dead ends: 904 [2019-09-09 05:46:38,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-09-09 05:46:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2019-09-09 05:46:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-09 05:46:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1210 transitions. [2019-09-09 05:46:38,060 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1210 transitions. Word has length 45 [2019-09-09 05:46:38,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:38,060 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1210 transitions. [2019-09-09 05:46:38,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1210 transitions. [2019-09-09 05:46:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-09 05:46:38,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:38,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:38,063 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:38,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:38,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1008250026, now seen corresponding path program 1 times [2019-09-09 05:46:38,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:38,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:38,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:38,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:38,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:38,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:38,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:38,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:38,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:38,120 INFO L87 Difference]: Start difference. First operand 904 states and 1210 transitions. Second operand 3 states. [2019-09-09 05:46:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:38,168 INFO L93 Difference]: Finished difference Result 919 states and 1220 transitions. [2019-09-09 05:46:38,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:38,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-09 05:46:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:38,176 INFO L225 Difference]: With dead ends: 919 [2019-09-09 05:46:38,176 INFO L226 Difference]: Without dead ends: 868 [2019-09-09 05:46:38,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-09-09 05:46:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 865. [2019-09-09 05:46:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-09-09 05:46:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1159 transitions. [2019-09-09 05:46:38,211 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1159 transitions. Word has length 46 [2019-09-09 05:46:38,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:38,211 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1159 transitions. [2019-09-09 05:46:38,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1159 transitions. [2019-09-09 05:46:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-09 05:46:38,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:38,214 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:38,214 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:38,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1391552118, now seen corresponding path program 1 times [2019-09-09 05:46:38,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:38,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:38,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:38,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:38,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:38,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:38,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:38,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:38,300 INFO L87 Difference]: Start difference. First operand 865 states and 1159 transitions. Second operand 5 states. [2019-09-09 05:46:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:38,344 INFO L93 Difference]: Finished difference Result 878 states and 1171 transitions. [2019-09-09 05:46:38,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:38,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-09-09 05:46:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:38,350 INFO L225 Difference]: With dead ends: 878 [2019-09-09 05:46:38,350 INFO L226 Difference]: Without dead ends: 863 [2019-09-09 05:46:38,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-09 05:46:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-09-09 05:46:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-09 05:46:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1155 transitions. [2019-09-09 05:46:38,387 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1155 transitions. Word has length 47 [2019-09-09 05:46:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:38,387 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1155 transitions. [2019-09-09 05:46:38,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1155 transitions. [2019-09-09 05:46:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-09 05:46:38,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:38,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:38,394 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:38,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:38,395 INFO L82 PathProgramCache]: Analyzing trace with hash 868426094, now seen corresponding path program 1 times [2019-09-09 05:46:38,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:38,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:38,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:38,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:38,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:38,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:38,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:38,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:38,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:38,469 INFO L87 Difference]: Start difference. First operand 863 states and 1155 transitions. Second operand 4 states. [2019-09-09 05:46:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:38,731 INFO L93 Difference]: Finished difference Result 614 states and 795 transitions. [2019-09-09 05:46:38,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:46:38,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-09-09 05:46:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:38,735 INFO L225 Difference]: With dead ends: 614 [2019-09-09 05:46:38,735 INFO L226 Difference]: Without dead ends: 614 [2019-09-09 05:46:38,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-09 05:46:38,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 577. [2019-09-09 05:46:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-09 05:46:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 748 transitions. [2019-09-09 05:46:38,753 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 748 transitions. Word has length 52 [2019-09-09 05:46:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:38,753 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 748 transitions. [2019-09-09 05:46:38,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 748 transitions. [2019-09-09 05:46:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:46:38,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:38,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:38,756 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:38,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:38,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1378147806, now seen corresponding path program 1 times [2019-09-09 05:46:38,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:38,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:38,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:38,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:38,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:38,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:38,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:38,842 INFO L87 Difference]: Start difference. First operand 577 states and 748 transitions. Second operand 6 states. [2019-09-09 05:46:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:38,918 INFO L93 Difference]: Finished difference Result 594 states and 765 transitions. [2019-09-09 05:46:38,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:38,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-09-09 05:46:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:38,923 INFO L225 Difference]: With dead ends: 594 [2019-09-09 05:46:38,923 INFO L226 Difference]: Without dead ends: 577 [2019-09-09 05:46:38,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:38,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-09 05:46:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-09-09 05:46:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-09 05:46:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 736 transitions. [2019-09-09 05:46:38,940 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 736 transitions. Word has length 50 [2019-09-09 05:46:38,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:38,940 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 736 transitions. [2019-09-09 05:46:38,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 736 transitions. [2019-09-09 05:46:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:46:38,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:38,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:38,950 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:38,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:38,950 INFO L82 PathProgramCache]: Analyzing trace with hash 994153444, now seen corresponding path program 1 times [2019-09-09 05:46:38,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:38,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:38,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:39,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:39,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:39,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:39,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:39,004 INFO L87 Difference]: Start difference. First operand 577 states and 736 transitions. Second operand 3 states. [2019-09-09 05:46:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:39,101 INFO L93 Difference]: Finished difference Result 770 states and 993 transitions. [2019-09-09 05:46:39,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:39,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-09 05:46:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:39,106 INFO L225 Difference]: With dead ends: 770 [2019-09-09 05:46:39,106 INFO L226 Difference]: Without dead ends: 752 [2019-09-09 05:46:39,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-09 05:46:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 622. [2019-09-09 05:46:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-09 05:46:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 793 transitions. [2019-09-09 05:46:39,124 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 793 transitions. Word has length 50 [2019-09-09 05:46:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:39,124 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 793 transitions. [2019-09-09 05:46:39,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 793 transitions. [2019-09-09 05:46:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:46:39,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:39,126 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:39,126 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:39,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:39,127 INFO L82 PathProgramCache]: Analyzing trace with hash -12540829, now seen corresponding path program 1 times [2019-09-09 05:46:39,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:39,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:39,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:39,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:39,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:39,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:39,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:39,205 INFO L87 Difference]: Start difference. First operand 622 states and 793 transitions. Second operand 7 states. [2019-09-09 05:46:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:39,300 INFO L93 Difference]: Finished difference Result 639 states and 809 transitions. [2019-09-09 05:46:39,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:46:39,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-09 05:46:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:39,304 INFO L225 Difference]: With dead ends: 639 [2019-09-09 05:46:39,304 INFO L226 Difference]: Without dead ends: 612 [2019-09-09 05:46:39,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:46:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-09 05:46:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-09-09 05:46:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-09 05:46:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2019-09-09 05:46:39,326 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 51 [2019-09-09 05:46:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:39,327 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2019-09-09 05:46:39,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2019-09-09 05:46:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:46:39,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:39,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:39,329 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:39,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:39,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1421151086, now seen corresponding path program 1 times [2019-09-09 05:46:39,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:39,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:39,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:39,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:39,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:39,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:39,408 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 6 states. [2019-09-09 05:46:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:39,445 INFO L93 Difference]: Finished difference Result 615 states and 779 transitions. [2019-09-09 05:46:39,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:39,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-09-09 05:46:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:39,450 INFO L225 Difference]: With dead ends: 615 [2019-09-09 05:46:39,450 INFO L226 Difference]: Without dead ends: 612 [2019-09-09 05:46:39,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-09 05:46:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-09 05:46:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-09 05:46:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2019-09-09 05:46:39,465 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2019-09-09 05:46:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:39,465 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2019-09-09 05:46:39,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2019-09-09 05:46:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:46:39,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:39,470 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:39,471 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:39,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:39,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1205911361, now seen corresponding path program 1 times [2019-09-09 05:46:39,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:39,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:39,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:39,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:46:39,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:46:39,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:46:39,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:39,563 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 8 states. [2019-09-09 05:46:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:39,787 INFO L93 Difference]: Finished difference Result 639 states and 807 transitions. [2019-09-09 05:46:39,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:46:39,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-09 05:46:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:39,793 INFO L225 Difference]: With dead ends: 639 [2019-09-09 05:46:39,793 INFO L226 Difference]: Without dead ends: 638 [2019-09-09 05:46:39,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-09 05:46:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2019-09-09 05:46:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-09 05:46:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 797 transitions. [2019-09-09 05:46:39,819 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 797 transitions. Word has length 51 [2019-09-09 05:46:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:39,820 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 797 transitions. [2019-09-09 05:46:39,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:46:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 797 transitions. [2019-09-09 05:46:39,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:46:39,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:39,822 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:39,822 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:39,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:39,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1205634531, now seen corresponding path program 1 times [2019-09-09 05:46:39,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:39,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:39,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:39,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:46:39,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:46:39,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:46:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:39,916 INFO L87 Difference]: Start difference. First operand 630 states and 797 transitions. Second operand 8 states. [2019-09-09 05:46:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:40,009 INFO L93 Difference]: Finished difference Result 684 states and 879 transitions. [2019-09-09 05:46:40,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:46:40,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-09 05:46:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:40,013 INFO L225 Difference]: With dead ends: 684 [2019-09-09 05:46:40,013 INFO L226 Difference]: Without dead ends: 670 [2019-09-09 05:46:40,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:46:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-09 05:46:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2019-09-09 05:46:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-09 05:46:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 835 transitions. [2019-09-09 05:46:40,068 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 835 transitions. Word has length 51 [2019-09-09 05:46:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:40,068 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 835 transitions. [2019-09-09 05:46:40,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:46:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 835 transitions. [2019-09-09 05:46:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-09 05:46:40,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:40,070 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:40,071 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:40,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1316245040, now seen corresponding path program 1 times [2019-09-09 05:46:40,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:40,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:40,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:40,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:40,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:40,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:40,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:40,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:40,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:40,127 INFO L87 Difference]: Start difference. First operand 651 states and 835 transitions. Second operand 5 states. [2019-09-09 05:46:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:40,641 INFO L93 Difference]: Finished difference Result 786 states and 1021 transitions. [2019-09-09 05:46:40,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:40,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-09 05:46:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:40,646 INFO L225 Difference]: With dead ends: 786 [2019-09-09 05:46:40,646 INFO L226 Difference]: Without dead ends: 786 [2019-09-09 05:46:40,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-09 05:46:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 651. [2019-09-09 05:46:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-09 05:46:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 833 transitions. [2019-09-09 05:46:40,665 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 833 transitions. Word has length 52 [2019-09-09 05:46:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:40,665 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 833 transitions. [2019-09-09 05:46:40,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 833 transitions. [2019-09-09 05:46:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-09 05:46:40,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:40,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:40,668 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:40,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1499440053, now seen corresponding path program 1 times [2019-09-09 05:46:40,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:40,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:40,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:40,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:40,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:40,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:40,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:40,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:40,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:40,738 INFO L87 Difference]: Start difference. First operand 651 states and 833 transitions. Second operand 7 states. [2019-09-09 05:46:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:41,542 INFO L93 Difference]: Finished difference Result 708 states and 904 transitions. [2019-09-09 05:46:41,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 05:46:41,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-09-09 05:46:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:41,546 INFO L225 Difference]: With dead ends: 708 [2019-09-09 05:46:41,546 INFO L226 Difference]: Without dead ends: 708 [2019-09-09 05:46:41,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:46:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-09 05:46:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 680. [2019-09-09 05:46:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-09 05:46:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 871 transitions. [2019-09-09 05:46:41,564 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 871 transitions. Word has length 52 [2019-09-09 05:46:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:41,565 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 871 transitions. [2019-09-09 05:46:41,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 871 transitions. [2019-09-09 05:46:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-09 05:46:41,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:41,567 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:41,567 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:41,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1356160695, now seen corresponding path program 1 times [2019-09-09 05:46:41,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:41,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:41,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:41,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:41,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:41,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:41,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:41,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:41,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:41,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:41,651 INFO L87 Difference]: Start difference. First operand 680 states and 871 transitions. Second operand 3 states. [2019-09-09 05:46:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:41,748 INFO L93 Difference]: Finished difference Result 822 states and 1067 transitions. [2019-09-09 05:46:41,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:41,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-09 05:46:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:41,753 INFO L225 Difference]: With dead ends: 822 [2019-09-09 05:46:41,753 INFO L226 Difference]: Without dead ends: 765 [2019-09-09 05:46:41,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-09-09 05:46:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 653. [2019-09-09 05:46:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-09 05:46:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 850 transitions. [2019-09-09 05:46:41,776 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 850 transitions. Word has length 52 [2019-09-09 05:46:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:41,778 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 850 transitions. [2019-09-09 05:46:41,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 850 transitions. [2019-09-09 05:46:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-09 05:46:41,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:41,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:41,781 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:41,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1285456356, now seen corresponding path program 1 times [2019-09-09 05:46:41,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:41,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:41,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:41,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:41,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:41,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:41,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:41,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:41,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:41,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:41,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:41,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:41,843 INFO L87 Difference]: Start difference. First operand 653 states and 850 transitions. Second operand 5 states. [2019-09-09 05:46:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:42,367 INFO L93 Difference]: Finished difference Result 788 states and 1041 transitions. [2019-09-09 05:46:42,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:42,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-09 05:46:42,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:42,372 INFO L225 Difference]: With dead ends: 788 [2019-09-09 05:46:42,372 INFO L226 Difference]: Without dead ends: 776 [2019-09-09 05:46:42,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-09-09 05:46:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 642. [2019-09-09 05:46:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-09 05:46:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 832 transitions. [2019-09-09 05:46:42,390 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 832 transitions. Word has length 53 [2019-09-09 05:46:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:42,390 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 832 transitions. [2019-09-09 05:46:42,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 832 transitions. [2019-09-09 05:46:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-09 05:46:42,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:42,392 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:42,393 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:42,393 INFO L82 PathProgramCache]: Analyzing trace with hash 53035812, now seen corresponding path program 1 times [2019-09-09 05:46:42,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:42,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:42,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:42,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:42,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:42,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:42,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:42,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:42,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:42,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:42,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:42,438 INFO L87 Difference]: Start difference. First operand 642 states and 832 transitions. Second operand 3 states. [2019-09-09 05:46:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:42,489 INFO L93 Difference]: Finished difference Result 642 states and 830 transitions. [2019-09-09 05:46:42,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:42,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-09 05:46:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:42,493 INFO L225 Difference]: With dead ends: 642 [2019-09-09 05:46:42,493 INFO L226 Difference]: Without dead ends: 642 [2019-09-09 05:46:42,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:42,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-09 05:46:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-09-09 05:46:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-09 05:46:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 830 transitions. [2019-09-09 05:46:42,511 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 830 transitions. Word has length 61 [2019-09-09 05:46:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:42,511 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 830 transitions. [2019-09-09 05:46:42,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 830 transitions. [2019-09-09 05:46:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-09 05:46:42,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:42,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:42,513 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash 195627467, now seen corresponding path program 1 times [2019-09-09 05:46:42,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:42,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:42,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:42,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:42,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:42,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:42,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:42,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:42,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:42,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:42,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:42,571 INFO L87 Difference]: Start difference. First operand 642 states and 830 transitions. Second operand 5 states. [2019-09-09 05:46:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:42,978 INFO L93 Difference]: Finished difference Result 720 states and 928 transitions. [2019-09-09 05:46:42,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:42,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-09 05:46:42,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:42,983 INFO L225 Difference]: With dead ends: 720 [2019-09-09 05:46:42,983 INFO L226 Difference]: Without dead ends: 706 [2019-09-09 05:46:42,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-09-09 05:46:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 641. [2019-09-09 05:46:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-09 05:46:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 827 transitions. [2019-09-09 05:46:43,003 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 827 transitions. Word has length 54 [2019-09-09 05:46:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:43,004 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 827 transitions. [2019-09-09 05:46:43,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 827 transitions. [2019-09-09 05:46:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:46:43,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:43,006 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:43,006 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:43,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:43,007 INFO L82 PathProgramCache]: Analyzing trace with hash -848857517, now seen corresponding path program 1 times [2019-09-09 05:46:43,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:43,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:43,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:43,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:43,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:43,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:43,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:43,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:43,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:43,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:43,075 INFO L87 Difference]: Start difference. First operand 641 states and 827 transitions. Second operand 4 states. [2019-09-09 05:46:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:43,450 INFO L93 Difference]: Finished difference Result 1211 states and 1560 transitions. [2019-09-09 05:46:43,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:46:43,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-09 05:46:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:43,456 INFO L225 Difference]: With dead ends: 1211 [2019-09-09 05:46:43,457 INFO L226 Difference]: Without dead ends: 1211 [2019-09-09 05:46:43,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-09 05:46:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1142. [2019-09-09 05:46:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-09-09 05:46:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1489 transitions. [2019-09-09 05:46:43,487 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1489 transitions. Word has length 55 [2019-09-09 05:46:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:43,488 INFO L475 AbstractCegarLoop]: Abstraction has 1142 states and 1489 transitions. [2019-09-09 05:46:43,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1489 transitions. [2019-09-09 05:46:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:46:43,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:43,490 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:43,491 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:43,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:43,491 INFO L82 PathProgramCache]: Analyzing trace with hash -426155691, now seen corresponding path program 1 times [2019-09-09 05:46:43,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:43,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:43,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:43,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:43,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:43,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-09-09 05:46:43,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:43,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:46:43,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:43,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:46:43,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:46:43,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:43,565 INFO L87 Difference]: Start difference. First operand 1142 states and 1489 transitions. Second operand 8 states. [2019-09-09 05:46:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:43,614 INFO L93 Difference]: Finished difference Result 1152 states and 1498 transitions. [2019-09-09 05:46:43,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:46:43,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-09-09 05:46:43,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:43,620 INFO L225 Difference]: With dead ends: 1152 [2019-09-09 05:46:43,621 INFO L226 Difference]: Without dead ends: 1123 [2019-09-09 05:46:43,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-09-09 05:46:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-09-09 05:46:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-09-09 05:46:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1465 transitions. [2019-09-09 05:46:43,658 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1465 transitions. Word has length 55 [2019-09-09 05:46:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:43,659 INFO L475 AbstractCegarLoop]: Abstraction has 1123 states and 1465 transitions. [2019-09-09 05:46:43,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:46:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1465 transitions. [2019-09-09 05:46:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:46:43,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:43,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:43,665 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:43,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:43,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1988865588, now seen corresponding path program 1 times [2019-09-09 05:46:43,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:43,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:43,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:43,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:43,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:43,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:43,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:43,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:43,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:43,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:43,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:43,797 INFO L87 Difference]: Start difference. First operand 1123 states and 1465 transitions. Second operand 5 states. [2019-09-09 05:46:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:43,817 INFO L93 Difference]: Finished difference Result 1008 states and 1298 transitions. [2019-09-09 05:46:43,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:43,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-09 05:46:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:43,834 INFO L225 Difference]: With dead ends: 1008 [2019-09-09 05:46:43,834 INFO L226 Difference]: Without dead ends: 1008 [2019-09-09 05:46:43,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-09-09 05:46:43,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 958. [2019-09-09 05:46:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-09-09 05:46:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1214 transitions. [2019-09-09 05:46:43,857 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1214 transitions. Word has length 64 [2019-09-09 05:46:43,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:43,858 INFO L475 AbstractCegarLoop]: Abstraction has 958 states and 1214 transitions. [2019-09-09 05:46:43,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1214 transitions. [2019-09-09 05:46:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:46:43,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:43,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:43,861 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:43,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:43,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1192768520, now seen corresponding path program 1 times [2019-09-09 05:46:43,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:43,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:43,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:43,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:43,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:43,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:43,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:46:43,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:43,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:46:43,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:46:43,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:43,938 INFO L87 Difference]: Start difference. First operand 958 states and 1214 transitions. Second operand 8 states. [2019-09-09 05:46:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:44,080 INFO L93 Difference]: Finished difference Result 978 states and 1233 transitions. [2019-09-09 05:46:44,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:46:44,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-09-09 05:46:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:44,084 INFO L225 Difference]: With dead ends: 978 [2019-09-09 05:46:44,084 INFO L226 Difference]: Without dead ends: 950 [2019-09-09 05:46:44,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-09-09 05:46:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-09-09 05:46:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-09-09 05:46:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1200 transitions. [2019-09-09 05:46:44,106 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1200 transitions. Word has length 57 [2019-09-09 05:46:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:44,107 INFO L475 AbstractCegarLoop]: Abstraction has 950 states and 1200 transitions. [2019-09-09 05:46:44,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:46:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1200 transitions. [2019-09-09 05:46:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-09 05:46:44,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:44,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:44,112 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:44,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1272632321, now seen corresponding path program 1 times [2019-09-09 05:46:44,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:44,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:44,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:44,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:44,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:44,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:44,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:44,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:44,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:44,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:44,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:44,178 INFO L87 Difference]: Start difference. First operand 950 states and 1200 transitions. Second operand 6 states. [2019-09-09 05:46:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:44,243 INFO L93 Difference]: Finished difference Result 968 states and 1218 transitions. [2019-09-09 05:46:44,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:44,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-09-09 05:46:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:44,247 INFO L225 Difference]: With dead ends: 968 [2019-09-09 05:46:44,248 INFO L226 Difference]: Without dead ends: 940 [2019-09-09 05:46:44,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-09-09 05:46:44,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-09-09 05:46:44,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-09 05:46:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1188 transitions. [2019-09-09 05:46:44,272 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1188 transitions. Word has length 60 [2019-09-09 05:46:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:44,272 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1188 transitions. [2019-09-09 05:46:44,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1188 transitions. [2019-09-09 05:46:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-09 05:46:44,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:44,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:44,276 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:44,276 INFO L82 PathProgramCache]: Analyzing trace with hash 365447091, now seen corresponding path program 1 times [2019-09-09 05:46:44,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:44,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:44,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:44,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:44,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:44,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:44,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:44,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:44,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:44,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:44,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:44,356 INFO L87 Difference]: Start difference. First operand 940 states and 1188 transitions. Second operand 5 states. [2019-09-09 05:46:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:44,640 INFO L93 Difference]: Finished difference Result 940 states and 1184 transitions. [2019-09-09 05:46:44,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:44,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-09 05:46:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:44,645 INFO L225 Difference]: With dead ends: 940 [2019-09-09 05:46:44,645 INFO L226 Difference]: Without dead ends: 940 [2019-09-09 05:46:44,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:44,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-09-09 05:46:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-09-09 05:46:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-09 05:46:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1184 transitions. [2019-09-09 05:46:44,664 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1184 transitions. Word has length 68 [2019-09-09 05:46:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:44,664 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1184 transitions. [2019-09-09 05:46:44,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1184 transitions. [2019-09-09 05:46:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:46:44,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:44,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:44,668 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:44,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:44,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1376834024, now seen corresponding path program 1 times [2019-09-09 05:46:44,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:44,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:44,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:44,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:44,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:44,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:44,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:44,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:44,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:44,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:44,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:44,724 INFO L87 Difference]: Start difference. First operand 940 states and 1184 transitions. Second operand 5 states. [2019-09-09 05:46:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:44,744 INFO L93 Difference]: Finished difference Result 952 states and 1198 transitions. [2019-09-09 05:46:44,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:44,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-09 05:46:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:44,748 INFO L225 Difference]: With dead ends: 952 [2019-09-09 05:46:44,748 INFO L226 Difference]: Without dead ends: 952 [2019-09-09 05:46:44,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-09-09 05:46:44,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 948. [2019-09-09 05:46:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-09-09 05:46:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1192 transitions. [2019-09-09 05:46:44,767 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1192 transitions. Word has length 63 [2019-09-09 05:46:44,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:44,767 INFO L475 AbstractCegarLoop]: Abstraction has 948 states and 1192 transitions. [2019-09-09 05:46:44,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1192 transitions. [2019-09-09 05:46:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:46:44,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:44,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:44,770 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:44,771 INFO L82 PathProgramCache]: Analyzing trace with hash 902963543, now seen corresponding path program 1 times [2019-09-09 05:46:44,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:44,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:44,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:44,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:44,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:44,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:44,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:44,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:44,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:44,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:44,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:44,884 INFO L87 Difference]: Start difference. First operand 948 states and 1192 transitions. Second operand 9 states. [2019-09-09 05:46:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:44,950 INFO L93 Difference]: Finished difference Result 955 states and 1198 transitions. [2019-09-09 05:46:44,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:44,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-09-09 05:46:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:44,955 INFO L225 Difference]: With dead ends: 955 [2019-09-09 05:46:44,955 INFO L226 Difference]: Without dead ends: 952 [2019-09-09 05:46:44,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-09-09 05:46:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2019-09-09 05:46:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-09-09 05:46:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1192 transitions. [2019-09-09 05:46:44,973 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1192 transitions. Word has length 63 [2019-09-09 05:46:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:44,974 INFO L475 AbstractCegarLoop]: Abstraction has 950 states and 1192 transitions. [2019-09-09 05:46:44,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1192 transitions. [2019-09-09 05:46:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:46:44,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:44,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:44,977 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:44,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:44,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2130993218, now seen corresponding path program 1 times [2019-09-09 05:46:44,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:44,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:44,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:44,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:44,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:45,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:45,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:45,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:45,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:45,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:45,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:45,048 INFO L87 Difference]: Start difference. First operand 950 states and 1192 transitions. Second operand 9 states. [2019-09-09 05:46:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:45,236 INFO L93 Difference]: Finished difference Result 980 states and 1223 transitions. [2019-09-09 05:46:45,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:45,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-09-09 05:46:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:45,240 INFO L225 Difference]: With dead ends: 980 [2019-09-09 05:46:45,240 INFO L226 Difference]: Without dead ends: 940 [2019-09-09 05:46:45,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-09-09 05:46:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-09-09 05:46:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-09 05:46:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1176 transitions. [2019-09-09 05:46:45,262 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1176 transitions. Word has length 62 [2019-09-09 05:46:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:45,263 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1176 transitions. [2019-09-09 05:46:45,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1176 transitions. [2019-09-09 05:46:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-09 05:46:45,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:45,265 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:45,266 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash -758800695, now seen corresponding path program 1 times [2019-09-09 05:46:45,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:45,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:45,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:45,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:45,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:45,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:45,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:45,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:45,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:45,305 INFO L87 Difference]: Start difference. First operand 940 states and 1176 transitions. Second operand 3 states. [2019-09-09 05:46:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:45,323 INFO L93 Difference]: Finished difference Result 970 states and 1228 transitions. [2019-09-09 05:46:45,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:45,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-09 05:46:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:45,327 INFO L225 Difference]: With dead ends: 970 [2019-09-09 05:46:45,327 INFO L226 Difference]: Without dead ends: 970 [2019-09-09 05:46:45,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-09-09 05:46:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 940. [2019-09-09 05:46:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-09 05:46:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1176 transitions. [2019-09-09 05:46:45,349 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1176 transitions. Word has length 71 [2019-09-09 05:46:45,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:45,349 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1176 transitions. [2019-09-09 05:46:45,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1176 transitions. [2019-09-09 05:46:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-09 05:46:45,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:45,352 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:45,352 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1235234569, now seen corresponding path program 1 times [2019-09-09 05:46:45,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:45,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:45,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:45,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:45,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:45,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:45,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:45,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:45,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:45,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:45,450 INFO L87 Difference]: Start difference. First operand 940 states and 1176 transitions. Second operand 6 states. [2019-09-09 05:46:45,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:45,500 INFO L93 Difference]: Finished difference Result 969 states and 1220 transitions. [2019-09-09 05:46:45,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:45,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-09 05:46:45,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:45,504 INFO L225 Difference]: With dead ends: 969 [2019-09-09 05:46:45,504 INFO L226 Difference]: Without dead ends: 969 [2019-09-09 05:46:45,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-09-09 05:46:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 940. [2019-09-09 05:46:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-09 05:46:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1172 transitions. [2019-09-09 05:46:45,527 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1172 transitions. Word has length 71 [2019-09-09 05:46:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:45,527 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1172 transitions. [2019-09-09 05:46:45,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1172 transitions. [2019-09-09 05:46:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:46:45,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:45,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:45,531 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:45,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:45,531 INFO L82 PathProgramCache]: Analyzing trace with hash -640230042, now seen corresponding path program 1 times [2019-09-09 05:46:45,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:45,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:45,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:45,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:45,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:45,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:45,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:45,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:45,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:45,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:45,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:45,610 INFO L87 Difference]: Start difference. First operand 940 states and 1172 transitions. Second operand 9 states. [2019-09-09 05:46:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:45,783 INFO L93 Difference]: Finished difference Result 970 states and 1203 transitions. [2019-09-09 05:46:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:45,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-09-09 05:46:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:45,788 INFO L225 Difference]: With dead ends: 970 [2019-09-09 05:46:45,788 INFO L226 Difference]: Without dead ends: 928 [2019-09-09 05:46:45,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-09 05:46:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2019-09-09 05:46:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-09-09 05:46:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1154 transitions. [2019-09-09 05:46:45,807 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1154 transitions. Word has length 63 [2019-09-09 05:46:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:45,807 INFO L475 AbstractCegarLoop]: Abstraction has 928 states and 1154 transitions. [2019-09-09 05:46:45,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1154 transitions. [2019-09-09 05:46:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:46:45,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:45,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:45,810 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:45,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:45,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1615803884, now seen corresponding path program 1 times [2019-09-09 05:46:45,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:45,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:45,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:45,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:45,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:45,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:45,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:45,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:45,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:45,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:45,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:45,897 INFO L87 Difference]: Start difference. First operand 928 states and 1154 transitions. Second operand 9 states. [2019-09-09 05:46:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:46,079 INFO L93 Difference]: Finished difference Result 958 states and 1185 transitions. [2019-09-09 05:46:46,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:46,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-09-09 05:46:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:46,088 INFO L225 Difference]: With dead ends: 958 [2019-09-09 05:46:46,088 INFO L226 Difference]: Without dead ends: 918 [2019-09-09 05:46:46,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-09-09 05:46:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2019-09-09 05:46:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-09-09 05:46:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1138 transitions. [2019-09-09 05:46:46,109 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1138 transitions. Word has length 63 [2019-09-09 05:46:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:46,110 INFO L475 AbstractCegarLoop]: Abstraction has 918 states and 1138 transitions. [2019-09-09 05:46:46,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1138 transitions. [2019-09-09 05:46:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:46:46,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:46,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:46,113 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:46,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1125618577, now seen corresponding path program 1 times [2019-09-09 05:46:46,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:46,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:46,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:46,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:46,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:46,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:46,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:46:46,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:46,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:46:46,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:46:46,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:46,203 INFO L87 Difference]: Start difference. First operand 918 states and 1138 transitions. Second operand 8 states. [2019-09-09 05:46:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:46,356 INFO L93 Difference]: Finished difference Result 932 states and 1151 transitions. [2019-09-09 05:46:46,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:46:46,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-09-09 05:46:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:46,370 INFO L225 Difference]: With dead ends: 932 [2019-09-09 05:46:46,371 INFO L226 Difference]: Without dead ends: 903 [2019-09-09 05:46:46,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-09-09 05:46:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2019-09-09 05:46:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-09-09 05:46:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1118 transitions. [2019-09-09 05:46:46,391 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1118 transitions. Word has length 63 [2019-09-09 05:46:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:46,392 INFO L475 AbstractCegarLoop]: Abstraction has 903 states and 1118 transitions. [2019-09-09 05:46:46,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:46:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1118 transitions. [2019-09-09 05:46:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-09 05:46:46,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:46,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:46,396 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:46,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:46,397 INFO L82 PathProgramCache]: Analyzing trace with hash -981702428, now seen corresponding path program 1 times [2019-09-09 05:46:46,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:46,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:46,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:46,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:46,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:46,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:46,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:46,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:46,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:46,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:46,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:46,474 INFO L87 Difference]: Start difference. First operand 903 states and 1118 transitions. Second operand 3 states. [2019-09-09 05:46:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:46,498 INFO L93 Difference]: Finished difference Result 1095 states and 1358 transitions. [2019-09-09 05:46:46,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:46,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-09 05:46:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:46,503 INFO L225 Difference]: With dead ends: 1095 [2019-09-09 05:46:46,504 INFO L226 Difference]: Without dead ends: 1095 [2019-09-09 05:46:46,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2019-09-09 05:46:46,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1052. [2019-09-09 05:46:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-09-09 05:46:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1307 transitions. [2019-09-09 05:46:46,538 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1307 transitions. Word has length 73 [2019-09-09 05:46:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:46,539 INFO L475 AbstractCegarLoop]: Abstraction has 1052 states and 1307 transitions. [2019-09-09 05:46:46,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1307 transitions. [2019-09-09 05:46:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-09 05:46:46,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:46,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:46,544 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:46,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1818453787, now seen corresponding path program 1 times [2019-09-09 05:46:46,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:46,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:46,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:46,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:46,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:46,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:46,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:46,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:46,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:46,722 INFO L87 Difference]: Start difference. First operand 1052 states and 1307 transitions. Second operand 9 states. [2019-09-09 05:46:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:46,905 INFO L93 Difference]: Finished difference Result 1082 states and 1338 transitions. [2019-09-09 05:46:46,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:46,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-09 05:46:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:46,908 INFO L225 Difference]: With dead ends: 1082 [2019-09-09 05:46:46,908 INFO L226 Difference]: Without dead ends: 960 [2019-09-09 05:46:46,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-09-09 05:46:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2019-09-09 05:46:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-09-09 05:46:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1193 transitions. [2019-09-09 05:46:46,928 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1193 transitions. Word has length 67 [2019-09-09 05:46:46,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:46,928 INFO L475 AbstractCegarLoop]: Abstraction has 960 states and 1193 transitions. [2019-09-09 05:46:46,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1193 transitions. [2019-09-09 05:46:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:46:46,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:46,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:46,932 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:46,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:46,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1657933026, now seen corresponding path program 1 times [2019-09-09 05:46:46,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:46,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:46,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:46,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:46,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:47,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:47,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:47,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:47,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:47,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:47,015 INFO L87 Difference]: Start difference. First operand 960 states and 1193 transitions. Second operand 4 states. [2019-09-09 05:46:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:47,162 INFO L93 Difference]: Finished difference Result 695 states and 828 transitions. [2019-09-09 05:46:47,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:46:47,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-09 05:46:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:47,165 INFO L225 Difference]: With dead ends: 695 [2019-09-09 05:46:47,165 INFO L226 Difference]: Without dead ends: 686 [2019-09-09 05:46:47,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-09-09 05:46:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 651. [2019-09-09 05:46:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-09 05:46:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 785 transitions. [2019-09-09 05:46:47,175 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 785 transitions. Word has length 82 [2019-09-09 05:46:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:47,176 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 785 transitions. [2019-09-09 05:46:47,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 785 transitions. [2019-09-09 05:46:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:46:47,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:47,178 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:47,178 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:47,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:47,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1097233248, now seen corresponding path program 1 times [2019-09-09 05:46:47,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:47,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:47,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:47,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:47,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:47,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:47,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:47,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:47,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:47,288 INFO L87 Difference]: Start difference. First operand 651 states and 785 transitions. Second operand 7 states. [2019-09-09 05:46:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:47,944 INFO L93 Difference]: Finished difference Result 676 states and 807 transitions. [2019-09-09 05:46:47,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 05:46:47,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-09 05:46:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:47,947 INFO L225 Difference]: With dead ends: 676 [2019-09-09 05:46:47,947 INFO L226 Difference]: Without dead ends: 676 [2019-09-09 05:46:47,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:46:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-09-09 05:46:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 635. [2019-09-09 05:46:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-09-09 05:46:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 757 transitions. [2019-09-09 05:46:47,958 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 757 transitions. Word has length 82 [2019-09-09 05:46:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:47,959 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 757 transitions. [2019-09-09 05:46:47,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 757 transitions. [2019-09-09 05:46:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-09 05:46:47,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:47,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:47,961 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash -501162190, now seen corresponding path program 1 times [2019-09-09 05:46:47,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:47,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:47,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:48,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:48,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:48,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:48,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:48,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:48,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:48,018 INFO L87 Difference]: Start difference. First operand 635 states and 757 transitions. Second operand 5 states. [2019-09-09 05:46:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:48,034 INFO L93 Difference]: Finished difference Result 647 states and 769 transitions. [2019-09-09 05:46:48,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:48,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-09 05:46:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:48,037 INFO L225 Difference]: With dead ends: 647 [2019-09-09 05:46:48,037 INFO L226 Difference]: Without dead ends: 633 [2019-09-09 05:46:48,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-09 05:46:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-09-09 05:46:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-09 05:46:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 753 transitions. [2019-09-09 05:46:48,047 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 753 transitions. Word has length 76 [2019-09-09 05:46:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:48,047 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 753 transitions. [2019-09-09 05:46:48,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 753 transitions. [2019-09-09 05:46:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-09 05:46:48,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:48,050 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:48,050 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:48,051 INFO L82 PathProgramCache]: Analyzing trace with hash 211753811, now seen corresponding path program 1 times [2019-09-09 05:46:48,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:48,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:48,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:48,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:48,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:48,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:48,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:48,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:48,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:48,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:48,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:48,139 INFO L87 Difference]: Start difference. First operand 633 states and 753 transitions. Second operand 9 states. [2019-09-09 05:46:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:48,193 INFO L93 Difference]: Finished difference Result 621 states and 737 transitions. [2019-09-09 05:46:48,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:48,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-09-09 05:46:48,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:48,195 INFO L225 Difference]: With dead ends: 621 [2019-09-09 05:46:48,195 INFO L226 Difference]: Without dead ends: 559 [2019-09-09 05:46:48,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:48,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-09 05:46:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-09 05:46:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-09 05:46:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 665 transitions. [2019-09-09 05:46:48,206 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 665 transitions. Word has length 76 [2019-09-09 05:46:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:48,206 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 665 transitions. [2019-09-09 05:46:48,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 665 transitions. [2019-09-09 05:46:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:46:48,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:48,209 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:48,210 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1448627846, now seen corresponding path program 1 times [2019-09-09 05:46:48,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:48,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:48,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:48,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:48,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:48,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:48,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:48,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:48,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:48,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:48,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:48,325 INFO L87 Difference]: Start difference. First operand 559 states and 665 transitions. Second operand 6 states. [2019-09-09 05:46:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:48,366 INFO L93 Difference]: Finished difference Result 629 states and 777 transitions. [2019-09-09 05:46:48,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:48,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-09 05:46:48,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:48,369 INFO L225 Difference]: With dead ends: 629 [2019-09-09 05:46:48,369 INFO L226 Difference]: Without dead ends: 629 [2019-09-09 05:46:48,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-09 05:46:48,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 525. [2019-09-09 05:46:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-09-09 05:46:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 621 transitions. [2019-09-09 05:46:48,379 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 621 transitions. Word has length 83 [2019-09-09 05:46:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:48,380 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 621 transitions. [2019-09-09 05:46:48,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 621 transitions. [2019-09-09 05:46:48,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:46:48,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:48,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:48,384 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1423797197, now seen corresponding path program 1 times [2019-09-09 05:46:48,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:48,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:48,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:48,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:48,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:48,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:48,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:48,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:48,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:48,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:48,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:48,445 INFO L87 Difference]: Start difference. First operand 525 states and 621 transitions. Second operand 5 states. [2019-09-09 05:46:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:48,946 INFO L93 Difference]: Finished difference Result 665 states and 771 transitions. [2019-09-09 05:46:48,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:48,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-09 05:46:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:48,948 INFO L225 Difference]: With dead ends: 665 [2019-09-09 05:46:48,948 INFO L226 Difference]: Without dead ends: 665 [2019-09-09 05:46:48,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-09-09 05:46:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 642. [2019-09-09 05:46:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-09 05:46:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 749 transitions. [2019-09-09 05:46:48,959 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 749 transitions. Word has length 79 [2019-09-09 05:46:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:48,959 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 749 transitions. [2019-09-09 05:46:48,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 749 transitions. [2019-09-09 05:46:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:46:48,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:48,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:48,962 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash 567047082, now seen corresponding path program 1 times [2019-09-09 05:46:48,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:48,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:48,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:48,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:48,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:49,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:49,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:49,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:49,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:49,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:49,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:49,038 INFO L87 Difference]: Start difference. First operand 642 states and 749 transitions. Second operand 9 states. [2019-09-09 05:46:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:49,167 INFO L93 Difference]: Finished difference Result 641 states and 747 transitions. [2019-09-09 05:46:49,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:49,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-09 05:46:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:49,168 INFO L225 Difference]: With dead ends: 641 [2019-09-09 05:46:49,169 INFO L226 Difference]: Without dead ends: 449 [2019-09-09 05:46:49,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-09 05:46:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-09-09 05:46:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-09 05:46:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 533 transitions. [2019-09-09 05:46:49,177 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 533 transitions. Word has length 80 [2019-09-09 05:46:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:49,177 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 533 transitions. [2019-09-09 05:46:49,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 533 transitions. [2019-09-09 05:46:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:46:49,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:49,179 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:49,179 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:49,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1336030567, now seen corresponding path program 1 times [2019-09-09 05:46:49,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:49,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:49,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:49,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:49,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:49,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:49,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:49,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:49,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:49,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:49,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:49,274 INFO L87 Difference]: Start difference. First operand 449 states and 533 transitions. Second operand 9 states. [2019-09-09 05:46:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:49,379 INFO L93 Difference]: Finished difference Result 467 states and 551 transitions. [2019-09-09 05:46:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:49,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-09 05:46:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:49,382 INFO L225 Difference]: With dead ends: 467 [2019-09-09 05:46:49,382 INFO L226 Difference]: Without dead ends: 449 [2019-09-09 05:46:49,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:46:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-09 05:46:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-09-09 05:46:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-09 05:46:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 532 transitions. [2019-09-09 05:46:49,391 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 532 transitions. Word has length 88 [2019-09-09 05:46:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:49,391 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 532 transitions. [2019-09-09 05:46:49,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 532 transitions. [2019-09-09 05:46:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-09 05:46:49,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:49,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:49,393 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2100668997, now seen corresponding path program 1 times [2019-09-09 05:46:49,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:49,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:49,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:49,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:49,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:49,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:49,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:49,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:49,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:49,474 INFO L87 Difference]: Start difference. First operand 449 states and 532 transitions. Second operand 7 states. [2019-09-09 05:46:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:49,607 INFO L93 Difference]: Finished difference Result 844 states and 1004 transitions. [2019-09-09 05:46:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:49,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-09-09 05:46:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:49,609 INFO L225 Difference]: With dead ends: 844 [2019-09-09 05:46:49,609 INFO L226 Difference]: Without dead ends: 792 [2019-09-09 05:46:49,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-09-09 05:46:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 370. [2019-09-09 05:46:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-09 05:46:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 431 transitions. [2019-09-09 05:46:49,619 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 431 transitions. Word has length 99 [2019-09-09 05:46:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:49,620 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 431 transitions. [2019-09-09 05:46:49,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 431 transitions. [2019-09-09 05:46:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:46:49,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:49,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:49,622 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:49,622 INFO L82 PathProgramCache]: Analyzing trace with hash -289766285, now seen corresponding path program 1 times [2019-09-09 05:46:49,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:49,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:49,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:49,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:49,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:49,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:49,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-09 05:46:49,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:49,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 05:46:49,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 05:46:49,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:49,747 INFO L87 Difference]: Start difference. First operand 370 states and 431 transitions. Second operand 11 states. [2019-09-09 05:46:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:49,844 INFO L93 Difference]: Finished difference Result 398 states and 460 transitions. [2019-09-09 05:46:49,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 05:46:49,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-09 05:46:49,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:49,846 INFO L225 Difference]: With dead ends: 398 [2019-09-09 05:46:49,846 INFO L226 Difference]: Without dead ends: 366 [2019-09-09 05:46:49,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:46:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-09 05:46:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2019-09-09 05:46:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-09 05:46:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 408 transitions. [2019-09-09 05:46:49,852 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 408 transitions. Word has length 104 [2019-09-09 05:46:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:49,853 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 408 transitions. [2019-09-09 05:46:49,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 05:46:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 408 transitions. [2019-09-09 05:46:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-09 05:46:49,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:49,855 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:49,855 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash -211623252, now seen corresponding path program 1 times [2019-09-09 05:46:49,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:49,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:49,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:49,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:49,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:49,928 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-09 05:46:49,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:49,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:49,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:49,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:49,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:49,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:49,929 INFO L87 Difference]: Start difference. First operand 353 states and 408 transitions. Second operand 6 states. [2019-09-09 05:46:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:49,957 INFO L93 Difference]: Finished difference Result 305 states and 344 transitions. [2019-09-09 05:46:49,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:49,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-09-09 05:46:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:49,959 INFO L225 Difference]: With dead ends: 305 [2019-09-09 05:46:49,959 INFO L226 Difference]: Without dead ends: 305 [2019-09-09 05:46:49,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-09 05:46:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2019-09-09 05:46:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-09 05:46:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 268 transitions. [2019-09-09 05:46:49,963 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 268 transitions. Word has length 113 [2019-09-09 05:46:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:49,964 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 268 transitions. [2019-09-09 05:46:49,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 268 transitions. [2019-09-09 05:46:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-09 05:46:49,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:49,966 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:49,966 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1015672895, now seen corresponding path program 1 times [2019-09-09 05:46:49,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:49,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:49,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-09 05:46:50,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:50,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:46:50,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:50,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:46:50,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:46:50,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:46:50,068 INFO L87 Difference]: Start difference. First operand 243 states and 268 transitions. Second operand 9 states. [2019-09-09 05:46:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:50,169 INFO L93 Difference]: Finished difference Result 287 states and 325 transitions. [2019-09-09 05:46:50,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:46:50,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-09 05:46:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:50,171 INFO L225 Difference]: With dead ends: 287 [2019-09-09 05:46:50,171 INFO L226 Difference]: Without dead ends: 287 [2019-09-09 05:46:50,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:46:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-09 05:46:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2019-09-09 05:46:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:46:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 293 transitions. [2019-09-09 05:46:50,177 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 293 transitions. Word has length 134 [2019-09-09 05:46:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:50,177 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 293 transitions. [2019-09-09 05:46:50,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:46:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 293 transitions. [2019-09-09 05:46:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-09 05:46:50,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:50,179 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:50,180 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash 14849890, now seen corresponding path program 1 times [2019-09-09 05:46:50,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:50,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:50,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:50,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:50,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-09 05:46:50,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:50,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-09 05:46:50,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:50,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-09 05:46:50,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-09 05:46:50,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-09 05:46:50,374 INFO L87 Difference]: Start difference. First operand 263 states and 293 transitions. Second operand 15 states. [2019-09-09 05:46:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:50,571 INFO L93 Difference]: Finished difference Result 298 states and 329 transitions. [2019-09-09 05:46:50,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 05:46:50,571 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 135 [2019-09-09 05:46:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:50,572 INFO L225 Difference]: With dead ends: 298 [2019-09-09 05:46:50,573 INFO L226 Difference]: Without dead ends: 271 [2019-09-09 05:46:50,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-09 05:46:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-09 05:46:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2019-09-09 05:46:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:46:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-09-09 05:46:50,578 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 135 [2019-09-09 05:46:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:50,579 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-09-09 05:46:50,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-09 05:46:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-09-09 05:46:50,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:46:50,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:50,581 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:50,581 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:50,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:50,582 INFO L82 PathProgramCache]: Analyzing trace with hash 709369442, now seen corresponding path program 1 times [2019-09-09 05:46:50,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:50,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:50,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:50,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:50,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:46:50,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:50,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:50,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:50,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:50,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:50,690 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 5 states. [2019-09-09 05:46:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:50,718 INFO L93 Difference]: Finished difference Result 276 states and 310 transitions. [2019-09-09 05:46:50,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:50,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-09-09 05:46:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:50,720 INFO L225 Difference]: With dead ends: 276 [2019-09-09 05:46:50,720 INFO L226 Difference]: Without dead ends: 276 [2019-09-09 05:46:50,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-09 05:46:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 263. [2019-09-09 05:46:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:46:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-09-09 05:46:50,727 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 143 [2019-09-09 05:46:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:50,727 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-09-09 05:46:50,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-09-09 05:46:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-09 05:46:50,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:50,731 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:50,731 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:50,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1897304323, now seen corresponding path program 1 times [2019-09-09 05:46:50,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:50,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:50,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:50,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:50,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-09 05:46:50,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:50,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:50,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:50,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:50,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:50,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:50,827 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 6 states. [2019-09-09 05:46:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:50,854 INFO L93 Difference]: Finished difference Result 269 states and 297 transitions. [2019-09-09 05:46:50,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:50,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-09 05:46:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:50,856 INFO L225 Difference]: With dead ends: 269 [2019-09-09 05:46:50,856 INFO L226 Difference]: Without dead ends: 269 [2019-09-09 05:46:50,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-09 05:46:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2019-09-09 05:46:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-09 05:46:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2019-09-09 05:46:50,860 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 144 [2019-09-09 05:46:50,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:50,860 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2019-09-09 05:46:50,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2019-09-09 05:46:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-09 05:46:50,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:50,862 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:50,863 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:50,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:50,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1361167968, now seen corresponding path program 1 times [2019-09-09 05:46:50,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:50,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:50,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:50,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-09 05:46:51,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:51,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:46:51,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:51,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:46:51,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:46:51,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:46:51,065 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand 14 states. [2019-09-09 05:46:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:52,412 INFO L93 Difference]: Finished difference Result 314 states and 353 transitions. [2019-09-09 05:46:52,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 05:46:52,413 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2019-09-09 05:46:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:52,414 INFO L225 Difference]: With dead ends: 314 [2019-09-09 05:46:52,414 INFO L226 Difference]: Without dead ends: 292 [2019-09-09 05:46:52,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-09-09 05:46:52,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-09 05:46:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 254. [2019-09-09 05:46:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-09 05:46:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 278 transitions. [2019-09-09 05:46:52,420 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 278 transitions. Word has length 145 [2019-09-09 05:46:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:52,421 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 278 transitions. [2019-09-09 05:46:52,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:46:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 278 transitions. [2019-09-09 05:46:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-09 05:46:52,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:52,422 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:52,423 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:52,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:52,423 INFO L82 PathProgramCache]: Analyzing trace with hash -659068543, now seen corresponding path program 1 times [2019-09-09 05:46:52,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:52,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:52,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:52,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:52,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:46:52,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:52,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:52,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:52,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:52,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:52,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:52,506 INFO L87 Difference]: Start difference. First operand 254 states and 278 transitions. Second operand 6 states. [2019-09-09 05:46:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:52,560 INFO L93 Difference]: Finished difference Result 281 states and 313 transitions. [2019-09-09 05:46:52,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:46:52,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-09-09 05:46:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:52,561 INFO L225 Difference]: With dead ends: 281 [2019-09-09 05:46:52,561 INFO L226 Difference]: Without dead ends: 281 [2019-09-09 05:46:52,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-09 05:46:52,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 258. [2019-09-09 05:46:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-09 05:46:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 282 transitions. [2019-09-09 05:46:52,566 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 282 transitions. Word has length 148 [2019-09-09 05:46:52,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:52,566 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 282 transitions. [2019-09-09 05:46:52,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 282 transitions. [2019-09-09 05:46:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:46:52,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:52,568 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:52,568 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:52,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:52,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2021606810, now seen corresponding path program 1 times [2019-09-09 05:46:52,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:52,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:52,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:52,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:52,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:46:52,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:52,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:52,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:52,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:52,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:52,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:52,651 INFO L87 Difference]: Start difference. First operand 258 states and 282 transitions. Second operand 5 states. [2019-09-09 05:46:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:52,668 INFO L93 Difference]: Finished difference Result 264 states and 289 transitions. [2019-09-09 05:46:52,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:52,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-09 05:46:52,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:52,669 INFO L225 Difference]: With dead ends: 264 [2019-09-09 05:46:52,670 INFO L226 Difference]: Without dead ends: 264 [2019-09-09 05:46:52,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-09 05:46:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-09 05:46:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-09 05:46:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 286 transitions. [2019-09-09 05:46:52,674 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 286 transitions. Word has length 150 [2019-09-09 05:46:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:52,675 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 286 transitions. [2019-09-09 05:46:52,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 286 transitions. [2019-09-09 05:46:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:46:52,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:52,676 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:52,676 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:52,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:52,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2091873989, now seen corresponding path program 1 times [2019-09-09 05:46:52,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:52,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:52,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:52,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:52,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-09 05:46:52,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:52,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-09 05:46:52,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:52,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-09 05:46:52,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-09 05:46:52,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-09 05:46:52,878 INFO L87 Difference]: Start difference. First operand 262 states and 286 transitions. Second operand 15 states. [2019-09-09 05:46:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:53,091 INFO L93 Difference]: Finished difference Result 316 states and 352 transitions. [2019-09-09 05:46:53,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 05:46:53,091 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2019-09-09 05:46:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:53,092 INFO L225 Difference]: With dead ends: 316 [2019-09-09 05:46:53,092 INFO L226 Difference]: Without dead ends: 283 [2019-09-09 05:46:53,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-09 05:46:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-09 05:46:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 270. [2019-09-09 05:46:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-09 05:46:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2019-09-09 05:46:53,097 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 150 [2019-09-09 05:46:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:53,097 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2019-09-09 05:46:53,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-09 05:46:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2019-09-09 05:46:53,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:46:53,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:53,099 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:53,099 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:53,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:53,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1666371012, now seen corresponding path program 1 times [2019-09-09 05:46:53,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:53,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:53,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:53,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:53,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-09 05:46:53,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:46:53,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:46:53,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-09-09 05:46:53,239 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [250], [258], [263], [268], [273], [276], [291], [309], [321], [325], [328], [331], [334], [340], [358], [361], [364], [392], [397], [398], [400], [401], [439], [442], [447], [448], [454], [460], [462], [464], [471], [473], [475], [478], [481], [484], [486], [489], [533], [536], [541], [548], [550], [557], [559], [560], [585], [588], [593], [596], [597], [598], [599], [600], [601], [651], [654], [656], [659], [667], [670], [680], [692], [695], [700], [711], [712], [921], [922], [955], [957], [961], [963], [970], [972], [973], [974], [975], [1017], [1018], [1063], [1064], [1065], [1066], [1073], [1074], [1077], [1085], [1086], [1095], [1096], [1099], [1100], [1101], [1102], [1105], [1106], [1109], [1110], [1119], [1120], [1121], [1122], [1147], [1148], [1149], [1150], [1153], [1154], [1155] [2019-09-09 05:46:53,330 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:46:53,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:46:53,600 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:46:53,743 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:46:53,746 INFO L272 AbstractInterpreter]: Visited 126 different actions 151 times. Never merged. Never widened. Performed 1226 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Never found a fixpoint. Largest state had 125 variables. [2019-09-09 05:46:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:53,750 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:46:54,151 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 84.66% of their original sizes. [2019-09-09 05:46:54,151 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:47:10,855 INFO L420 sIntCurrentIteration]: We unified 152 AI predicates to 152 [2019-09-09 05:47:10,855 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:47:10,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:47:10,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [110] imperfect sequences [12] total 120 [2019-09-09 05:47:10,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:10,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-09 05:47:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-09 05:47:10,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=11501, Unknown=0, NotChecked=0, Total=11990 [2019-09-09 05:47:10,858 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand 110 states. [2019-09-09 05:48:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:09,432 INFO L93 Difference]: Finished difference Result 594 states and 674 transitions. [2019-09-09 05:48:09,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-09 05:48:09,433 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 153 [2019-09-09 05:48:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:09,435 INFO L225 Difference]: With dead ends: 594 [2019-09-09 05:48:09,435 INFO L226 Difference]: Without dead ends: 535 [2019-09-09 05:48:09,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5317 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=828, Invalid=20634, Unknown=0, NotChecked=0, Total=21462 [2019-09-09 05:48:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-09 05:48:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 472. [2019-09-09 05:48:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-09 05:48:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 522 transitions. [2019-09-09 05:48:09,445 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 522 transitions. Word has length 153 [2019-09-09 05:48:09,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:09,445 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 522 transitions. [2019-09-09 05:48:09,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-09 05:48:09,445 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 522 transitions. [2019-09-09 05:48:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:48:09,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:09,448 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:09,448 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:09,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:09,449 INFO L82 PathProgramCache]: Analyzing trace with hash 862297435, now seen corresponding path program 1 times [2019-09-09 05:48:09,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:09,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:09,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:48:09,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:09,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-09 05:48:09,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:09,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 05:48:09,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 05:48:09,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:48:09,630 INFO L87 Difference]: Start difference. First operand 472 states and 522 transitions. Second operand 12 states. [2019-09-09 05:48:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:09,768 INFO L93 Difference]: Finished difference Result 520 states and 581 transitions. [2019-09-09 05:48:09,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-09 05:48:09,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-09-09 05:48:09,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:09,770 INFO L225 Difference]: With dead ends: 520 [2019-09-09 05:48:09,771 INFO L226 Difference]: Without dead ends: 482 [2019-09-09 05:48:09,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-09 05:48:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-09 05:48:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 466. [2019-09-09 05:48:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-09 05:48:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 513 transitions. [2019-09-09 05:48:09,780 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 513 transitions. Word has length 164 [2019-09-09 05:48:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:09,780 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 513 transitions. [2019-09-09 05:48:09,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-09 05:48:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 513 transitions. [2019-09-09 05:48:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:48:09,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:09,782 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:09,783 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:09,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1416389275, now seen corresponding path program 1 times [2019-09-09 05:48:09,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:09,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:09,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-09 05:48:09,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:09,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:09,933 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-09-09 05:48:09,935 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [250], [258], [263], [268], [273], [276], [291], [309], [321], [325], [328], [331], [334], [340], [358], [361], [364], [392], [397], [398], [400], [401], [439], [442], [447], [448], [454], [460], [462], [464], [471], [473], [475], [478], [497], [501], [505], [514], [520], [522], [525], [533], [536], [541], [548], [550], [557], [559], [560], [585], [588], [593], [596], [597], [598], [599], [600], [601], [651], [654], [656], [659], [667], [670], [680], [692], [695], [700], [711], [712], [921], [922], [955], [957], [961], [963], [970], [972], [973], [991], [994], [999], [1002], [1017], [1018], [1063], [1064], [1065], [1066], [1073], [1074], [1077], [1085], [1086], [1095], [1096], [1099], [1100], [1103], [1104], [1105], [1106], [1109], [1110], [1119], [1120], [1121], [1122], [1147], [1148], [1149], [1150], [1153], [1154], [1155] [2019-09-09 05:48:09,958 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:09,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:09,990 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:10,016 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:48:10,017 INFO L272 AbstractInterpreter]: Visited 86 different actions 111 times. Never merged. Never widened. Performed 964 root evaluator evaluations with a maximum evaluation depth of 10. Performed 964 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Never found a fixpoint. Largest state had 125 variables. [2019-09-09 05:48:10,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:10,017 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:48:10,159 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 77.21% of their original sizes. [2019-09-09 05:48:10,159 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:48:21,276 INFO L420 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2019-09-09 05:48:21,276 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:48:21,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:48:21,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [82] imperfect sequences [12] total 92 [2019-09-09 05:48:21,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:21,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-09 05:48:21,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-09 05:48:21,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=6327, Unknown=0, NotChecked=0, Total=6642 [2019-09-09 05:48:21,279 INFO L87 Difference]: Start difference. First operand 466 states and 513 transitions. Second operand 82 states. [2019-09-09 05:48:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:56,700 INFO L93 Difference]: Finished difference Result 511 states and 564 transitions. [2019-09-09 05:48:56,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-09 05:48:56,701 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 158 [2019-09-09 05:48:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:56,702 INFO L225 Difference]: With dead ends: 511 [2019-09-09 05:48:56,702 INFO L226 Difference]: Without dead ends: 478 [2019-09-09 05:48:56,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2669 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=479, Invalid=10233, Unknown=0, NotChecked=0, Total=10712 [2019-09-09 05:48:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-09 05:48:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 433. [2019-09-09 05:48:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-09-09 05:48:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 474 transitions. [2019-09-09 05:48:56,710 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 474 transitions. Word has length 158 [2019-09-09 05:48:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:56,710 INFO L475 AbstractCegarLoop]: Abstraction has 433 states and 474 transitions. [2019-09-09 05:48:56,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-09 05:48:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 474 transitions. [2019-09-09 05:48:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:48:56,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:56,713 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:56,713 INFO L418 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:56,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:56,713 INFO L82 PathProgramCache]: Analyzing trace with hash -947452387, now seen corresponding path program 1 times [2019-09-09 05:48:56,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:56,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:56,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:56,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:56,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-09 05:48:56,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:56,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:56,845 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-09-09 05:48:56,846 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [252], [258], [263], [268], [273], [276], [291], [309], [321], [325], [328], [331], [334], [340], [358], [361], [364], [392], [397], [398], [400], [401], [439], [442], [447], [448], [454], [460], [462], [464], [471], [473], [475], [478], [497], [501], [505], [514], [520], [522], [525], [533], [536], [541], [548], [550], [557], [559], [560], [585], [588], [593], [596], [597], [598], [599], [600], [601], [651], [654], [656], [659], [667], [670], [680], [692], [695], [700], [711], [712], [921], [922], [955], [957], [961], [963], [970], [972], [973], [991], [994], [999], [1002], [1017], [1018], [1063], [1064], [1065], [1066], [1073], [1074], [1077], [1085], [1086], [1095], [1096], [1099], [1100], [1103], [1104], [1105], [1106], [1109], [1110], [1119], [1120], [1121], [1122], [1147], [1148], [1149], [1150], [1153], [1154], [1155] [2019-09-09 05:48:56,853 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:56,853 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:56,897 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:56,926 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:48:56,927 INFO L272 AbstractInterpreter]: Visited 86 different actions 111 times. Never merged. Never widened. Performed 996 root evaluator evaluations with a maximum evaluation depth of 10. Performed 996 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Never found a fixpoint. Largest state had 125 variables. [2019-09-09 05:48:56,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:56,927 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:48:57,108 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 77.21% of their original sizes. [2019-09-09 05:48:57,108 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:49:08,102 INFO L420 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2019-09-09 05:49:08,102 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:49:08,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:49:08,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [82] imperfect sequences [12] total 92 [2019-09-09 05:49:08,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:08,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-09 05:49:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-09 05:49:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=6321, Unknown=0, NotChecked=0, Total=6642 [2019-09-09 05:49:08,105 INFO L87 Difference]: Start difference. First operand 433 states and 474 transitions. Second operand 82 states. [2019-09-09 05:49:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:55,870 INFO L93 Difference]: Finished difference Result 613 states and 679 transitions. [2019-09-09 05:49:55,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-09 05:49:55,870 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 158 [2019-09-09 05:49:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:55,872 INFO L225 Difference]: With dead ends: 613 [2019-09-09 05:49:55,872 INFO L226 Difference]: Without dead ends: 580 [2019-09-09 05:49:55,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2759 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=485, Invalid=10227, Unknown=0, NotChecked=0, Total=10712 [2019-09-09 05:49:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-09 05:49:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 338. [2019-09-09 05:49:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-09 05:49:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 368 transitions. [2019-09-09 05:49:55,879 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 368 transitions. Word has length 158 [2019-09-09 05:49:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:55,880 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 368 transitions. [2019-09-09 05:49:55,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-09 05:49:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 368 transitions. [2019-09-09 05:49:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:49:55,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:55,882 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:55,882 INFO L418 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:55,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:55,882 INFO L82 PathProgramCache]: Analyzing trace with hash -278790820, now seen corresponding path program 1 times [2019-09-09 05:49:55,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:55,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-09 05:49:56,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:56,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-09 05:49:56,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:56,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 05:49:56,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 05:49:56,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:49:56,048 INFO L87 Difference]: Start difference. First operand 338 states and 368 transitions. Second operand 10 states. [2019-09-09 05:49:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:57,119 INFO L93 Difference]: Finished difference Result 710 states and 783 transitions. [2019-09-09 05:49:57,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-09 05:49:57,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2019-09-09 05:49:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:57,122 INFO L225 Difference]: With dead ends: 710 [2019-09-09 05:49:57,122 INFO L226 Difference]: Without dead ends: 571 [2019-09-09 05:49:57,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2019-09-09 05:49:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-09 05:49:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 509. [2019-09-09 05:49:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-09-09 05:49:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 555 transitions. [2019-09-09 05:49:57,133 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 555 transitions. Word has length 161 [2019-09-09 05:49:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:57,133 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 555 transitions. [2019-09-09 05:49:57,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-09 05:49:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 555 transitions. [2019-09-09 05:49:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:49:57,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:57,135 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:57,136 INFO L418 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:57,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1201958246, now seen corresponding path program 1 times [2019-09-09 05:49:57,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:57,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:57,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:57,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:57,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:49:57,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:57,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:57,313 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2019-09-09 05:49:57,314 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [252], [258], [263], [268], [273], [276], [291], [309], [321], [325], [328], [331], [334], [340], [358], [361], [364], [392], [397], [398], [400], [401], [402], [413], [417], [427], [432], [436], [438], [439], [442], [447], [448], [454], [460], [462], [464], [471], [473], [475], [478], [497], [501], [505], [514], [518], [533], [536], [541], [548], [550], [557], [559], [560], [585], [588], [593], [596], [597], [598], [599], [600], [601], [651], [654], [656], [659], [667], [670], [672], [675], [680], [682], [692], [695], [700], [711], [712], [921], [922], [955], [957], [961], [963], [966], [968], [972], [973], [1017], [1018], [1063], [1064], [1065], [1066], [1073], [1074], [1077], [1085], [1086], [1095], [1096], [1099], [1100], [1105], [1106], [1109], [1110], [1119], [1120], [1121], [1122], [1147], [1148], [1149], [1150], [1151], [1152], [1153], [1154], [1155] [2019-09-09 05:49:57,316 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:57,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:57,365 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:57,505 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:49:57,506 INFO L272 AbstractInterpreter]: Visited 79 different actions 174 times. Merged at 12 different actions 26 times. Never widened. Performed 1517 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1517 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Never found a fixpoint. Largest state had 124 variables. [2019-09-09 05:49:57,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:57,506 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:49:57,685 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 70.88% of their original sizes. [2019-09-09 05:49:57,685 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:50:08,038 INFO L420 sIntCurrentIteration]: We unified 160 AI predicates to 160 [2019-09-09 05:50:08,039 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:50:08,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:50:08,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [75] imperfect sequences [15] total 88 [2019-09-09 05:50:08,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:08,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-09 05:50:08,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-09 05:50:08,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=5333, Unknown=0, NotChecked=0, Total=5550 [2019-09-09 05:50:08,040 INFO L87 Difference]: Start difference. First operand 509 states and 555 transitions. Second operand 75 states. [2019-09-09 05:50:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:54,539 INFO L93 Difference]: Finished difference Result 580 states and 634 transitions. [2019-09-09 05:50:54,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-09 05:50:54,539 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 161 [2019-09-09 05:50:54,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:54,542 INFO L225 Difference]: With dead ends: 580 [2019-09-09 05:50:54,542 INFO L226 Difference]: Without dead ends: 578 [2019-09-09 05:50:54,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1809 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=309, Invalid=7701, Unknown=0, NotChecked=0, Total=8010 [2019-09-09 05:50:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-09 05:50:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 560. [2019-09-09 05:50:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-09 05:50:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 613 transitions. [2019-09-09 05:50:54,564 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 613 transitions. Word has length 161 [2019-09-09 05:50:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:54,565 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 613 transitions. [2019-09-09 05:50:54,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-09 05:50:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 613 transitions. [2019-09-09 05:50:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:50:54,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:54,569 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:54,569 INFO L418 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:54,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:54,569 INFO L82 PathProgramCache]: Analyzing trace with hash 13797497, now seen corresponding path program 1 times [2019-09-09 05:50:54,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:54,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:54,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:54,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:54,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:50:54,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:50:54,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:50:54,790 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2019-09-09 05:50:54,790 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [252], [258], [263], [268], [273], [276], [291], [309], [321], [325], [328], [331], [334], [340], [358], [361], [364], [392], [397], [398], [400], [401], [402], [405], [408], [427], [432], [436], [438], [439], [442], [447], [448], [454], [460], [462], [464], [471], [473], [475], [478], [497], [501], [505], [514], [518], [533], [536], [541], [548], [550], [557], [559], [560], [585], [588], [593], [596], [597], [598], [599], [600], [601], [651], [654], [656], [659], [667], [670], [672], [677], [680], [684], [692], [695], [698], [700], [711], [712], [921], [922], [955], [957], [961], [963], [966], [968], [972], [973], [1017], [1018], [1063], [1064], [1065], [1066], [1073], [1074], [1077], [1085], [1086], [1095], [1096], [1099], [1100], [1105], [1106], [1109], [1110], [1119], [1120], [1121], [1122], [1147], [1148], [1149], [1150], [1151], [1152], [1153], [1154], [1155] [2019-09-09 05:50:54,792 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:50:54,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:50:54,826 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:50:55,023 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:50:55,024 INFO L272 AbstractInterpreter]: Visited 137 different actions 277 times. Merged at 30 different actions 44 times. Never widened. Performed 2525 root evaluator evaluations with a maximum evaluation depth of 10. Performed 2525 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 4 fixpoints after 2 different actions. Largest state had 124 variables. [2019-09-09 05:50:55,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:55,025 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:50:55,332 INFO L227 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 76.39% of their original sizes. [2019-09-09 05:50:55,332 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:51:06,641 INFO L420 sIntCurrentIteration]: We unified 160 AI predicates to 160 [2019-09-09 05:51:06,641 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:51:06,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:51:06,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [117] imperfect sequences [15] total 130 [2019-09-09 05:51:06,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:51:06,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-09 05:51:06,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-09 05:51:06,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=13074, Unknown=0, NotChecked=0, Total=13572 [2019-09-09 05:51:06,644 INFO L87 Difference]: Start difference. First operand 560 states and 613 transitions. Second operand 117 states. [2019-09-09 05:52:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:44,622 INFO L93 Difference]: Finished difference Result 755 states and 844 transitions. [2019-09-09 05:52:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-09 05:52:44,623 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 161 [2019-09-09 05:52:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:44,624 INFO L225 Difference]: With dead ends: 755 [2019-09-09 05:52:44,624 INFO L226 Difference]: Without dead ends: 355 [2019-09-09 05:52:44,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13672 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=2321, Invalid=51271, Unknown=0, NotChecked=0, Total=53592 [2019-09-09 05:52:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-09 05:52:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 191. [2019-09-09 05:52:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-09 05:52:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 201 transitions. [2019-09-09 05:52:44,634 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 201 transitions. Word has length 161 [2019-09-09 05:52:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:44,634 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 201 transitions. [2019-09-09 05:52:44,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-09 05:52:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 201 transitions. [2019-09-09 05:52:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-09 05:52:44,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:44,636 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:44,636 INFO L418 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:44,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:44,636 INFO L82 PathProgramCache]: Analyzing trace with hash -64679204, now seen corresponding path program 1 times [2019-09-09 05:52:44,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:44,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:44,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-09 05:52:44,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:44,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-09 05:52:44,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:44,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 05:52:44,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 05:52:44,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:52:44,797 INFO L87 Difference]: Start difference. First operand 191 states and 201 transitions. Second operand 12 states. [2019-09-09 05:52:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:45,025 INFO L93 Difference]: Finished difference Result 228 states and 245 transitions. [2019-09-09 05:52:45,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-09 05:52:45,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 169 [2019-09-09 05:52:45,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:45,027 INFO L225 Difference]: With dead ends: 228 [2019-09-09 05:52:45,027 INFO L226 Difference]: Without dead ends: 190 [2019-09-09 05:52:45,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-09-09 05:52:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-09 05:52:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2019-09-09 05:52:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-09 05:52:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 195 transitions. [2019-09-09 05:52:45,034 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 195 transitions. Word has length 169 [2019-09-09 05:52:45,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:45,035 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 195 transitions. [2019-09-09 05:52:45,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-09 05:52:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 195 transitions. [2019-09-09 05:52:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-09 05:52:45,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:45,036 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:45,036 INFO L418 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:45,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:45,037 INFO L82 PathProgramCache]: Analyzing trace with hash -195886787, now seen corresponding path program 1 times [2019-09-09 05:52:45,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:45,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:45,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:45,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:45,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-09 05:52:45,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:45,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:52:45,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:45,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:52:45,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:52:45,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:52:45,157 INFO L87 Difference]: Start difference. First operand 186 states and 195 transitions. Second operand 5 states. [2019-09-09 05:52:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:45,190 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-09-09 05:52:45,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:52:45,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-09-09 05:52:45,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:45,192 INFO L225 Difference]: With dead ends: 137 [2019-09-09 05:52:45,192 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:52:45,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:52:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:52:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:52:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:52:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:52:45,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169 [2019-09-09 05:52:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:45,194 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:52:45,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:52:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:52:45,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:52:45,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:52:45 BoogieIcfgContainer [2019-09-09 05:52:45,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:52:45,208 INFO L168 Benchmark]: Toolchain (without parser) took 374310.72 ms. Allocated memory was 134.7 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 89.5 MB in the beginning and 388.3 MB in the end (delta: -298.8 MB). Peak memory consumption was 769.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,209 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.48 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 89.3 MB in the beginning and 160.5 MB in the end (delta: -71.2 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,212 INFO L168 Benchmark]: Boogie Preprocessor took 130.52 ms. Allocated memory is still 201.3 MB. Free memory was 160.5 MB in the beginning and 156.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,218 INFO L168 Benchmark]: RCFGBuilder took 1318.82 ms. Allocated memory was 201.3 MB in the beginning and 229.6 MB in the end (delta: 28.3 MB). Free memory was 156.1 MB in the beginning and 157.9 MB in the end (delta: -1.8 MB). Peak memory consumption was 81.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,219 INFO L168 Benchmark]: TraceAbstraction took 372142.37 ms. Allocated memory was 229.6 MB in the beginning and 1.2 GB in the end (delta: 973.1 MB). Free memory was 157.9 MB in the beginning and 388.3 MB in the end (delta: -230.4 MB). Peak memory consumption was 742.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:52:45,230 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 714.48 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 89.3 MB in the beginning and 160.5 MB in the end (delta: -71.2 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.52 ms. Allocated memory is still 201.3 MB. Free memory was 160.5 MB in the beginning and 156.1 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1318.82 ms. Allocated memory was 201.3 MB in the beginning and 229.6 MB in the end (delta: 28.3 MB). Free memory was 156.1 MB in the beginning and 157.9 MB in the end (delta: -1.8 MB). Peak memory consumption was 81.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 372142.37 ms. Allocated memory was 229.6 MB in the beginning and 1.2 GB in the end (delta: 973.1 MB). Free memory was 157.9 MB in the beginning and 388.3 MB in the end (delta: -230.4 MB). Peak memory consumption was 742.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1626]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 392 locations, 1 error locations. SAFE Result, 372.0s OverallTime, 74 OverallIterations, 2 TraceHistogramMax, 300.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28649 SDtfs, 14158 SDslu, 105628 SDs, 0 SdLazy, 35622 SolverSat, 2382 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1594 GetRequests, 504 SyntacticMatches, 11 SemanticMatches, 1079 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26455 ImplicationChecksByTransitivity, 90.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1142occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 5 AbstIntIterations, 5 AbstIntStrong, 0.9681319061302962 AbsIntWeakeningRatio, 2.1806615776081424 AbsIntAvgWeakeningVarsNumRemoved, 23.287531806615775 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 74 MinimizatonAttempts, 2884 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 5927 NumberOfCodeBlocks, 5927 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 5853 ConstructedInterpolants, 0 QuantifiedInterpolants, 983613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 74 InterpolantComputations, 69 PerfectInterpolantSequences, 444/459 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...